In many space missions, spacecraft are required to have the ability to avoid various obstacles and finally reach the target point. In this paper, the path planning of spacecraft attitude maneuver under boundary constraints and pointing constraints is studied. The boundary constraints and orientation constraints are constructed as finite functions of path evaluation. From the point of view of optimal time and shortest path, the constrained attitude maneuver problem is reduced to optimal time and path solving problem. To address this problem, a metaheuristic maneuver path planning method is proposed (cross-mutation grey wolf algorithm (CMGWO)). In the CMGWO method, we use angular velocity and control torque coding to model attitude maneuver, which increases the difficulty of solving the problem. In order to deal with this problem, the grey wolf algorithm is used for mutation and evolution, so as to reduce the difficulty of solving the problem and shorten the convergence time. Finally, simulation analysis is carried out under different conditions, and the feasibility and effectiveness of the method are verified by numerical simulation.
Application of the Improved Grey Wolf Algorithm in Spacecraft Maneuvering Path Planning
2022
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Attitude maneuvering path planning method based on improved grey wolf algorithm
European Patent Office | 2024
|Automated guided vehicle path planning based on an improved grey wolf optimization algorithm
British Library Conference Proceedings | 2022
|Improved Spacecraft Magnetic Attitude Maneuvering
AIAA | 2019
|