数学优化
稳健性(进化)
计算机科学
控制理论(社会学)
航天器
凸优化
最优化问题
数学
算法
正多边形
人工智能
工程类
生物化学
化学
几何学
控制(管理)
基因
航空航天工程
作者
Zichen Zhao,Haibin Shang,Ai Gao,Rui Xu
出处
期刊:Journal of Guidance Control and Dynamics
[American Institute of Aeronautics and Astronautics]
日期:2023-04-02
卷期号:: 1-17
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI