Trajectory Optimization Problem Research Articles

An improved convex optimization-based guidance for fuel-optimal powered landing

Convex optimization has great potential for onboard trajectory generation which can eliminate large state deviations and improve landing precision. In practical applications, the convex optimization problem is often infeasible under disturbances. In this paper, we analyze the reason for the infeasibility of the fuel-optimal trajectory optimization problem. The analysis result shows that the thrust saturation degrade the anti-disturbance performance and then lead to infeasibility. Based on this analysis, we improved the anti-disturbance performance of convex optimization-based guidance from two aspects: (1) a maximum-thrust regulation strategy is embedded into the original fuel-optimal problem to avoid thrust saturation; (2) a trajectory tracking method with a disturbance compensator is performed to attenuate disturbance effects and to make the initial state of each optimization cycle close to the existing feasible trajectory. Numerical simulations demonstrate that the proposed method can improve the infeasibility and can realize the high-precision landing under disturbances.

Robust trajectory planning for non-cooperative target rendezvous based on closed-loop uncertainty analysis

A robust trajectory planning method for non-cooperative target rendezvous is investigated based on closed-loop uncertainty analysis. The proposed method addresses the issue that uncertainties affect the optimality of objective functions and the reliability of constraints. Considering multiple uncertainties, a stochastic optimal rendezvous model with a robustness performance index and chance constraints is presented with line-of-sight dynamics. The guidance model, angles-only navigation model and control model are derived, and uncertainty propagation equations for closed-loop GN&C system is proposed by using linear covariance analysis. The stochastic optimal rendezvous model is transformed into a robust optimal rendezvous model by using 3-σ of the random variables. The genetic algorithm is used to solve the robust trajectory planning problem, and a series of examples demonstrate that the robust maneuver solution can be significantly better than the solution corresponding to deterministic trajectory optimization problem.

Trajectory optimization of unmanned aerial vehicles in the electromagnetic environment

AbstractWe consider a type of routing problems common in defence and security, in which we control a fleet of unmanned aerial vehicles (UAVs) that have to reach one or more target locations without being detected by an adversary. Detection can be carried out by a variety of sensors (radio receivers, cameras, personnel, etc) placed by the adversary around the target sites. We model the act of detecting a UAV from first principles by noting that sensors work by monitoring frequencies in the electromagnetic spectrum for signals or noise emitted. By this, we are able to provide a flexible and versatile nonlinear optimisation framework in which the problem is modeled as a novel trajectory optimisation problem with paths of the UAVs as continuous arcs in an Euclidean space. The flexibility of our approach is exhibited by the fact that we can easily consider various relevant objectives, among them minimising the overall probability of detection and maximising the location error that the adversary experiences when trying to locate our UAVs. Our model is also versatile enough to consider the act of jamming, in which one or more of our UAVs intentionally send out signals to interfere with the operations of the adversary’s sensors. Numerical results show the flexibility of our framework, and that we can solve realistic instances of this problem type.

A Decision Support Framework for Aircraft Arrival Scheduling and Trajectory Optimization in Terminal Maneuvering Areas

This study introduces a decision support framework that integrates aircraft trajectory optimization and arrival scheduling to facilitate efficient management of descent operations for arriving aircraft within terminal maneuvering areas. The framework comprises three modules designed to tackle specific challenges in the descent process. The first module formulates and solves a trajectory optimization problem, generating a range of candidate descent trajectories for each arriving aircraft. The options for descent operations include step-down descent operation, Continuous Descent Operation (CDO), and CDO with a lateral path stretching strategy. The second module addresses the assignment of conflict-free trajectories to aircraft, determining precise arrival times at each waypoint. This is achieved by solving an aircraft arrival scheduling problem. To overcome computational complexities, a novel variable neighborhood search algorithm is proposed as the solution approach. This algorithm utilizes three neighborhood structures within an extended relaxing and solving framework, and incorporates a tabu search algorithm to enhance the efficiency of the search process in the solution space. The third module focuses on comparing the total cost incurred from flight delays and fuel consumption across the three descent operations, enabling the selection of the most suitable operation for the descent process. The decision support framework is evaluated using real air traffic data from Guangzhou Baiyun International Airport. Experimental results demonstrate that the framework effectively supports air traffic controllers by scheduling more cost-efficient descent operations for arrival aircraft.

