arrow
返回

A Global Path Planning Algorithm for Fixed-wing UAVs

delete2017-11-04
delete39
PRE
AI
Y
Yaohong Qu
Y
Yintao Zhang
张
张延年 (Youmin Zhang) *
DOI:10.1007/s10846-017-0729-9delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
A new approach for solving the global optimal path planning problem to fixed-wing UAVs in multi-threat environments is proposed in this paper, which is mainly based on a natural combination of Genetic Algorithm (GA), Dijkstra searching algorithm, and Artificial Potential Field (APF) approach. First, a Delaunay partition of the flight space is introduced to map the continuous searching space on the Delaunay diagram, and the trajectory encoding methods for GA are designed based on the Delaunay network. Then, a shortest path is established by Dijkstra searching algorithm and the corresponding code is taken as the first population such that a GA could be conducted. Especially by considering flight turning constraints of fixedwing UAVs, artificial potential field approach is utilized to make the path smooth after each evolution in GA. Finally, a global optimal path is obtained through the suggested algorithm and simulation results validate the effectiveness in both Two-Dimensional (2-D) and Three-Dimensional (3-D) flight environments.
Keyword:
UAVs
Path planning
Graph theory
Artificial potential field
Genetic algorithm
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

J
JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS
IF:
2.8
论文数:
3.9K
被引数:
6.9K

机构

C
concordia university - canada
学者数:
8.0K
论文数: 8.9K
被引数: 4
N
Northwestern Polytechnical University
学者数:
4.6W
论文数: 3.7W
被引数: 5.3W
引用论文

引用论文

err分享
err收藏
学者 查看更多内容