Sampling-Based Reachable Set Approximation Algorithm

Author: Tianjiang Shuo

Website: https://cislunarspace.cn

Definition

Algorithm that rapidly approximates reachable sets by sampling terminal costates from a 6D unit ball, leveraging the duality between minimum-time trajectories and reachable set boundaries.

  • Libration Point / Lagrange Point

References

  • Bowerfind和Taheri - 2024
Improve this page
Last Updated:
Contributors: ouyangjiahong, Ou Yang Jiahong