Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s10700-008-9035-0 | FO & DM |
Keywords | Field | DocType |
Pathfinding,AStar,Dijkstra,Distance vector algorithms | Mathematical optimization,Any-angle path planning,Search algorithm,Computer science,Algorithm,Probabilistic analysis of algorithms,Yen's algorithm,Suurballe's algorithm,A* search algorithm,K shortest path routing,Dijkstra's algorithm | Journal |
Volume | Issue | ISSN |
7 | 3 | 1568-4539 |
Citations | PageRank | References |
17 | 1.18 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. Moses Sathyaraj | 1 | 17 | 1.18 |
| L. C. Jain | 2 | 17 | 1.18 |
| A. Finn | 3 | 18 | 1.54 |
| S. Drake | 4 | 17 | 1.18 |