返回
Optimal Multi-impulse Linear Rendezvous via Reinforcement Learning
DOI:10.34133/space.0047.png)
摘要
En 中文
A reinforcement learning-based approach is proposed to design the multi-impulse rendezvous trajectories in linear relative motions. For the relative motion in elliptical orbits, the relative state propagation is obtained directly from the state transition matrix. This rendezvous problem is constructed as a Markov decision process that reflects the fuel consumption, the transfer time, the relative state, and the dynamical model. An actor-critic algorithm is used to train policy for generating rendezvous maneuvers. The results of the numerical optimization (e.g., differential evolution) are adopted as the expert data set to accelerate the training process. By deploying a policy network, the multi-impulse rendezvous trajectories can be obtained on board. Moreover, the proposed approach is also applied to generate a feasible solution for many impulses (e.g., 20 impulses), which can be used as an initial value for further optimization. The numerical examples with random initial states show that the proposed method is much faster and has slightly worse performance indexes when compared with the evolutionary algorithm.
Keyword:
OPTIMAL LOW-THRUST
MANEUVERS
NETWORKS
VICINITY
GAME
GO
期刊
S
IF:
6.8
论文数:
271
被引数:
797
机构
引用论文
Two-dimensional lamellar polyimide/cardanol-based benzoxazine copper polymer composite coatings with excellent anti-corrosion performance
RSC Advances
IF0
Fabrication of porous hollow γ-Al2O3 nanofibers by facile electrospinning and its application for water remediation静电纺丝法制备多孔中空 γ-Al2O3纳米纤维及其在水体修复中的应用
Optimization of multiple-impulse minimum-time rendezvous with impulse constraints using a hybrid genetic algorithm使用混合遗传算法优化具有冲动约束的多冲动最小时间交会
SciPy 1.0: fundamental algorithms for scientific computing in PythonSciPy 1.0: Python中科学计算的基本算法
NATURE METHODS
IF32.1

