Abstract
In order to realize a navigation system for refugees in disaster areas, we must reduce computation costs required in setting escape routes. Thus, in this paper, we propose a method for reducing the costs by grasping whole danger regions in a disaster area from a global perspective. At first, we estimate future changes of dangerous regions by a simple way and link all regions with Danger Levels. Then, we index estimated dangerous regions by extended R-tree. In this step, we link the Danger Levels with depths of the extended R-tree and each Danger Level is managed at each depth of the extended R-tree. Finally, we show how our approach effects in setting escape routes.
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 subscriptionsReferences
Kitano, H., Tadokoro, S., Noda, I., Matsubara, H., Takahashi, T., Shinjou, A., Shimada, S.: Robocup-rescue: Search and rescue in large-scale disasters as a domain for automous agents research. In: Proceedings of IEEE, IEEE Press, Los Alamitos (1999)
Ishida, T.: Digital city kyoto: Social information infrastructure for everyday life. Communications of the ACM(CACM) 45 (2002)
Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of ACM SIGMOD 1984, pp. 47–57. ACM, New York (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mikuri, H., Mukai, N., Watanabe, T. (2005). R-Tree Representations of Disaster Areas Based on Probabilistic Estimation. In: Ali, M., Esposito, F. (eds) Innovations in Applied Artificial Intelligence. IEA/AIE 2005. Lecture Notes in Computer Science(), vol 3533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11504894_34
Download citation
DOI: https://doi.org/10.1007/11504894_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26551-1
Online ISBN: 978-3-540-31893-4
eBook Packages: Computer ScienceComputer Science (R0)