Abstract
This paper investigates the orbital pursuit strategy for spacecraft swarms, where both pursuers and evaders possess limited delta-v maneuvering capabilities. Given that swarms can consist of numerous members, ranging from dozens to thousands, the swarm-to-swarm problem has significant coupling effects that cannot be solved by merely superimposing one-to-one or few-to-few problems. Otherwise, one would cause a dimension explosion in decision-making space. To avoid this issue, the swarm orbital pursuit problem is divided into two coupled problems: swarm target allocation and orbital maneuver. First, considering the relative orbit state between pursuers and evaders and estimated orbital maneuver costs of pursuit, the swarm target allocation problem is formulated into three coupled sub-problems, i.e., target allocation order, target allocation for sub-swarms, and target allocation for individuals. These sub-problems are solved by the presented double-layer contract net protocol algorithm to maximize task completion efficiency. Then, the orbital maneuver problem is decomposed into two coupled problems to maximize pursuit benefits, i.e., long-range rendezvous, and close-distance game maneuvers. For the long-range rendezvous, the optimal Lambert algorithm is developed to efficiently obtain the discrete optimal pursuit time and corresponding orbital transfer maneuver. To address close-distance games more proficiently, a hybrid orbital maneuver algorithm, combining the proximal policy optimization and the Lambert algorithm is proposed. Finally, comparison simulations verified the effectiveness and superiority of the proposed method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.