Path planning for UAV in radar network area

Xiao Wei Fu, Zhong Liu, Xiao Guang Gao

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

5 Scopus citations

Abstract

This paper mainly introduces a path planning algorithm for the unmanned aerial vehicles (UAVs) to avoid radar network. The radar network contains several radars which have different detection ranges. In this algorithm, firstly, according to the theory of the Delaunay triangulations, a directed graph is constructed based on the locations and the detection ranges of the radars. Secondly, the Dijkstra algorithm is used to search an initial path for the UAV. Thirdly, the optimization approach is used to calculate the optimal control vector which the UAV needs when the UAV navigates to the goal position along the initial path. The simulation results showed that the paths which are planned by the algorithm not only could guide the UAV to avoid the radar network, but also satisfy some task-required constraints, which include temporal, spatial, and UAV maneuverability constraints.

Original languageEnglish
Title of host publicationProceedings - 2010 2nd WRI Global Congress on Intelligent Systems, GCIS 2010
Pages260-263
Number of pages4
DOIs
StatePublished - 2010
Event2010 2nd WRI Global Congress on Intelligent Systems, GCIS 2010 - Wuhan, China
Duration: 16 Dec 201017 Dec 2010

Publication series

NameProceedings - 2010 2nd WRI Global Congress on Intelligent Systems, GCIS 2010
Volume3

Conference

Conference2010 2nd WRI Global Congress on Intelligent Systems, GCIS 2010
Country/TerritoryChina
CityWuhan
Period16/12/1017/12/10

Keywords

  • Delaunay triangulation
  • Dijkstra algorithm
  • Optimal control
  • Path planning
  • UAV

Fingerprint

Dive into the research topics of 'Path planning for UAV in radar network area'. Together they form a unique fingerprint.

Cite this