scholarly journals Multiaircraft Optimal 4D Trajectory Planning Using Logical Constraints

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
Dinesh B. Seenivasan ◽  
Alberto Olivares ◽  
Ernesto Staffetti
Keyword(s):  
Optimal Control ◽  
Optimal Control Problem ◽  
Control Problem ◽  
Obstacle Avoidance ◽  
Trajectory Planning ◽  
Model Complexity ◽  
Mixed Integer ◽  
Planning Problem ◽  
Integer Variables ◽  
Logical Constraints

This paper studies the trajectory planning problem for multiple aircraft with logical constraints in disjunctive form which arise in modeling passage through waypoints, distance-based and time-based separation constraints, decision-making processes, conflict resolution policies, no-fly zones, or obstacle or storm avoidance. Enforcing separation between aircraft, passage through waypoints, and obstacle avoidance is especially demanding in terms of modeling efforts. Indeed, in general, separation constraints require the introduction of auxiliary integer variables in the model; for passage constraints, a multiphase optimal control approach is used, and for obstacle avoidance constraints, geometric approximations of the obstacles are introduced. Multiple phases increase model complexity, and the presence of integer variables in the model has the drawback of combinatorial complexity of the corresponding mixed-integer optimal control problem. In this paper, an embedding approach is employed to transform logical constraints in disjunctive form into inequality and equality constraints which involve only continuous auxiliary variables. In this way, the optimal control problem with logical constraints is converted into a smooth optimal control problem which is solved using traditional techniques, thereby reducing the computational complexity of finding the solution. The effectiveness of the approach is demonstrated through several numerical experiments by computing the optimal trajectories of multiple aircraft in converging and intersecting arrival routes with time-based separation constraints, distance-based separation constraints, and operational constraints.

Trajectory planning with mid-air collision avoidance for quadrotor unmanned aerial vehicles

2021 ◽  
pp. 095441002110440
Author(s):  
Yuhang Jiang ◽  
Shiqiang Hu ◽  
Christopher J Damaren
Keyword(s):  
Optimal Control ◽  
Optimal Control Problem ◽  
Control Problem ◽  
Unmanned Aerial Vehicles ◽  
Collision Avoidance ◽  
Trajectory Planning ◽  
Pseudospectral Method ◽  
Planning Problem ◽  
Aerial Vehicles ◽  
Optimal Control Algorithms

Flight collision between unmanned aerial vehicles (UAVs) in mid-air poses a potential risk to flight safety in low-altitude airspace. This article transforms the problem of collision avoidance between quadrotor UAVs into a trajectory-planning problem using optimal control algorithms, therefore achieving both robustness and efficiency. Specifically, the pseudospectral method is introduced to solve the raised optimal control problem, while the generated optimal trajectory is precisely followed by a feedback controller. It is worth noting that the contributions of this article also include the introduction of the normalized relative coordinate, so that UAVs can obtain collision-free trajectories more conveniently in real time. The collision-free trajectories for a classical scenario of collision avoidance between two UAVs are given in the simulation part by both solving the optimal control problem and querying the prior results. The scalability of the proposed method is also verified in the simulation part by solving a collision avoidance problem among multiple UAVs.

scholarly journals A Trajectory Planning Method for Autonomous Valet Parking via Solving an Optimal Control Problem

Sensors ◽  
2020 ◽  
Vol 20 (22) ◽  
pp. 6435
Author(s):  
Chen Chen ◽  
Bing Wu ◽  
Liang Xuan ◽  
Jian Chen ◽  
Tianxiang Wang ◽  
...  
Keyword(s):  
Optimal Control ◽  
Optimal Control Problem ◽  
Control Problem ◽  
Trajectory Planning ◽  
Pseudospectral Method ◽  
Initial Guess ◽  
Planning Method ◽  
Planning Problem ◽  
Starting Position ◽  
Dynamic Obstacle Avoidance