Optimal combined impulsive/low-thrust trajectories for asteroid deflection via kinetic impact

This work considers the trajectory optimization of a kinetic impactor spacecraft, which is sent to collide with a threatening near-Earth asteroid. It is assumed that Earth departure is done impulsively, by the upper stage of a launch vehicle, and is then followed by low-thrust electric propulsion until impact. For a given spacecraft, all of the important decision parameters, such as the date of departure, the direction of the hyperbolic departure, the thrust program, i.e. the history of the low-thrust pointing angles, and the date of impact are all chosen by the optimizer to maximize the perigee radius of the asteroid at its closest approach. Normally a trajectory optimization problem of this type would need to be described by many hundreds of decision parameters, e.g. if formulated to be solved by an optimization package (such as GPOPS) using nonlinear programming. We show that a successful and accurate optimization of the mission is possible using the heuristic method, particle swarm, and only 16 decision parameters, and present results for the deflection of 99942 Apophis at its 2029 close approach.

Multiple-arc optimization of low-thrust Earth–Moon orbit transfers leveraging implicit costate transformation

This work focuses on minimum-time low-thrust orbit transfers from a prescribed low Earth orbit to a specified low lunar orbit. The well-established indirect formulation of minimum-time orbit transfers is extended to a multibody dynamical framework, with initial and final orbits around two distinct primaries. To do this, different representations, useful for describing orbit dynamics, are introduced, i.e., modified equinoctial elements (MEE) and Cartesian coordinates (CC). Use of two sets of MEE, relative to either Earth or Moon, allows simple writing of the boundary conditions about the two celestial bodies, but requires the formulation of a multiple-arc trajectory optimization problem, including two legs: (a) geocentric leg and (b) selenocentric leg. In the numerical solution process, the transition between the two MEE representations uses CC, which play the role of convenient intermediate, matching variables. The multiple-arc formulation at hand leads to identifying a set of intermediate necessary conditions for optimality, at the transition between the two legs. This research proves that a closed-form solution to these intermediate conditions exists, leveraging implicit costate transformation. As a result, the parameter set for an indirect algorithm retains the reduced size of the typical set associated with a single-arc optimization problem. The indirect heuristic technique, based on the joint use of the necessary conditions and a heuristic algorithm (i.e., differential evolution in this study) is proposed as the numerical solution method, together with the definition of a layered fitness function, aimed at facilitating convergence. The minimum-time trajectory of interest is sought in a high-fidelity dynamical framework, with the use of planetary ephemeris and the inclusion of the simultaneous gravitational action of Sun, Earth, and Moon, along the entire transfer path. The numerical results unequivocally prove that the approach developed in this research is effective for determining minimum-time low-thrust Earth–Moon orbit transfers.

Trajectory Planning for UAV-Assisted Data Collection in IoT Network: A Double Deep Q Network Approach

Unmanned aerial vehicles (UAVs) are becoming increasingly valuable as a new type of mobile communication device and autonomous decision-making device in many application areas, including the Internet of Things (IoT). UAVs have advantages over other stationary devices in terms of high flexibility. However, a UAV, as a mobile device, still faces some challenges in optimizing its trajectory for data collection. Firstly, the high complexity of the movement action and state space of the UAV’s 3D trajectory is not negligible. Secondly, in unknown urban environments, a UAV must avoid obstacles accurately in order to ensure a safe flight. Furthermore, without a priori wireless channel characterization and ground device locations, a UAV must reliably and safely complete the data collection from the ground devices under the threat of unknown interference. All of these require the proposing of intelligent and automatic onboard trajectory optimization techniques. This paper transforms the trajectory optimization problem into a Markov decision process (MDP), and deep reinforcement learning (DRL) is applied to the data collection scenario. Specifically, the double deep Q-network (DDQN) algorithm is designed to address intelligent UAV trajectory planning that enables energy-efficient and safe data collection. Compared with the traditional algorithm, the DDQN algorithm is much better than the traditional Q-Learning algorithm, and the training time of the network is shorter than that of the deep Q-network (DQN) algorithm.

