4.6 Article

Model predictive control for close-proximity maneuvering of spacecraft with adaptive convexification of collision avoidance constraints

期刊

ADVANCES IN SPACE RESEARCH
卷 71, 期 1, 页码 477-491

出版社

ELSEVIER SCI LTD
DOI: 10.1016/j.asr.2022.08.089

关键词

Model Predictive Control; Close-proximity maneuvering; Collision avoidance constraints; Convex programming

向作者/读者索取更多资源

This study investigates model predictive control (MPC) for spacecraft close-proximity maneuvering. It presents a method to improve the performance and computational efficiency of MPC for rendezvous and docking with both nonrotating and rotating client spacecraft. The proposed method utilizes an ellipsoid and linearization technique to handle collision avoidance constraints and derives an adaptive convex programming algorithm suitable for real-time implementation.
This study investigated model predictive control (MPC) for close-proximity maneuvering of spacecraft. It is essential for a designed MPC to effectively handle collision avoidance between the servicer spacecraft and the client spacecraft, especially while the client is rotat-ing. The rotating motion of the client leads to dynamic changes in the collision avoidance constraints, which increases the difficulty of optimizing the control input in the MPC framework. Therefore, this study presents a method to improve the performance and compu-tational efficiency of MPC for rendezvous and docking with a nonrotating or rotating client. An ellipsoid is adopted to model the client's keep-out zone (KOZ). Given the spherical KOZ of the servicer, an expanded ellipsoid is introduced to describe the KOZ for the center of mass of the servicer and modeled as a nonlinear constraint. The linearization method for reference points located at the expanded ellip-soid is adopted to convexify the nonlinear constraints. The reference points are adaptively determined according to the positions of the servicer, client, and expanded ellipsoidal KOZ. The resulting hyperplanes are then used to describe the collision avoidance constraints. By utilizing the aforementioned strategies, combined with the calculated reference points, an adaptive convex programming algorithm suitable for real-time implementation of MPC is derived. The performance of the proposed method is demonstrated through numerical simulations. (c) 2022 COSPAR. Published by Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据