Hostname: page-component-76d6cb85b7-lrvh5 Total loading time: 0 Render date: 2026-07-14T00:49:48.395Z Has data issue: false hasContentIssue false

3D UAV trajectory planning using evolutionary algorithms: A comparison study

Published online by Cambridge University Press:  27 January 2016

M. Bagherian*
Affiliation:
Applied Math Department, Faculty of Mathematical Science, University of Guilan, Rasht, Iran

Abstract

This paper focuses on the three dimensional flight path planning for an unmanned aerial vehicle (UAV) on a low altitude terrain following\terrain avoidance mission. The UAV trajectory planning problem is to compute an optimal or near-optimal trajectory for a UAV to do its mission objectives in a surviving penetration through the hostile enemy environment, considering the shape of the earth and the kinematics constraints of the UAV. Using the three dimensional terrain information, three dimensional flight path from a starting point to an end point, minimising a cost function and regarding the kinematics constraints of the UAV is calculated. The geographic information of the earth shape and enemy locations is generated using digital terrain model (DTM) and geographic information system (GIS), and is displayed in a 3D environment. Using 3D-maps containing the geographic data accompanied by DTM, and GIS, the problem is modelled by deriving the motion equations of the UAV. Two heuristic algorithms are proposed for this problem: genetic and particle swarm algorithms. Genetic and particle swarm algorithms are general purposes algorithms, because they can solve a wide range of problems, so they have to be adjusted to solve the trajectory planning problem. To test and compare the paths obtained from these algorithms, a software program is built using GIS tools and the programming languages C# and MATLAB.

Information

Type
Research Article
Copyright
Copyright © Royal Aeronautical Society 2015

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable