정보처리학회논문지:컴퓨터 및 통신 시스템 (KIPS Transactions on Computer and Communication Systems)

  • 제5권7호
  • /
  • Pages.159-172
  • /
  • 2016
  • /
  • 2287-5891(pISSN)
  • /
  • 2734-049X(eISSN)
한국정보처리학회 (Korea Information Processing Society)
권호 표지
DOI QR코드

DOI QR Code

실내 빌딩 환경에서 부하 균등을 고려한 대피경로 산출

Planning Evacuation Routes with Load Balancing in Indoor Building Environments

  • 투고 : 2016.03.31
  • 심사 : 2016.06.30
  • 발행 : 2016.07.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 연구는 복층 건물에서 실내 재난상황이 발생했을 때 적절한 대피경로들을 산출하기 위한 새로운 알고리즘을 제안한다. 제안된 방안은 Disaster Evacuation Graph(DEG)를 도입하여, 탐색시간을 크게 단축시킨다. 또한, 대피 경로 상의 인원수용능력과 그에 따른 인원 분산을 동시에 고려한다. 경로를 탐색하는 과정은 크게 두 단계로 구성된다. 이 때 각 단계는 Horitzontal Tiering(HT)과 Vertical Tiering(VT) 단계라 한다. HT 단계에서는 특정 층 임의의 공간으로부터 계단으로 향하는 가능한 최적의 경로를 산출한다. 그리고 모든 층에 대해 HT 단계를 수행한 이후, 각 층의 모든 공간으로부터 건물 입구나 옥상과 같은 안전지대로 향하는 경로를 결정하기 위해, VT 단계에서 HT 단계의 결과들을 통합한다. 이러한 단계별 과정에서 각각, 층 내 모든 공간으로부터 계단으로 향하는 경로와 각 계단으로부터 안전지대로 향하는 경로가 산출된다. 그리고 이러한 과정에서 경로를 탐색하기 위한 그래프의 범위를 결정하기 위해 티어링(tiering) 기법이 이용된다. 제안된 알고리즘의 성능을 평가하기 위하여, 빠른 탐색과 인원 분산을 위해 기존에 연구되었던 경로탐색 알고리즘들과, 경로탐색에 소요된 시간 및 사용자 대피시간을 비교한다. 제안된 알고리즘은 기존에 비해 더 짧은 시간 내에 빠르게 대피할 수 있는 경로를 산출한다. 특히 경로탐색을 위한 시간복잡도 성능이 뛰어나기 때문에, 높은 층으로 구성된 큰 규모의 건물에서 유용하게 활용할 수 있다.

This paper presents a novel algorithm for searching evacuation paths in indoor disaster environments. The proposed method significantly improves the time complexity to find the paths to the evacuation exit by introducing a light-weight Disaster Evacuation Graph (DEG) for a building in terms of the size of the graph. With the DEG, the method also considers load balancing and bottleneck capacity of the paths to the evacuation exit simultaneously. The behavior of the algorithm consists of two phases: horizontal tiering (HT) and vertical tiering (VT). The HT phase finds a possible optimal path from anywhere of a specific floor to the evacuation stairs of the floor. Thus, after finishing the HT phases of all floors in parallel the VT phase begins to integrate all results from the previous HT phases to determine a evacuation path from anywhere of a floor to the safety zone of the building that could be the entrance or the roof of the building. It should be noted that the path produced by the algorithm. And, in order to define the range of graph to process, tiering scheme is used. In order to test the performance of the method, computing times and evacuation times are compared to the existing path searching algorithms. The result shows the proposed method is better than the existing algorithms in terms of the computing time and evacuation time. It is useful in a large-scale building to find the evacuation routes for evacuees quickly.

키워드

