z-logo
open-access-imgOpen Access
Genetic Algorithm 3D Trajectory Planning Based on Digital Map Pre-processing for Tilt-rotor Aircraft
Author(s) -
Jiaxin Gao,
Qian Zhang,
Zelong Yu
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1600/1/012002
Subject(s) - genetic algorithm , trajectory , motion planning , computer science , process (computing) , trajectory optimization , rotor (electric) , tilt (camera) , cruise , preprocessor , simulation , real time computing , flight planning , terrain , computer vision , function (biology) , artificial intelligence , engineering , aerospace engineering , geography , machine learning , mechanical engineering , physics , cartography , astronomy , robot , operating system , evolutionary biology , biology
Tilt-rotor aircraft is a new type of aircraft which can take off and land vertically and cruise at high speed. It can be used to perform specific tasks by special departments such as public security or fire rescue. The terrain environment and threat of tasks are complex and changeable. In order to ensure flight safety, the flight trajectory should be planned in advance. As a global optimization algorithm simulating biological evolution process, genetic algorithm is mostly used in two-dimensional flight path planning. In this paper, the three-dimensional digital map is preprocessed according to the actual mission environment and constraints of the tiltrotor aircraft. The related genetic operators and individual evaluation function of the genetic algorithm are improved to reduce the calculation of the trajectory planning and effectively avoid the partial optimal solution. The simulation results show that after preprocessing the 3D digital map, a 3D mission trajectory with the best cost in the complex mission environment can be successfully planned by the improved genetic algorithm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here