A powered descent trajectory planning method with quantitative consideration of safe distance to obstacle

High scientific value areas on celestial bodies such as the Moon and Mars are often located in hazardous terrains. To achieve safe landing exploration, a novel planning method is proposed, which can ensure that the planned trajectory maintains a user-specified distance from obstacles, thus reducing potential collision risk induced by factors such as the body size and model uncertainties. Firstly, the basic model of the trajectory optimization problem and its convexification version is given. The obstacles are modeled as polynomial functions, based on which the “if-then” obstacle avoidance logic explicitly considering the safe distance, is described as a sum of squares constraint. This constraint formulation applies to any obstacle described by a finite number of polynomials, independent of the specific expression of the polynomials (reflecting the shape of the obstacle). Subsequently, the convexification process for the obstacle avoidance constraint is given. Finally, the sequential sum of squares programming problem for the obstacle avoidance trajectory is established, which boils down to a series of semidefinite programming problems. Simulation results show that the closest distance between the planned trajectory and obstacles strictly satisfies the specified distance constraint, and the trajectory could avoid non-convex obstacles. With the promising convergence properties of underlying convex optimization algorithms, advanced autonomous obstacle avoidance guidance schemes are expected to be formed based on the proposed trajectory planning method.

An improved multi-operator differential evolution with two-phase migration strategy for numerical optimization

Over the last decade, the multi-operator differential evolution (MODE) has become one of the most popular research areas in the differential evolution (DE) family. Among these MODEs, an improved multi-operator differential evolution (IMODE) has achieved success as the winner in CEC2020. Despite its good performance, the random information sharing strategy may not efficiently handle the balance between exploration and exploitation for the complex numerical optimization. To address this limitation, we propose a two-phase migration strategy (TMS) to improve the performance of IMODE, called IMODE-TMS. In the first phase, the top-ranked individuals in each sub-population are retained for exploitation, and all the bottom-ranked individuals are assigned to three sub-populations to maintain diversity. Furthermore, the second phase plays a crucial role in eliminating stagnation. When a sub-population is identified as stagnant by the stagnation indicator, the optimal individual will migrate to that sub-population following the uni-directional ring structure. This process is mainly used to increase the off-trap capability on some problems with complex fitness landscapes. IMODE-TMS is tested on the CEC2020, CEC2021 and CEC2022 benchmark functions, and seven well-known complex global trajectory optimization problems (GTOP). The experimental results show that IMODE-TMS significantly outperforms not only IMODE but also other state-of-the-art comparison algorithms.

Delanalty Minimization With Reinforcement Learning in UAV-Aided Mobile Network

Unmanned aerial vehicle (UAV)-assisted mobile communication has been studied in recent years. UAVs can be used as aerial base stations (BSs) to improve the performance of terrestrial mobile network. In this article, mobile data offloading with UAV trajectory optimization is investigated. To tackle with the delay of requesting data and the immediacy of requested data at the same time, a new metric named delanalty is newly proposed. The delanalty metric jointly considers the delay of user requesting data, the immediacy of requested data file, and the quantity of residual requesting data. A find max delanalty user mechanism is proposed to eliminate the user who has the largest delay time. Furthermore, an actor–critic (AC)-based deep reinforcement learning (DRL) algorithm called AC -based delanalty trajectory optimization (ACDTO) algorithm is proposed to solve UAV’s trajectory optimization problem. Simulation results show that the proposed ACDTO algorithm can find an optimal flight trajectory with minimal delanalty for all users.

Reduced Desensitization Formulation for Optimal Control Problems