In the last decade, research studies on parking planning mainly focused on path planning rather than trajectory planning. The results of trajectory planning are more instructive for a practical parking process. Therefore, this paper proposes a trajectory planning method in which the optimal autonomous valet parking (AVP) trajectory is obtained by solving an optimal control problem. Additionally, a vehicle kinematics model is established with the consideration of dynamic obstacle avoidance and terminal constraints. Then the parking trajectory planning problem is modeled as an optimal control problem, while the parking time and driving distance are set as the cost function. The homotopic method is used for the expansion of obstacle boundaries, and the Gauss pseudospectral method (GPM) is utilized to discretize this optimal control problem into a nonlinear programming (NLP) problem. In order to solve this NLP problem, sequential quadratic programming is applied. Considering that the GPM is insensitive to the initial guess, an online calculation method of vertical parking trajectory is proposed. In this approach, the offline vertical parking trajectory, which is calculated and stored in advance, is taken as the initial guess of the online calculation. The selection of an appropriate initial guess is based on the actual starting position of parking. A small parking lot is selected as the verification scenario of the AVP. In the validation of the algorithm, the parking trajectory planning is divided into two phases, which are simulated and analyzed. Simulation results show that the proposed algorithm is efficient in solving a parking trajectory planning problem. The online calculation time of the vertical parking trajectory is less than 2 s, which meets the real-time requirement.

scholarly journals Energy-Optimal Trajectory Planning for Planar UnderactuatedRRRobot Manipulators in the Absence of Gravity

2013 ◽  
Vol 2013 ◽  
pp. 1-16 ◽  
Author(s):  
John Gregory ◽  
Alberto Olivares ◽  
Ernesto Staffetti
Keyword(s):  
Optimal Control ◽  
Optimal Control Problem ◽  
Control Problem ◽  
Calculus Of Variations ◽  
Trajectory Planning ◽  
Integral Form ◽  
Necessary Condition ◽  
Planning Problem ◽  
Control Input ◽  
Revolute Joints

In this paper, we study the trajectory planning problem for planar underactuated robot manipulators with two revolute joints in the absence of gravity. This problem is studied as an optimal control problem in which, given the dynamic model of a planar horizontal robot manipulator with two revolute joints one of which is not actuated, the initial state, and some specifications about the final state of the system, we find the available control input and the resulting trajectory that minimize the energy consumption during the motion. Our method consists in a numerical resolution of a reformulation of the optimal control problem as an unconstrained calculus of variations problem in which the dynamic equations of the mechanical system are regarded as constraints and treated using special derivative multipliers. We solve the resulting calculus of variations problem using a numerical approach based on the Euler-Lagrange necessary condition in integral form in which time is discretized and admissible variations for each variable are approximated using a linear combination of piecewise continuous basis functions of time. The use of the Euler-Lagrange necessary condition in integral form avoids the need for numerical corner conditions and the necessity of patching together solutions between corners.

Trajectory Planning of Quadrotor Systems for Various Objective Functions

Robotica ◽  
2020 ◽  
Vol 39 (1) ◽  
pp. 137-152
Author(s):  
Hamidreza Heidari ◽  
Martin Saska
Keyword(s):  
Optimal Control ◽  
Path Planning ◽  
Optimal Control Problem ◽  
Control Problem ◽  
Trajectory Planning ◽  
Minimum Principle ◽  
Optimal Path ◽  
Necessary Condition ◽  
Objective Functions ◽  
Wide Range

