i-manager Publications

Optimal Routing for Emergency Vehicles using A*(A-Star) Algorithm

Purna Venkata Teja Chennupati *, Abdul Rasheed Shaik**, Uma Mahesh Pundla***

*-*** Vasireddy Venkatadri Institute of Technology, Namburu, Pedakakani, Guntur, Andhra Pradesh, India.

Periodicity:January - June'2025

Abstract

Quick access to medical facilities during crises is crucial for improving results and maybe saving lives. In order to help people in need by promptly locating and directing them to the closest hospitals after an accident, this paper presents a web-based application. When every second matters, the application provides essential location-based services by utilizing the Google Maps API package, enabling prompt decision-making. The Google Maps Geocoding API is used by the program to convert the user's current location—designated as the accident site—into geographic coordinates. After that, it uses the Places API to find hospitals within five kilometers, showing customers a number of options so they can make an informed decision. To find the nearest hospital and cut down on journey time, the Haversine formula is used to calculate distances. A caching method lowers latency and API call costs by storing frequently visited routes for performance improvement. The A* algorithm further improves pathfinding by taking current conditions into account to guarantee the most effective navigation in intricate urban environments.

Keywords

Emergency Routing, A*, Dynamic Pathfinding, GPS Navigation, Real-Time, Traffic-Aware.

How to Cite this Article?

Chennupati, P. V. T., Shaik, A. R., and Pundla, U. M. (2025). Optimal Routing for Emergency Vehicles using A*(A-Star) Algorithm. International Journal of Computing Algorithm, 14(1), 10-24.

References

[1]. Akkaya, K., & Younis, M. (2005). A survey on routing protocols for wireless sensor networks. Ad hoc Networks, 3(3), 325-349.

[2]. Al-Karaki, J. N., & Kamal, A. E. (2004). Routing techniques in wireless sensor networks: A survey. IEEE Wireless Communications, 11(6), 6-28.

[3]. Chen, X., Yang, F., & Wang, C. (2024). iA $^* $: Imperative Learning-based A $^* $ Search for Pathfinding. arXiv preprint arXiv:2403.15870.

[4]. Choi, S. H., & Lee, K. O. (2011). A cluster based energy efficient location routing protocol in wireless sensor networks. International Journal of Computer and Communication, 2(5), 67-74.

[5]. Dechter, R., & Pearl, J. (1985). Generalized best-first search strategies and the optimality of A. Journal of the ACM (JACM), 32(3), 505-536.

[6]. Dijkstra, E. W. (1996). Edsger W. Dijkstra. Great Papers in Computer Science.

[7]. Duchon, F., Hunady, D., Dekan, M., & Babinec, A. (2013). Optimal navigation for mobile robot in known environment. Applied Mechanics and Materials, 282, 33- 38.

[8]. Ferguson, D., & Stentz, A. (2007). Field D*: An interpolation-based path planner and replanner. In Robotics Research: Results of the 12th International Symposium ISRR (pp. 239-253). Springer Berlin Heidelberg.

[9]. Foead, D., Ghifari, A., Kusuma, M. B., Hanafiah, N., & Gunawan, E. (2021). A systematic literature review of A* pathfinding. Procedia Computer Science, 179, 507-514.

[10]. Gautam, A., & Prakash, A. (2024). Comparative evaluation of pathfinding algorithms in real-time intelligent t ransportation systems. Journal of Transportation Engineering, 150(3), 04023065.

[11]. GeeksforGeeks. (2024). A* Search Algorithm in Python.

[12]. Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100-107.

[13]. Heinzelman, W. R., Chandrakasan, A., & Balakrishnan, H. (2000). Energy-efficient communication protocol for wireless microsensor networks. In Proceedings of the 33rd Annual Hawaii International Conference on System Sciences (pp. 10-pp). IEEE.

[14]. Jing, X., & Yang, X. (2018). Application and improvement of heuristic function in a* algorithm. In 2018 37th Chinese Control Conference (CCC) (pp. 2191-2194). IEEE.

[15]. Kochenderfer, M. J., & Wheeler, T. A. (2019). Algorithms for Optimization. MIT Press.

[16]. Korf, L. A. (2006). Approximating infinite horizon stochastic optimal control in discrete time with constraints. Annals of Operations Research, 142(1), 165- 186.

[17]. Kumar, S., Tiwari, P., & Zymbler, M. (2019). Internet of Things is a revolutionary approach for future technology enhancement: A review. Journal of Big data, 6(1), 1-21.

[18]. Kumar, V., & Sharma, R. (2021). A hybrid evolutionary algorithm for real-time route optimization in emergency vehicle navigation. IEEE Access, 9, 77463–77475.

[19]. Lindsey, S., & Raghavendra, C. S. (2002). PEGASIS: Power-efficient gathering in sensor information systems. In Proceedings, IEEE Aerospace Conference, 3, 3-3. IEEE.

[20]. Nakas, C., Kandris, D., & Visvardis, G. (2020). Energy efficient routing in wireless sensor networks: A comprehensive survey. Algorithms, 13(3), 72.

[21]. Rajagopalan, R., & Varshney, P. K. (2006). Data Aggregation Techniques in Sensor Networks: A Survey. Electrical Engineering and Computer Science.

[22]. Russell, S. J., & Norvig, P. (2016). Artificial Intelligence: A Modern Approach. Pearson.

[23]. Stentz, A. (1994, May). Optimal and efficient path planning for partially- known environments. In Proceedings of the 1994 IEEE International Conference on Robotics and Automation (pp. 3310-3317). IEEE.

[24]. Wang, C., Wang, L., Qin, J., Wu, Z., Duan, L., Li, Z., & Wang, Q. (2015, August). Path planning of automated guided vehicles based on improved A-Star algorithm. In 2015 IEEE International Conference on Information and Automation (pp. 2071-2076). IEEE.

[25]. Wikipedia. (2025). A* Search Algorithm.

[26]. Xu, Y. (2024). The comparison of advanced algorithms for pathfinding robots. In AIP Conference Proceedings, 3194 (1), 020012. AIP Publishing.

[27]. Zheng, J., & Jamalipour, A. (2009). Wireless Sensor Networks: A Networking Perspective. John Wiley & Sons.

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Pdf	35	35	200
Online	15	15	200
Pdf & Online	35	35	400

Optimal Routing for Emergency Vehicles using A*(A-Star) Algorithm

Abstract

Keywords

How to Cite this Article?

References

If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Options for accessing this content: