空间站多飞行器协同转移与贴表飞行规划方法

A Trajectory Planning Method for Cooperative Multi-spacecraft Orbital Transfer and Surface-Tracking Proximity Operations Around a Space Station

  • 摘要: 本文针对大型复杂非结构化空间站环境下多飞行器集群的轨迹转移和贴表飞行问题,提出了一种结合远距离最小燃料转移与近端狭窄区域姿态约束安全飞行的协同轨迹规划方法. 基于斐波那契球面采样与Clohessy-Wiltshire(CW)方程,实现了多飞行器从初始位置至空间站外接球面的燃料最优协同转移;利用具备姿态可行性判定功能的A*路径搜索算法,识别需以特定姿态穿越的狭窄区域并构建安全飞行走廊(SFC);以SFC为硬约束、CW方程为软约束,采用最小加加加速度轨迹优化方法生成动力学可行轨迹. 仿真结果表明,相较于常规的球体包络规划与固定时间转移策略,所提方法有效降低了燃料消耗,并显著提升了飞行器在复杂结构间隙中的通过能力与轨迹平滑度,适用于多智能体在非结构化环境中的协同贴表飞行任务,为未来空间站在轨服务与集群操作提供了可靠的技术支撑.

     

    Abstract: This paper addresses the trajectory transfer and proximity flight problems of multi-spacecraft swarms operating in large-scale, complex, and unstructured space-station environments. A cooperative trajectory planning method is proposed, combining long-range minimum fuel transfer with attitude-constrained safe flight in proximal regions. Based on Fibonacci-sphere sampling and the Clohessy–Wiltshire (CW) equations, a fuel-optimal cooperative transfer is achieved from the initial states of multiple spacecraft to the circumscribed sphere of the space station. An A*-based path search algorithm with attitude-feasibility checking is employed to identify narrow regions that require specific attitudes for traversal, based on which a safe flight corridor (SFC) is constructed. Taking the SFC as a hard constraint and the CW equations as soft constraints, dynamically feasible trajectories are generated using a minimum-snap optimization method. Simulation results demonstrate that, compared with conventional spherical-envelope planning and fixed-time transfer strategies, the proposed method effectively reduces fuel consumption and significantly improves spacecraft navigability through narrow structural gaps as well as trajectory smoothness. The method is suitable for cooperative proximity-flight tasks of multi-agent systems in unstructured environments and provides reliable technical support for future space-station on-orbit servicing and cluster operations.

     

/

返回文章
返回