TY - JOUR
T1 - Autonomous Laser-Link Reacquisition for Gravitational Wave Detection Using Multistage Convex Optimization
AU - Zhao, Zichen
AU - Shang, Haibin
AU - Gao, Ai
AU - Xu, Rui
N1 - Publisher Copyright:
© 2023, AIAA International. All rights reserved.
PY - 2023/7
Y1 - 2023/7
N2 - The autonomous reacquisition of laser links between distributed spacecraft is the fundamental technique in missions to detect gravitational waves in space. It involves rapidly maneuvering three spacecraft’s attitudes to adjust their laser beams so that they can cover one another within regions of uncertainty that arise owing to various spatial disturbances and system errors. This paper develops a methodology within the framework of convex optimization to optimize the reacquisition procedure on board and to reduce the duration of reacquisition, and therefore the region of uncertainty changing over the temporal history. A sampling-based method of modeling is first developed to remodel the problem of reacquisition as an equivalent problem of convex optimization with additional minimum-function constraints. An approach to penalization relaxation is then presented to convexify the minimum-function constraint and significantly improve the convergence of the algorithm by overcoming the drawbacks of potential artificial infeasibility, zero-gradient singularity, and solution-chattering situations. Finally, a detailed characterization of task uncertainty is considered to improve the applicability of the proposed method. Numerical comparisons between the proposed method and the most relevant techniques researched in recent studies are provided under multiple, randomly generated simulation environments to demonstrate its efficiency, universality, and robustness.
AB - The autonomous reacquisition of laser links between distributed spacecraft is the fundamental technique in missions to detect gravitational waves in space. It involves rapidly maneuvering three spacecraft’s attitudes to adjust their laser beams so that they can cover one another within regions of uncertainty that arise owing to various spatial disturbances and system errors. This paper develops a methodology within the framework of convex optimization to optimize the reacquisition procedure on board and to reduce the duration of reacquisition, and therefore the region of uncertainty changing over the temporal history. A sampling-based method of modeling is first developed to remodel the problem of reacquisition as an equivalent problem of convex optimization with additional minimum-function constraints. An approach to penalization relaxation is then presented to convexify the minimum-function constraint and significantly improve the convergence of the algorithm by overcoming the drawbacks of potential artificial infeasibility, zero-gradient singularity, and solution-chattering situations. Finally, a detailed characterization of task uncertainty is considered to improve the applicability of the proposed method. Numerical comparisons between the proposed method and the most relevant techniques researched in recent studies are provided under multiple, randomly generated simulation environments to demonstrate its efficiency, universality, and robustness.
UR - http://www.scopus.com/inward/record.url?scp=85174232041&partnerID=8YFLogxK
U2 - 10.2514/1.G006966
DO - 10.2514/1.G006966
M3 - Article
AN - SCOPUS:85174232041
SN - 0731-5090
VL - 46
SP - 1348
EP - 1364
JO - Journal of Guidance, Control, and Dynamics
JF - Journal of Guidance, Control, and Dynamics
IS - 7
ER -