Multiple UAVs path planning algorithms: a comparative study

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.

[1]  W. W. Bledsoe,et al.  Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub. , 1971, SGAR.

[2]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[3]  Liping Fu.  REAL-TIME VEHICLE ROUTING AND SCHEDULING IN DYNAMIC AND STOCHASTIC TRAFFIC NETWORKS , 1996 .

[4]  F. Benjamin Zhan,et al.  Shortest Path Algorithms: An Evaluation Using Real Road Networks , 1998, Transp. Sci..

[5]  Mario Gerla,et al.  Internet QoS Routing Using the Bellman-Ford Algorithm , 1998, HPN.

[6]  Huan He,et al.  Global optimal path planning for mobile robot based on improved Dijkstra algorithm and ant system algorithm , 2006 .

[7]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[8]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[9]  T Van Vuren,et al.  RECENT DEVELOPMENTS IN PATH FINDING ALGORITHMS: A REVIEW , 1988 .

[10]  Madhav V. Marathe,et al.  A computational study of routing algorithms for realistic transportation networks , 1999, JEAL.

[11]  A. Finn,et al.  Design Challenges for an Autonomous Cooperative of UAVs , 2007, 2007 Information, Decision and Control.

[12]  Ismail Chabini,et al.  Design and Implementation of Parallel Dynamic Shortest Path Algorithms for Intelligent Transportation Systems Applications , 2001 .

[13]  Allen Newell,et al.  Human Problem Solving. , 1973 .

[14]  George G. Lendaris,et al.  Adaptive dynamic programming , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[15]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[16]  R. Chellappa Doss,et al.  Route maintenance using mobility prediction for mobile ad hoc networks , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

[17]  Ming S. Hung,et al.  A computational study of efficient shortest path algorithms , 1988, Comput. Oper. Res..

[18]  Z. Cvetanovic,et al.  Parallel Astar search on message-passing architectures , 1990, Twenty-Third Annual Hawaii International Conference on System Sciences.

[19]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[20]  M. Florian.  Transportation planning models , 1984 .