Rapid trajectory planning of a reusable launch vehicle for airdrop with geographic constraints

Abstract

Online feasible trajectory generation for an airdrop unpowered reusable launch vehicle is addressed in this article. A rapid trajectory planning algorithm is proposed to satisfy not only the multiple path and terminal constraints but also the complex geographic constraints of waypoints and no-fly zones. Firstly, the lower and upper boundaries of the bank angle that implement all the path constraints are obtained based on the quasi-equilibrium glide condition. To determine the bank angle directly, a weighted interpolation of the boundaries is then developed, which provides an effective approach to simplify the planning process as a one-parameter search problem. Subsequently, three types of lateral planning algorithms are designed to determine the sign of the bank angle according to the requirements of waypoints passage, no-fly-zones avoidance, and terminal constraints in the airdrop process, and the convergence of these methods for passing over the waypoints and meeting the terminal conditions has been clarified and formally demonstrated. Considering the constraints in the actual airdrop flight missions, the planning trajectory is divided into several subphases to facilitate the application of corresponding algorithms. Finally, the performance of the proposed algorithm is assessed through three airdrop missions of reusable launch vehicle with different geographic constraints. Besides, the effectiveness of the algorithm is demonstrated by the Monte Carlo simulation results.

CACLA-Based Trajectory Tracking Guidance for RLV in Terminal Area Energy Management Phase

“…The return process of RLV includes the initial re-entry stage, the Terminal Area Energy Management (TAEM) stage and the automatic landing stage [ 6 , 7 , 8 ]. In the initial reentry phase, the atmosphere is thin, and the trajectory control ability of RLV is weak [ 9 , 10 , 11 ]. In the automatic landing phase, RLV is very close to the ground, and the adjustable range and remaining time of the trajectory are very limited [ 12 , 13 ].…”

ADP-Based Intelligent Decentralized Control for Multi-Agent Systems Moving in Obstacle Environment

“…It is inevitable to research the issue of obstacle avoidance, as the agents should work in real environment. Obstacle avoidance control has been widely addressed in the last few decades [12], [13]. The artificial potential field (APF) algorithm is the most commonly used method, with lots The associate editor coordinating the review of this manuscript and approving it for publication was Yichuan Jiang.…”