Abstract
Finding an optimal route in a dynamic transportation network affected by disasters is a critical problem for emergency response. Although many routing algorithms have been developed, and some of them show the ability to guide first responders around the static damaged infrastructure, there are few efforts devoted to the efficient routes avoiding moving obstacles. Emergencies caused by natural or man-made disasters can result in both static and moving obstacles in a transportation network, which poses a set of serious challenges for researchers in the navigation field. In this paper, we study the shortest-path problem for one moving object to one destination in a dynamic road network populated with many moving obstacles. Existing approaches, which are developed for stationary networks, are incapable of managing complex circumstances where the status of the road network changes over time. We propose a model to represent the dynamic network and an adapted A* algorithm for shortest path computations in the context of moving obstacles. Moreover, this paper presents a web-based application for route planning. It integrates an agent-based simulation tool for both analysis of the dynamic road network and simulation of first responders’ movements, and web technologies for enabling the response community to easily and quickly share their emergency plans and to work collaboratively. We provide an experimental comparison of performance with the standard A* algorithm under different circumstances to illustrate the effectiveness of our approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
S. Schmitz, A. Zipf, P. Neis, New applications based on collaborative geodata—the case of routing, in XXVIII INCA International Congress on Collaborative Mapping and Space Technology, Gandhinagar, Gujarat, India (2008)
S. Nedkov, S. Zlatanova, Enabling obstacle avoidance for Google maps’ navigation service, in Proceedings of the 7th Geoinformation for Disaster Management, Anltalya, Turkey (2011)
F. Kunwar, F. Wong, R.B. Mrad, B. Benhabib, Guidance-based on-line robot motion planning for the interception of mobile targets in dynamic environments. J. Int. Robot. Syst. 47(4), 341–360 (2006)
H. Li, S.X. Yang, M.L. Seto, Neural-network-based path planning for a multirobot system with moving obstacles. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 39(4), 410–419 (2009)
E. Masehian, Y. Katebi, Robot motion planning in dynamic environments with moving obstacles and target. Int. J. Mech. Syst. Sci. Eng. 1(1), 20–25 (2007)
F. Darema, Dynamic data driven applications systems: new capabilities for application simulations and measurements, in Proceedings of the 5th international conference on Computational Science, Atlanta, GA, USA (2005)
X. Hu, Dynamic data driven simulation. SCS M&S Mag. 1 16–22 (2011)
P. Pecha, R. Hofman, V. Šmídl, Bayesian tracking of the toxic plume spreading in the early stage of radiation accident, in Proceeding of European Simulation and Modelling Conference, Leicester, UK (2009)
G. Lu, Z. Wu, L. Wen, C. Lin, J. Zhang, Y. Yang, Real-time flood forecast and flood alert map over the Huaihe River Basin in China using a coupled hydro-meteorological modeling system. Sci. China Ser. E: Technol. Sci. 51(7), 1049–1063 (2008)
D. Mioc, F. Anton, G. Liang, On-line street network analysis for flood evacuation planning, in Remote Sensing and GIS Technologies for Monitoring and Prediction of Disasters, ed. by S. Nayak, S. Zlatanova (Springer, Berlin, 2008), pp. 219–242
Y. Liu, M. Hatayama, N. Okada, Development of an adaptive evacuation route algorithm under flood disaster. Annuals of Disaster Prevention Research Institute, Kyoto University, vol. 49, 189–195 (2006)
S. Zlatanova, S.S.K. Baharin, Optimal navigation of first responders using DBMS, in Joint Conference of the 3rd International Conference on Information Systems for Crisis Response and Management/4th International Symposium on Geo-Information for Disaster Management (2008)
P.E. Hart, N.J. Nilsson, B. Raphael, Correction to a formal basis for the heuristic determination of minimum cost paths. SIGART Newslett. 37, 28–29 (1972)
B. Huang, Q. Wu, F.B. Zhan, A shortest path algorithm with novel heuristics for dynamic transportation networks. Int. J. Geogr. Inf. Sci. 21(6), 625–644 (2007)
G. Nannicini, D. Delling, D. Schultes, L. Liberti, Bidirectional A* search on time-dependent road networks. Networks 59(2), 240–251 (2012)
T. Ohshima, P. Eumthurapojn, L. Zhao, H. Nagamochi, An A* algorithm framework for the point-to-point time-dependent shortest path problem, in Computational Geometry, Graphs and Applications, ed. by J. Akiyama, et al. (Springer, Berlin, 2011), pp. 154–163
S. Luke, C. Cioffi-Revilla, L. Panait, K. Sullivan, Mason: a new multi-agent simulation toolkit, in Proceedings of the 2004 SwarmFest, Workshop (2004)
S. Luke, C. Cioffi-Revilla, L. Panait, K. Sullivan, G. Balan, Mason: a multiagent simulation environment. Simulation 81(7), 517–527 (2005)
Z. Wang, S. Zlatanova, Taxonomy of navigation for first responders, in Proceedings of the 9th International Symposium on Location-Based Services Munich, Germany (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wang, Z., Zlatanova, S. (2013). An A*-Based Search Approach for Navigation Among Moving Obstacles. In: Zlatanova, S., Peters, R., Dilo, A., Scholten, H. (eds) Intelligent Systems for Crisis Management. Lecture Notes in Geoinformation and Cartography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33218-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-33218-0_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33217-3
Online ISBN: 978-3-642-33218-0
eBook Packages: Earth and Environmental ScienceEarth and Environmental Science (R0)