关键词: 非合作目标, 轨迹优化, 禁飞区, 微分平坦性, 非均匀有理b样条, 凸优化

Abstract:

This paper studies the trajectory planning problem of spacecraft approaching non-cooperative targets while avoiding their field of view in space attack and defense. For the trajectory optimization problem with multiple constraints and strong nonlinearity， an efficient convexification and parameterization reconstruction method is proposed. First， the spacecraft approach trajectory planning is transformed into an optimal control problem containing non-convex constraints. A new convexification technology for field of view avoidance constraints is innovatively proposed. By introducing slack variables， a class of non-convex constraints are dimensionally expanded and softened， thereby realizing the overall transformation to a convex problem. In addition， the dynamic system is efficiently reconstructed based on differential flatness theory， and non-uniform rational b-spline curves are used to parameterize the state variables， control variables and the introduced slack variables， which greatly reduces the computational complexity. By designing multiple types of simulation scenarios for simulation analysis， it is verified that the algorithm can successfully plan an effective trajectory under strict compliance with various motion constraints， which can ensure that the spacecraft can safely avoid obstacles and avoid the detection field of view of non-cooperative targets. Through comparative simulation analysis， the proposed algorithm has comparable trajectory optimization quality and has advantages in solution speed compared with model predictive control and pseudo-spectral method.

Key words: non-cooperative target, trajectory optimization, keep out zone, differential flatness, non-uniform rational b-spline, convex optimization