Efficient Path Finding for Emergency Vehicles: A Comparative Exploration of Sparrow, Monkey and Frog Search Algorithms

Efficient path finding for emergency vehicles is essential for saving lives by taking the optimal path from source to destination point that takes less time and covered less area by avoid traffic and any obstacles. There has been a lot of research is completed for finding optimal routes for emergency vehicles using different algorithms like Dijkstra, A* and genetic algorithms. In this research work has been done by using three bio-inspired algorithms such as Sparrow, Monkey and Frog search Algorithms for finding optimal ambulance routes. The objective not only to find the optimal routes but also presents a performance comparison graph of these path planning algorithms, where it finds the most efficient algorithms in terms of path length and time-taken efficiency of these three algorithm and shows the strengths and weakness of each methods in the ambulance routing and any emergency system.