참고문헌

  1. G. Ni, Z. Chen, J. Jiang, J. Luo, and Y. Ma, "Incremental Updates Based on Graph Theory for Consumer Electronic Devices," IEEE Transactions on Consumer Electronics, Vol.61, No.1, pp.128-136, 2015. https://doi.org/10.1109/TCE.2015.7064120
  2. C. Hernandez, T. Uras, S. Koenig, J. A. Baier, X. Sun, and P. Meseguer, "Reusing Cost-Minimal Paths for Goal-Directed Navigation in Partially Known Terrains," Autonomous Agents and Multi-Agent Systems, 2014.
  3. J. Ahn and R. Han, "RescueMe: An Indoor Mobile Augmented-Reality Evacuation System by Personalized Pedometry," 2011 IEEE Asia-Pacific Services Computing Conference, pp.70-77, 2011.
  4. W. Bian, Y. Guo, and Q. Qiu, "Research on Personalized Indoor Routing Algorithm," 2014 13th International Symposium on DCABES, pp.275-277, 2014.
  5. L. S. C. Pun-Cheng, "An Interactive Web-Based Public Transport Enquiry System With Real-Time Optimal Route Computation," IEEE Transactions on Intelligent Transportation Systems, Vol.13, No.2, pp.983-988, 2012. https://doi.org/10.1109/TITS.2011.2181501
  6. H. Yu, M. Li, T. Liu, and Z. Ning, "Use Critical Sub-graph to Optimize the In-building Shortest Path Algorithm," 2012 3rd International Conference on Innovations in Bio-Inspired Computing and Applications, pp.323-328, 2012.
  7. S. Chen and Y. Lin, "Search for All Minimal Paths in a General Large Flow Network," IEEE Transactions on Reliability, Vol.61, No.4, pp.949-956, 2012. https://doi.org/10.1109/TR.2012.2220897
  8. D. J. Na, and K. H. Choi, "Step Trajectory/Indoor Map Feature-based Smartphone Indoor Positioning System without Using Wi-Fi Signals," IEMEK Journal of Embedded Systems and Applications, Vol.9, No.6, pp.323-334, 2014. https://doi.org/10.14372/IEMEK.2014.9.6.323
  9. T. S. Perry, "Navigating the Great Indoors," IEEE Spectrum, Vol.49, No.11, p.15, 2012. https://doi.org/10.1109/MSPEC.2012.6281117
  10. B. Xiao, J. Cao, Z. Shao, and E.H.-M. Sha, "An Efficient Algorithm for Dynamic Shortest Path Tree Update in Network Routing," Journal of Communications and Networks, Vol.9, No.4, pp.499-510, 2007. https://doi.org/10.1109/JCN.2007.6182886
  11. B. Pizzileo, P. Lino, B. Maione, and G. Maione, "A New Algorithm for Controlling Building Evacuation by Feedback on Hazard Level and Crowd Distribution," Proc. of IEEE Industrial Electronics Society Annual International Conference (IECON), pp.434-439, 2011.
  12. E. Kim, Y. Kim, and J. Kim, "A Study on the Optimum Refuge Path Algorithm in Multiplex Building using the Human Movement Detection System," Journal of The Korean Digital Architecture.Interior Association, Vol.8, No.2, pp.13-20, 2008.
  13. S. Kwak, H. Nam, and C. Jun, "An optimal Model for Indoor Pedestrian Evacuation considering the Entire Distribution of Building Pedestrians," Journal of The Korean Society for Geo-Spatial Information System, Vol.20, No.2, pp.23-29, 2012.
  14. C. Kang, J. Lee, J. Song, and K. Jung, "Route Optimization for Emergency Evacuation and Response in Disaster Area," Journal of the Korean Society of Civil Engineers, Vol.34, No.2, pp.617-626, 2014. https://doi.org/10.12652/Ksce.2014.34.2.0617
  15. M. Jang, W. Jung, and K. Lim, "A Disaster Evacuation System Using Smart Devices for Indoor Crisis Management in BLE Environments," IEMEK Journal of Embedded Systems and Applications, Vol.10, No.5, pp.281-296, 2015. https://doi.org/10.14372/IEMEK.2015.10.5.281
  16. J. Sun and X. Li, "Indoor Evacuation Routes Planning with a Grid Graph-based Model," 2011 19th International Conference on Geoinformatics, pp.1-4, 2011.
  17. T. Y. Wang, R. Huang, L. Li, W. G. Xu, and J. G. Nie, "The Application of the Shortest Path Algorithm in the Evacuation System," 2011 International Conference on ICM, Vol.2, pp.250-253, 2011.
  18. C. Hernandez, T. Uras, S. Koenig, J. A. Baier, X. Sun, and P. Meseguer, "Reusing Cost-Minimal Paths for Goal-Directed Navigation in Partially Known Terrains," Autonomous Agents and Multi-Agent Systems, 2014.
  19. R. Prim, "Shortest Connection Networks and Some Generalizations," Bell System Technical Journal, Vol.36, pp.1389-1401, 1957. https://doi.org/10.1002/j.1538-7305.1957.tb01515.x
  20. S. Lee, "A Point-to-Point Shortest Path Search Algorithm in an Undirected Graph Using Minimum Spanning Tree," Journal of The Korea Society of Computer and Information, Vol.19, No.7, pp.103-111, 2014. https://doi.org/10.9708/jksci.2014.19.7.103
  21. Ability Systems [Internet], http://www.abilsys.com/sub02/?page_id=17.
  22. Korea Information Engineering Services [Internet], http://www.kibeacon.com.