Solutions to nonlinear optimal control problems (OCPs) exhibit dispersions under model uncertainties and it is desirable to generate optimal solutions that exhibit less sensitivity to model uncertainties. We propose a novel solution desensitization method dubbed “Reduced Desensitization Formulation (RDF)” by leveraging non-uniqueness of the solution of the costate differential equations when a hybrid indirect-direct optimization method is used. A key property of the RDF method is a significant reduction in the number of differential equations needed for generating desensitized solutions. This feature facilitates the generation of open-loop desensitized trajectories and makes the methodology applicable to OCPs with a larger number of uncertain parameters. To demonstrate the utility of the RDF method, three important classes of trajectory optimization problems are considered with uncertainty in the thrust magnitude of the propulsion system: (1) minimum-fuel low-thrust interplanetary rendezvous maneuvers, (2) low-thrust orbit-raising maneuvers, and (3) minimum-fuel high-thrust rocket-landing problems. For the considered problems with bang-bang control profiles, an analysis is presented on the change in the number of control switches between sensitive and desensitized optimal solutions. Numerical results demonstrate desensitization of the considered performance indices with respect to the thrust magnitude of the propulsion system.

Symmetric projection optimizer: concise and efficient solving engineering problems using the fundamental wave of the Fourier series

The fitness function value is a kind of important information in the search process, which can be more targeted according to the guidance of the fitness function value. Most existing meta-heuristic algorithms only use the fitness function value as an indicator to compare the current variables as good or bad but do not use the fitness function value in the search process. To address this problem, the mathematical idea of the fitting is introduced into the meta-heuristic algorithm, and a symmetric projection optimizer (SPO) is proposed to solve numerical optimization and engineering problems more efficiently. The SPO algorithm mainly utilizes a new search mechanism, the symmetric projection search (SP) method. The SP method quickly completes the fitting of the projection plane, which is located through the symmetry of the two points and finds the minima in the projection plane according to the fitting result. Fitting by using the fitness function values allows the SP to find regions where extreme values may exist more quickly. Based on the SP method, exploration and exploitation strategies are constructed, respectively. The exploration strategy is used to find better regions, and the exploitation strategy is used to optimize the discovered regions continuously. The timing of the use of the two strategies is designed so that the SPO algorithm can converge faster while avoiding falling into local optima. The effectiveness of the SPO algorithm is extensively evaluated using seven test suites, including CEC2017, CEC2019, CEC2020, and CEC2022. It is also compared with two sets of 19 recent competitive algorithms. Statistical analyses are performed using five metrics such as the Wilcoxon test, the Friedman test, and variance. Finally, the practicality of the SPO algorithm is verified by four typical engineering problems and a real spacecraft trajectory optimization problem. The results show that the SPO algorithm can find superior results in 94.6% of the comparison tests and is a promising alternative for solving real-world problems.

New Adaptive Mesh Refinement Strategy for Entry Guidance via Sequential Convex Programming

This study focuses on the entry guidance problem, which is a highly nonlinear and constrained optimal control problem. The entry guidance problem is formulated as a nonlinear trajectory optimization problem with six-degrees-of-freedom dynamics, path constraints, and boundary constraints. The formulated problem is discretized and solved using sequential convex programming (SCP) with successive linearization. However, during the discretization process, conventional collocation methods encounter a challenge with high-frequency jittering in the control and bank angle profiles near active path constraints. Because the considered problem especially involves tight path constraints, the solution jittering issue becomes severe. Therefore, this study proposes a novel mesh refinement strategy to address this problem. Unlike conventional mesh refinement strategies based on interpolation error, the proposed approach resolves the convergence and solution jittering issue of the SCP framework by linking the direct and indirect methods with the costate estimation under successive linearization. Along with the development, we introduce a novel costate estimation method and provide proof of its validity. We present numerical simulation results of the proposed method and conduct a comparison with conventional approaches. The results obtained demonstrate successful mitigation of the solution jittering issue and a significant improvement in solution accuracy regarding compliance with the necessary conditions of optimality.

