Multiple UAVs path planning algorithms: A comparative study

B. Moses Sathyaraj, L. C. Jain, A. Finn, S. Drake

Research output: Contribution to journalArticlepeer-review

86 Citations (Scopus)

Abstract

Unmanned aerial vehicles (UAVs) are used in team for detecting targets and keeping them in its sensor range. There are various algorithms available for searching and monitoring targets. The complexity of the search algorithm increases if the number of nodes is increased. This paper focuses on multi UAVs path planning and Path Finding algorithms. Number of Path Finding and Search algorithms was applied to various environments, and their performance compared. The number of searches and also the computation time increases as the number of nodes increases. The various algorithms studied are Dijkstra's algorithm, Bellman Ford's algorithm, Floyd-Warshall's algorithm and the AStar algorithm. These search algorithms were compared. The results show that the AStar algorithm performed better than the other search algorithms. These path finding algorithms were compared so that a path for communication can be established and monitored.

Original languageEnglish
Pages (from-to)257-267
Number of pages11
JournalFuzzy Optimization and Decision Making
Volume7
Issue number3
DOIs
Publication statusPublished - Jun 2008
Externally publishedYes

Keywords

  • AStar
  • Dijkstra
  • Distance vector algorithms
  • Pathfinding

Fingerprint

Dive into the research topics of 'Multiple UAVs path planning algorithms: A comparative study'. Together they form a unique fingerprint.

Cite this