A Convex Formulation of the Soft-Capture Problem
arxiv(2024)
摘要
We present a fast trajectory optimization algorithm for the soft capture of
uncooperative tumbling space objects. Our algorithm generates safe, dynamically
feasible, and minimum-fuel trajectories for a six-degree-of-freedom servicing
spacecraft to achieve soft capture (near-zero relative velocity at contact)
between predefined locations on the servicer spacecraft and target body. We
solve a convex problem by enforcing a convex relaxation of the field-of-view
constraint, followed by a sequential convex program correcting the trajectory
for collision avoidance. The optimization problems can be solved with a
standard second-order cone programming solver, making the algorithm both fast
and practical for implementation in flight software. We demonstrate the
performance and robustness of our algorithm in simulation over a range of
object tumble rates up to 10/s.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要