Optimization Algorithm for AoI-Based UAV-Assisted Data Collection

Regarding the issue of information freshness in systems that aid in data collection using unmanned aerial vehicles (UAVs), a data collection algorithm that is based on freshness and UAV assistance is proposed. Under the limitations of wireless sensor node communication distance and UAV parameters, the optimization problem of minimizing the average spatial correlation age of information (SCAoI) of all nodes in the area is set up. This problem is solved by optimizing the number of clusters, UAV flight trajectories, and the order of data collection from cluster member nodes. The maximum communication distance of the nodes is used as the cluster formation radius, and the maximum-minimum distance clustering algorithm is used to cluster the nodes in the region to obtain the minimum number of clusters. After it has been proven that the trajectory optimization problem in this study is NP-hard, the ant colony algorithm is applied to obtain the minimum flight time and the corresponding trajectory. By using the greedy algorithm to determine the member nodes in the sequence of data collection for a cluster, the instantaneous SCAoI of the UAV arriving at the cluster head is solved. Simulation results show that the proposed algorithm in this paper can effectively improve the freshness of data and reduce the average SCAoI of the system compared with the algorithm in the comparative literature, reducing the average SCAoI by about 61%.

Optimization of multi-target continuous dynamic trajectory for unmanned aerial vehicles

In the problem of trajectory optimization for unmanned aerial vehicles (UAVs) passing through multiple target points, continuous velocity and acceleration in the process of optimization are essential for maintaining a feasible trajectory. This paper proposes a multi-segment holistic Bezier shaping method (MHBSM) for dynamic trajectory optimization. The MHBSM not only achieves holistic optimization of UAVs passing through a multi-target trajectory but also ensures high-order continuity at the junctions of trajectory segments. Unlike methods that generate non-dynamic trajectories by connecting arcs and straight lines (such as Dubins curves) without considering speed changes, MHBSM optimizes the trajectory while taking into account the dynamics of UAVs. The method optimizes the differential flat output space of a fixed-wing UAV dynamic model and transforms the dynamic optimization problem into a three-dimensional position optimization problem. The problem is then further transformed into an optimization of control points using the Bezier curve. The resulting trajectory satisfies the dynamic constraints. In comparison to the Gaussian pseudospectral method (GPM), MHBSM achieves similar optimization results with only a 2.58% difference, while requiring approximately 1.36% of the computational time on average. The MHBSM demonstrates excellent convergence performance while satisfying the constraints of continuous acceleration and obstacle avoidance.

Lambert Property-Based Swarm Search Algorithm for the Multiple-Rendezvous Trajectory Optimization

In this paper, the multiple-rendezvous trajectory optimization problem is studied, which refers to optimizing rendezvous epochs for a single spacecraft to service multiple targets. It is found that the problem has multiple properties, such as a predictable trough number in each dimension. A novel Lambert property-based swarm search algorithm (LPSSA) that incorporates this problem-specific knowledge is proposed to improve efficiency. The design aims to improve the global search capability in the prophase and the local search capability in the anaphase. The algorithm has two different branches and is switched by a proposed complexity index. When the index is relatively large, the initial variables are distributed in some priority trough regions, and the update mechanism is divided into three stages. When the index is relatively small, the initial variables are first distributed to all trough regions and then selected. Multiple subpopulations search independently in the iterative process, and an annexation mechanism is introduced. An improved method for handling boundary conditions is applied in both branches. Besides, the improved mechanisms can also be combined with other swarm search algorithms. Numerical simulations show that the proposed method has a more stable convergence performance and a more optimal solution than the conventional algorithms.

Controllable cone for horizontal landing on asteroids using a flexible probe

