Point-to-point near-optimal obstacle avoidance path for the unmanned aerial vehicle

Liang Hu, Zhong Wang, Chunhui Zhao

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

In this paper we study the point-to-point optimal path problem for the fixed-wing UAV in obstacle environment. We first characterize the structure of the optimal path in the presence of stationary circular obstacles and provide a proof of the NP-hardness of the optimal path problem. To simplify the planning complexity, a rapid and efficient path planning algorithm is proposed in this paper. The novel algorithm is able to generate a near-optimal path but reduce the computation cost from a complex feasible path set to only 4 paths. Numerical simulations have shown the effectiveness of the proposed algorithm.

Original languageEnglish
Title of host publicationProceedings of the 34th Chinese Control Conference, CCC 2015
EditorsQianchuan Zhao, Shirong Liu
PublisherIEEE Computer Society
Pages5413-5418
Number of pages6
ISBN (Electronic)9789881563897
DOIs
StatePublished - 11 Sep 2015
Event34th Chinese Control Conference, CCC 2015 - Hangzhou, China
Duration: 28 Jul 201530 Jul 2015

Publication series

NameChinese Control Conference, CCC
Volume2015-September
ISSN (Print)1934-1768
ISSN (Electronic)2161-2927

Conference

Conference34th Chinese Control Conference, CCC 2015
Country/TerritoryChina
CityHangzhou
Period28/07/1530/07/15

Keywords

  • avoidance path
  • NP-hardness
  • path planning
  • UAV

Fingerprint

Dive into the research topics of 'Point-to-point near-optimal obstacle avoidance path for the unmanned aerial vehicle'. Together they form a unique fingerprint.

Cite this