A New Method of Solving UAV Trajectory Planning under Obstacles and Multi-Constraint

14Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Multi-constraint trajectory planning for unmanned aerial vehicles (UAVs) has been widely used in military and civil fields. The existing path planning methods, such as swarm intelligence algorithm and graph-based algorithm, cannot incorporate the flying time and UAV kinematic model into evolution. To overcome such disadvantage, a method of solving trajectory planning under obstacles and multi-constraint is investigated in this paper. Firstly, the flying time is discretized as a certain number of Chebyshev points which are the optimized moments of control variable, and they can reduce the computational burden. The process of solution is divided into multi-phase, i.e., two points as a phase to generate the trajectory. Then, angular velocity is taken as control variable, and function of angular velocity is solved by cubic spline interpolation. Besides, functions of angle and position are obtained by integration. The results are substituted into the model consisted by particle swarm optimization (PSO) and the UAV kinematic model to optimize. On this basis, the angular velocity, angle and position are calculated according to the allocated moments. Finally, Monte-Carlo simulation and comparison with existed method are carried out in obstacle environment. All the results illustrate that the multi-phase method can calculate the kinematic parameters of UAV accurately and plan smooth trajectories. Meanwhile, the proposed method is easier to meet the complicated constraints than the single-phase method. In addition, the dimensionality of solution is also enriched effectively.

Cite

CITATION STYLE

APA

Shao, S., Shi, W., Zhao, Y., & Du, Y. (2021). A New Method of Solving UAV Trajectory Planning under Obstacles and Multi-Constraint. IEEE Access, 9, 161161–161180. https://doi.org/10.1109/ACCESS.2021.3132650

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free