An automated direction setting algorithm for a smart exit sign

Jehyun Cho, Ghang Lee, Seungjae Lee

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

The aim of this study is to develop an automated direction setting algorithm (ADSA) for a smart exit sign system. The challenges of the ADSA are to translate various space types into nodes on a graph, and to provide directions to the shortest safe egress to any evacuees at any point in a building using publicly available exit signs. We have developed a classification for space types and an ADSA that can exclude unsafe paths and calculate the shortest safe path from unknown points in a building to the closest exit points. We do this by reversing and simplifying the start and end nodes of the typical Dijkstra's algorithm by adding a virtual node. The validity of the ADSA was tested through scenario-based simulations of test cases with various conditions and performance comparison with existing algorithms.

Original languageEnglish
Article number1914
Pages (from-to)139-148
Number of pages10
JournalAutomation in Construction
Volume59
DOIs
Publication statusPublished - 2015 Nov

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Civil and Structural Engineering
  • Building and Construction

Cite this

@article{44266ac8a6fc4998b00bf96f01362482,
title = "An automated direction setting algorithm for a smart exit sign",
abstract = "The aim of this study is to develop an automated direction setting algorithm (ADSA) for a smart exit sign system. The challenges of the ADSA are to translate various space types into nodes on a graph, and to provide directions to the shortest safe egress to any evacuees at any point in a building using publicly available exit signs. We have developed a classification for space types and an ADSA that can exclude unsafe paths and calculate the shortest safe path from unknown points in a building to the closest exit points. We do this by reversing and simplifying the start and end nodes of the typical Dijkstra's algorithm by adding a virtual node. The validity of the ADSA was tested through scenario-based simulations of test cases with various conditions and performance comparison with existing algorithms.",
author = "Jehyun Cho and Ghang Lee and Seungjae Lee",
year = "2015",
month = "11",
doi = "10.1016/j.autcon.2015.05.004",
language = "English",
volume = "59",
pages = "139--148",
journal = "Automation in Construction",
issn = "0926-5805",
publisher = "Elsevier",

}

An automated direction setting algorithm for a smart exit sign. / Cho, Jehyun; Lee, Ghang; Lee, Seungjae.

In: Automation in Construction, Vol. 59, 1914, 11.2015, p. 139-148.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An automated direction setting algorithm for a smart exit sign

AU - Cho, Jehyun

AU - Lee, Ghang

AU - Lee, Seungjae

PY - 2015/11

Y1 - 2015/11

N2 - The aim of this study is to develop an automated direction setting algorithm (ADSA) for a smart exit sign system. The challenges of the ADSA are to translate various space types into nodes on a graph, and to provide directions to the shortest safe egress to any evacuees at any point in a building using publicly available exit signs. We have developed a classification for space types and an ADSA that can exclude unsafe paths and calculate the shortest safe path from unknown points in a building to the closest exit points. We do this by reversing and simplifying the start and end nodes of the typical Dijkstra's algorithm by adding a virtual node. The validity of the ADSA was tested through scenario-based simulations of test cases with various conditions and performance comparison with existing algorithms.

AB - The aim of this study is to develop an automated direction setting algorithm (ADSA) for a smart exit sign system. The challenges of the ADSA are to translate various space types into nodes on a graph, and to provide directions to the shortest safe egress to any evacuees at any point in a building using publicly available exit signs. We have developed a classification for space types and an ADSA that can exclude unsafe paths and calculate the shortest safe path from unknown points in a building to the closest exit points. We do this by reversing and simplifying the start and end nodes of the typical Dijkstra's algorithm by adding a virtual node. The validity of the ADSA was tested through scenario-based simulations of test cases with various conditions and performance comparison with existing algorithms.

UR - http://www.scopus.com/inward/record.url?scp=84944442150&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84944442150&partnerID=8YFLogxK

U2 - 10.1016/j.autcon.2015.05.004

DO - 10.1016/j.autcon.2015.05.004

M3 - Article

AN - SCOPUS:84944442150

VL - 59

SP - 139

EP - 148

JO - Automation in Construction

JF - Automation in Construction

SN - 0926-5805

M1 - 1914

ER -