摘要
In view of the parallel states and coupling operation constraints of the probes, a landmarks extraction algorithm is proposed based on a timeline-based hmaxheuristic method. Then, in order to reduce the time of repeatedly calculating the landmarks, an incremental search algorithm is designed for dynamically updating landmarks. In addition, a node selection strategy based on the max goal is used for simplicity, and a heuristic planning algorithm with timeline transition landmarks is finally proposed combining all the above methods. The simulation results indicate that the algorithm can prune irrelevant and unnecessary plan steps, and improve the planning efficiency.
投稿的翻译标题 | Heuristic Planning Method Based on Timeline Transition Landmarks for Deep Space Probes |
---|---|
源语言 | 繁体中文 |
页(从-至) | 862-872 |
页数 | 11 |
期刊 | Yuhang Xuebao/Journal of Astronautics |
卷 | 42 |
期 | 7 |
DOI | |
出版状态 | 已出版 - 30 7月 2021 |
关键词
- Deep space probes
- Mission planning
- Timeline landmarks extraction
- Transition landmarks heuristics