Trajectory planning for satellite cluster reconfigurations with sequential convex programming method
This paper presents trajectory planning algorithms for large-scale satellite clusters reconfiguration based on sequential convex programming, and these algorithms consider fuel consumption and collision avoidance. Firstly, the trajectory planning problem is formulated as a nonconvex optimal control...
Saved in:
| Published in: | Aerospace science and technology Vol. 136; p. 108216 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Masson SAS
01.05.2023
|
| Subjects: | |
| ISSN: | 1270-9638 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper presents trajectory planning algorithms for large-scale satellite clusters reconfiguration based on sequential convex programming, and these algorithms consider fuel consumption and collision avoidance. Firstly, the trajectory planning problem is formulated as a nonconvex optimal control problem with nonlinear dynamics and nonconvex path constraints. Secondly, the original nonlinear continuous optimal control problem is transformed into a discrete convex optimization subproblem through linearization and discretization. Collision avoidance strategy between discrete points and obstacle avoidance constraints are considered in the convex subproblem to ensure that the trajectories are collision-free. Thirdly, coupled and decoupled sequential convex programming methods are proposed for rapidly generating collision-free and fuel-efficient trajectories. Finally, comparative numerical simulations are presented to demonstrate that as the number of satellites increases, 94 to 99 percent performance improvement over the pseudo-spectral method is achieved in terms of computational efficiency. |
|---|---|
| ISSN: | 1270-9638 |
| DOI: | 10.1016/j.ast.2023.108216 |