Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
A computational study of efficient shortest path algorithms
Computers and Operations Research
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
A computational study of routing algorithms for realistic transportation networks
Journal of Experimental Algorithmics (JEA)
Internet QoS Routing Using the Bellman-Ford Algorithm
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
Human Problem Solving
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Path Planning for UAVs Under Communication Constraints Using SPLAT! and MILP
Journal of Intelligent and Robotic Systems
Application of optimization algorithms to trajectory planning for underwater gliders
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part II
Using genetic algorithms for navigation planning in dynamic environments
Applied Computational Intelligence and Soft Computing
Hi-index | 0.00 |
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.