Abstract
How to evacuate from affected area when an emergency occurs? How to escape efficiently from the affected area when the evacuees are divided into multiple groups with complete information sharing with each other? This paper studies the evacuation strategies of this problem from a convex region in the plane, and analyzes this problem in two scenarios: general plane and plane in grid network. In these two scenarios, we design evacuation strategies and analyze the evacuate ratio of strategies, respectively. In some cases, we show that the given strategies are optimal. Furthermore, we analyze the performance of strategies by comparing them in different situations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Deng, X.T., Kameda, T., Papadimitriou, C.: How to learn an unknown environment I: The rectilinear case. Journal of the ACM 45(2), 215–245 (1998)
Burgard, W., Moors, M., Fox, D., Simmons, R., Thrun, S.: Collaborative multi-robot exploration. In: Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings, vol. 1, pp. 476–481 (2000)
Fleischer, R., Kamphans, T., Klein, R., Langetepe, E., Trippen, G.: Competitive online approximation of the optimal search ratio. Siam Journal on Computing 38(3), 881–898 (2008)
Batta, R., Chiu, S.S.: Optimal Obnoxious Paths on a Network: Transportation of Hazardous Materials. Operations Research 36, 84–92 (1988)
Panaite, P., Pelc, A.: Exploring unknown undirected graphs. Journal of Algorithms 33(2), 281–295 (1999)
Papadimitriou, C.H., Yannakakis, M.: Shortest path without a map. Theoretical Computer Science 84(1), 127–150 (1991)
Chen, X., Zhan, F.B.: Agent-based simulation of evacuation strategies under different road network structures. Journal of the Operational Research Society 59, 25–33 (2008)
Hamacher, H.W., Tjandra, S.A.: Mathematical modeling of evacuation problems: A state of the art. Pedestrian and Evacuation Dynamics, 227–266 (2002)
Lu, Q., George, B., Shekhar, S.: Capacity constrained routing algorithms for evacuation planning: A summary of results. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 291–307. Springer, Heidelberg (2005)
Shekhar, S., Yang, K., Gunturi, V.M.V., Manikonda, L., et al.: Experiences with evacuation route planning algorithms. International Journal of Geographical Information Science 26(12), 2253–2265 (2012)
Berman, P.: On-line searching and navigation. In: Fiat, A. (ed.) Online Algorithms 1996. LNCS, vol. 1442, pp. 232–241. Springer, Heidelberg (1998)
Zhang, H., Xu, Y.: The k-canadian travelers problem with communication. In: Atallah, M., Li, X.-Y., Zhu, B. (eds.) FAW-AAIM 2011. LNCS, vol. 6681, pp. 17–28. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, Y., Qin, L. (2013). Strategies of Groups Evacuation from a Convex Region in the Plane. In: Fellows, M., Tan, X., Zhu, B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7924. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38756-2_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-38756-2_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38755-5
Online ISBN: 978-3-642-38756-2
eBook Packages: Computer ScienceComputer Science (R0)