Recent research on on-orbit service rarely considers the complex shapes of servicing spacecraft (chaser) and the target simultaneously, which could cause collision problems in ultra-close-range proximity. This paper presents a novel trajectory planning method via critical safety curve (TPCSC). The core of the framework is the construction of collision avoidance constraints called critical safety curve (CSC) using geometrized mathematical methods. CSC has good mathematical properties and innovatively combines the complex shape and relative attitude constraints of two spacecraft. Subsequently, TPCSC proposes an improved disturbed fluid method based on CSC that can handle non-convex constraints to generate smooth approach trajectories. Finally, the framework can achieve ultra-close-range proximity between spacecraft with complex shapes under complex non-convex constraints. The simulation results indicate that the planning of TPCSC is rapid, and the formed trajectory is safe, smooth, and easy to track.
This paper proposes a method based on the attention mechanism combined with a pointer network for rapidly generating sequences of Active debris removal (ADR) missions. Initially, the paper introduces the problem and modeling of ADR missions, establishing the multi-target planning problem as a time-dependent traveling salesman problem (TDTSP) considering the time dimension. Subsequently, during the spacecraft transfer process, it considers using continuous-thrust transfer, utilizing Pontryagin’s minimum principle to transform the fuel-optimal continuous-thrust transfer problem into a two-point boundary value problem (TPBVP), then rapidly generating a continuous-thrust dataset to train a surrogate model for evaluating continuous-thrust cost. Furthermore, PN-attention is proposed, which is derived from a pointer network (PN) model that incorporates attention computation, aimed at learning the sequence planning of ADR problems. In the validation and discussion section, PN-attention’s performance in solving ADR problems is compared with various heuristic algorithms, verifying its effectiveness, optimality, generalizability, and solution speed.
8 August 2024 in IEEE Transactions on Industrial Electronics
To ensure that multiagent’s collision-free traversal in a complex 3-D space with numerous obstacles, this article proposes an online centralized path planning and distributed tracking control method. First, considering the position and overall size of the numerous obstacles in 3-D space, a threat model is established by using Gaussian mixture model, which assigns a different threat level to each location in the 3-D space, with closer obstacles posing a greater threat. Subsequently, five rules are defined based on the threat model, namely, target steering, minimal threat, threat threshold, direct connection, and mixed threat. A combination of these rules is used to design a shortest, collision-free, and fast path planning algorithm for the multiagent. To ensure holistic optimality, multiagent path planning is designed as a centralized computation. A distributed tracking control algorithm is then designed based on model predictive control. Finally, the proposed methods are verified by both numerical simulations and semiphysical simulations based on the air-float experimental system, proving the stable generation of collision-free traversal paths in numerous obstacles, and the accurate tracking control. The simulations show that the proposed methods have the characteristics of minimal path length, high-efficiency computation, robust security, general applicability, and small control error.
This paper studies the safety control problem for rotating spacecraft proximity maneuver in presence of complex shaped obstacles. First, considering the attitude change of the target spacecraft, a dynamic model of close-range relative motion in a body-fixed coordinate system is derived using a novel approach. Then, the Gaussian mixture model (GMM) is utilized to reconstruct the complex shape of the spacecraft, and a novel GMM-based artificial potential function (APF) is proposed to represent the collision avoidance requirement. By combining GMM-based APF with fixed-time stability methodology, a fixed-time control (FTC) is designed for close-range proximity operation to a rotating spacecraft having a complex shape. The presented GMM-FTC scheme can guarantee the convergence of relative state errors, and ensure that no collision occurs. Finally, simulation results are provided to illustrate the feasibility of the proposed control approach.
Spacecraft safe proximity, as a critical component of on-orbit servicing missions, primarily encounters the following two challenges: the partial observability of the environment surrounding the service spacecraft and the necessity to evade uncertain obstacles. A safe reinforcement learning algorithm based on a graph neural network is proposed to address the constrained Markov decision problem in partially observable scenarios for spacecraft safe proximity missions. A graph neural network mechanism is introduced to solve the problem of dynamic variations in the quantity and location of obstacles in the observation area of the service spacecraft. The graph attention network is used to facilitate the extraction of feature information from the graph structure, which is then utilized as input for the subsequent reinforcement learning algorithm. The Soft Actor–Critic–Lagrangian algorithm is adopted to deal with the problems of tuning reward function parameters and balancing safety and optimality. By introducing Lagrange multipliers, the constrained optimization problem is transformed into an unconstrained optimization problem. In order to verify the effectiveness of the algorithm proposed in this paper, a spacecraft safe proximity environment model with dynamic obstacles is constructed, and the GAT-SACL algorithm proposed in this paper is validated by the Monte Carlo shooting method. The results show that the GAT-SACL algorithm possess excellent exploratory characteristics and delivers significant advantages in balancing optimality and safety.