@Article{cmes.2021.014474,
AUTHOR = {Jian Ma, Changxuan Wen, Chen Zhang},
TITLE = {Practical Optimization of Low-Thrust Minimum-Time Orbital Rendezvous in Sun-Synchronous Orbits},
JOURNAL = {Computer Modeling in Engineering \& Sciences},
VOLUME = {126},
YEAR = {2021},
NUMBER = {2},
PAGES = {617--644},
URL = {http://www.techscience.com/CMES/v126n2/41293},
ISSN = {1526-1506},
ABSTRACT = {High-specific-impulse electric propulsion technology is promising for future space robotic debris removal in sun-synchronous orbits. Such a prospect involves solving a class of challenging problems of low-thrust orbital rendezvous between an active spacecraft and a free-flying debris. This study focuses on computing optimal low-thrust minimum-time many-revolution trajectories, considering the effects of the Earth oblateness perturbations and null thrust in Earth shadow. Firstly, a set of mean-element orbital dynamic equations of a chaser (spacecraft) and a target (debris) are derived by using the orbital averaging technique, and specifically a slow-changing state of the mean longitude difference is proposed to accommodate to the rendezvous problem. Subsequently, the corresponding optimal control problem is formulated based on the mean elements and their associated costate variables in terms of Pontryaginâ€™s maximum principle, and a practical optimization procedure is adopted to find the specific initial costate variables, wherein the necessary conditions of the optimal solutions are all satisfied. Afterwards, the optimal control profile obtained in mean elements is then mapped into the counterpart that is employed by the osculating orbital dynamics. A simple correction strategy about the initialization of the mean elements, specifically the differential mean true longitude, is suggested, which is capable of minimizing the terminal orbital rendezvous errors for propagating orbital dynamics expressed by both mean and osculating elements. Finally, numerical examples are presented, and specifically, the terminal orbital rendezvous accuracy is verified by solving hundreds of rendezvous problems, demonstrating the effectiveness of the optimization method proposed in this article.},
DOI = {10.32604/cmes.2021.014474}
}