Document Type
Article
Journal/Book Title/Conference
The Journal of the Astronautical Sciences
Volume
68
Publisher
Springer
Publication Date
5-17-2021
First Page
444
Last Page
479
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial 4.0 License
Abstract
Convex optimization techniques have deterministic convergence properties, are self-starting, i.e., they do not require an initial guess, and have been tested in real-time environments. These optimization techniques are applied to the trajectory planning problem for orbital rendezvous and proximity operations. Spacecraft rendezvous, inspection, and final approach trajectories are considered. Optional trajectory constraints are considered, including approach corridors, keep-out zones, and maximum thrust acceleration levels. Two linear dynamics models are investigated: Clohessy-Wiltshire dynamics to describe the relative motion in a local-horizontal local-vertical frame, and a new relative orbital motion dynamics model to describe the motion relative to a spinning or uncontrolled spacecraft. In both cases, an algorithm based on a second-order cone program is developed and used to generate optimal rendezvous and proximity operation trajectories. Results for several scenarios are presented and implemented in a nonlinear orbital simulation.
Recommended Citation
Ortolano, Nicholas; Geller, David K.; and Avery, Aaron, "Autonomous Optimal Trajectory Planning for Orbital Rendezvous, Satellite Inspection, and Final Approach Based on Convex Optimization" (2021). Space Dynamics Laboratory Publications. Paper 236.
https://digitalcommons.usu.edu/sdl_pubs/236