SUMMARYQuadrotors are unmanned aerial vehicles with many potential applications ranging from mapping to supporting rescue operations. A key feature required for the use of these vehicles under complex conditions is a technique to analytically solve the problem of trajectory planning. Hence, this paper presents a heuristic approach for optimal path planning that the optimization strategy is based on the indirect solution of the open-loop optimal control problem. Firstly, an adequate dynamic system modeling is considered with respect to a configuration of a commercial quadrotor helicopter. The model predicts the effect of the thrust and torques induced by the four propellers on the quadrotor motion. Quadcopter dynamics is described by differential equations that have been derived by using the Newton–Euler method. Then, a path planning algorithm is developed to find the optimal trajectories that meet various objective functions, such as fuel efficiency, and guarantee the flight stability and high-speed operation. Typically, the necessary condition of optimality for a constrained optimal control problem is formulated as a standard form of a two-point boundary-value problem using Pontryagin’s minimum principle. One advantage of the proposed method can solve a wide range of optimal maneuvers for arbitrary initial and final states relevant to every considered cost function. In order to verify the effectiveness of the presented algorithm, several simulation and experiment studies are carried out for finding the optimal path between two points with different objective functions by using MATLAB software. The results clearly show the effect of the proposed approach on the quadrotor systems.

Unmanned aerial vehicle trajectory planning by an integrated algorithm in a complex obstacle environment

2016 ◽  
Vol 231 (11) ◽  
pp. 2048-2067
Author(s):  
Siyu Zhang ◽  
Jianqiao Yu ◽  
Yuesong Mei ◽  
Huadong Sun ◽  
Yongbo Du
Keyword(s):  
Optimal Control ◽  
Optimal Control Problem ◽  
Control Problem ◽  
Trajectory Planning ◽  
Potential Field ◽  
Direct Method ◽  
Field Method ◽  
Artificial Potential Field ◽  
Potential Field Method ◽  
Artificial Potential Field Method

Both the artificial potential field method and direct method for the optimal control problem have shortcomings in terms of effectiveness and computational complexity for the trajectory-planning problem. This paper proposes an integrated algorithm combining the artificial potential field method and direct method for planning in a complex obstacle-rich environment. More realistic unmanned aerial vehicle dynamics equations, which are rarely applied in the traditional artificial potential field method, are considered in this paper. Furthermore, an additional control force is introduced to transcribe the artificial potential field model into an optimal control problem, and the equality/inequality constraints on the description of the shape of the obstacles are substituted by the repulsive force originating from all the obstacles. The Legendre pseudospectral method and virtual motion camouflage are both utilized to solve the modified optimal control problem for comparison purposes. The algorithm presented in this paper improves the performance of solving the trajectory-planning problem in an obstacle-rich environment. In particular, the algorithm is suitable for addressing some conditions that cannot be considered by the traditional artificial potential field method or direct method individually, such as local extreme value points and a large numbers of constraints. Two simulation examples, a single cube-shaped obstacle and a different-shaped obstacle-rich environment, are solved to demonstrate the capabilities and performance of the proposed algorithm.

An efficient stochastic approach for robust time-optimal trajectory planning of robotic manipulators under limited actuation

Robotica ◽  
2017 ◽  
Vol 35 (12) ◽  
pp. 2400-2417 ◽  
Author(s):  
Ming-Yong Zhao ◽  
Xiao-Shan Gao ◽  
Qiang Zhang
Keyword(s):  
Optimal Control ◽  
Optimal Control Problem ◽  
Control Problem ◽  
Trajectory Planning ◽  
Optimal Trajectory ◽  
Original Problem ◽  
Robotic Manipulators ◽  
Linear Optimal Control ◽  
Time Optimal ◽  
Optimal Trajectory Planning

SUMMARYThis paper focuses on the problem of robust time-optimal trajectory planning of robotic manipulators to track a given path under a probabilistic limited actuation, that is, the probability for the actuation to be limited is no less than a given bound κ. We give a general and practical method to reduce the probabilistic constraints to a set of deterministic constraints and show that the deterministic constraints are equivalent to a set of linear constraints under certain conditions. As a result, the original problem is reduced to a linear optimal control problem which can be solved with linear programming in polynomial time. In the case of κ = 1, the original problem is proved to be equivalent to the linear optimal control problem. Overall, a very general, practical, and efficient algorithm is given to solve the above problem and numerical simulation results are used to show the effectiveness of the method.

Sign in / Sign up

Export Citation Format

Share Document