The recently proposed flexible probe for asteroids provides a novel scheme for landing on low-gravity surface. To understand the feasible initial condition of the flexible probe's horizontal landing trajectory under multiple constraints, a controllable cone is defined and investigated. The boundary of the controllable cone is calculated using a double-layer optimization method. In the inner-layer, the switching time of the thrust profile is fixed, and the boundary point is solved through a multi-constraint trajectory optimization problem that considers the influence caused by the flexible deformation. In the outer-layer, the switching time of the thrust profile is optimized to maximize the cone boundary. To improve the optimization efficiency, an adaptive interval is used to search the switching time. With the double-layer optimization method, the controllable cone boundaries can be generated for both a specific height and a three-dimensional space. The controllable cone of the flexible probe is simulated for the landing on asteroid 433 Eros, and the influence of the flexible deformation is also analyzed.

A Hierarchical Multi-Vehicle Coordinated Motion Planning Method Based on Interactive Spatio-Temporal Corridors

Multi-vehicle coordinated motion planning has always been challenged to safely and efficiently resolve conflicts under non-holonomic dynamic constraints. Constructing spatial-temporal corridors for multi-vehicle can decouple the high-dimensional conflicts and further reduce the difficulty of obtaining feasible trajectories. Therefore, this paper proposes a novel hierarchical multi-vehicle coordinated motion planning method based on interactive spatio-temporal corridors (ISTCs). In the first layer, based on the initial guidance trajectories, Mixed Integer Quadratic Programming is designed to construct ISTCs capable of resolving conflicts in generic multi-vehicle scenarios. And then in the second layer, Non-Linear Programming is settled to generate in-corridor trajectories that satisfy the vehicle dynamics. By introducing ISTCs, the multi-vehicle coordinated motion planning problem is able to be decoupled into single-vehicle trajectory optimization problems, which greatly decentralizes the computational pressure and has great potential for real-world applications. Besides, the proposed method searches for feasible solutions in the 3-D <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$(x,y,t)$</tex-math></inline-formula> configuration space, preserving more possibilities than the traditional velocity-path decoupling method. Simulated experiments in unsignalized intersection and challenging dense scenarios have been conducted to verify the feasibility and adaptability of the proposed framework.

Optimal Pose Design for Close-Proximity On-Orbit Inspection

Close-proximity on-orbit inspection is a critical ability to initiate on-orbit servicing operations, required technology for space exploration missions. It is challenging to solve an optimal inspection trajectory planning problem that provides a complete target observation due to major difficulties. First, the inspection requirements must be defined and imposed on the problem as a set of path constraints that result in a nondeterministic-polynomial-time-hard problem. Second, the optimization problem, including highly nonconvex constraints, is very difficult to solve directly using an optimal control solver. Additionally, it requires proper initialization of states and control variables, which is critical in such problems. To overcome these difficulties, this paper proposes a novel formulation and method of solution for a full six-degrees-of-freedom optimal inspection motion planning problem. Optimal inspection trajectories are designed for a rigid-body spacecraft, which performs close, continuous, and complete observation of rigid, nonrotating, and nonaccelerating known targets. The inspection and collision avoidance constraints are defined in explicit forms that rectify the nondifferentiability of the problem and satisfy the inspection requirements. A pseudospectral optimal control solver is implemented to numerically solve the trajectory optimization problem. The proposed methodology is applicable to any robotic inspection mission. Simulations are presented as a validation of the proposed methodology and the achieved optimality.

Hybrid-order soft trust region-based sequential convex programming for reentry trajectory optimization

Due to the complex aerodynamic effects, the reentry trajectory optimization problem is highly nonlinear. When using sequential convex programming (SCP) methods to solve it, the iteration solution is difficult to converge. To improve this, we propose a hybrid-order soft trust region-based SCP method. We analyze the penalty effect of typical trust regions. Based on the analysis, we develop a hybrid-order soft trust region combining a small-weight first-order component and a higher-order components. To solve the subproblem reliably and effectively, we equivalently reformulate it as a second-order cone programming (SOCP) form through the relaxation technique. Combined with the line search method, we further design an SCP algorithm with guaranteed convergence under some assumptions. In the numerical simulations, the effectiveness and robustness of the proposed method have been verified using a nominal case and 200 Monte Carlo cases.