Fast trajectory planning based on in‐flight waypoints for unmanned aerial vehicles

Abstract

Purpose -The purpose of this paper is to propose an efficient algorithm for trajectory planning of unmanned aerial vehicles (UAVs) in 2D spaces. This paper has been motivated by the challenge to develop a fast trajectory planning algorithm for autonomous UAVs through mid-course waypoints (WPs). It is assumed that there is no prior knowledge of these WPs, and their configuration is computed as in-flight procedure. Design/methodology/approach -Since the off-line techniques cannot be applied, it is required to apply an online trajectory planning algorithm. For this reason, based on the optimal control and the geometry, each segment of trajectory is designed with respect to a local frame. The algorithm is implemented as a real-time manner in terms of the down-range variable. Findings -The proposed algorithm tries to find not only a feasible trajectory (the constraint includes the maximum heading angle rate) but also an optimal trajectory (the objective locally is to minimize the length of the path). This online trajectory planning algorithm gradually produces a smooth 2D trajectory aiming at reaching the mid-course WPs and the final target so that they are smoothly connected with each other. The mid-course WPs are described through the given down-range, cross-range, and heading angle. Originality/value -Based on geometrical principles, this algorithm is capable of re-planning the trajectory as in-flight manner, and the computational burden approaches the online capabilities for UAVs with high velocity.

TF/TA Optimal Flight Trajectory Planning Using a Novel Regenerative Flattener Mapping Method

“…The path generation incorporates the steady-state ight for straight-line paths and steady turning ight to generate circular arc trajectories. In another research, with no prior knowledge of WPs, Babaei and Mortazavi [9] o ered an online 2D trajectory-planning method. In a recent study, Lin et al proposed a fast obstacle avoidance algorithm based on the geometric approach.…”

“…Eqs. (8),(9), and (20) de ne the problem inequality constraint. The cost function expressed in Relation (10) should be modi ed in accordance with the transformed problem.…”

Online aircraft velocity and normal acceleration planning for rough terrain following

“…Assuming perfect modelling, derivation of the dynamic inversion control law is a matter of setting the commanded rates in Equations (12)- (14) equal to the associated actual rates and solving for T c , α c and ϕ c . The computed thrust, angle-of-attack and bank angle become the commanded values needed for Equations (9)- (11). Setting Equation (1) equal to Equation (12) and solving for thrust, results in:…”

Hierarchical mission planning for multiple vehicles airdrop operation

“…The optimal path is obtained by minimizing the cost subject to constrains (Kim et al, 2008;Babaei and Mortazavi, 2010). Path planning level consists of two phases: risk region and safety region.…”