Building-evacuation-route planning via time-expanded process-network synthesis

García-Ojeda, Juan C.; Bertok, Botond; Friedler, Ferenc; Fan, L.T.

doi:10.1016/j.firesaf.2013.09.023

Cited by 19 publications

(14 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Optimization models gravitate to graphs to represent the paths available to pedestrian evacuees [59,60]. A graph is defined by a set of nodes representing rooms or decision points, and edges representing doors, corridors, or other paths connecting the spaces represented by nodes [61].…”

Section: Evacuation Optimizationmentioning

confidence: 99%

“…Edges are associated with weights, which can be the distance between the connected nodes or the time required to travel between the connected nodes. A time-expanded graph includes a graph and states of nodes and edges at different time steps [59,62]. Optimization of path choices has been studied either by optimizing the flow of pedestrians (or vehicles) based on evacuation graph, or by finding evacuation paths with minimum cost algorithms such as Dijkstra's, A*, Ant Colony Optimization, D*, or D* Lite.…”

Section: Evacuation Optimizationmentioning

confidence: 99%

See 1 more Smart Citation

Integrating Decentralized Indoor Evacuation with Information Depositories in the Field

Zhao

Winter

Tomko

2017

IJGI

View full text Add to dashboard Cite

Abstract:The lonelier evacuees find themselves, the riskier become their wayfinding decisions. This research supports single evacuees in a dynamically changing environment with risk-aware guidance. It deploys the concept of decentralized evacuation, where evacuees are guided by smartphones acquiring environmental knowledge and risk information via exploration and knowledge sharing by peer-to-peer communication. Peer-to-peer communication, however, relies on the chance that people come into communication range with each other. This chance can be low. To bridge between people being not at the same time at the same places, this paper suggests information depositories at strategic locations to improve information sharing. Information depositories collect the knowledge acquired by the smartphones of evacuees passing by, maintain this information, and convey it to other passing-by evacuees. Multi-agent simulation implementing these depositories in an indoor environment shows that integrating depositories improves evacuation performance: It enhances the risk awareness and consequently increases the chance that people survive and reduces their evacuation time. For evacuating dynamic events, deploying depositories at staircases has been shown more effective than deploying them in corridors.

show abstract

Section: Evacuation Optimizationmentioning

confidence: 99%

Section: Evacuation Optimizationmentioning

confidence: 99%

Integrating Decentralized Indoor Evacuation with Information Depositories in the Field

Zhao

Winter

Tomko

2017

IJGI

View full text Add to dashboard Cite

show abstract

“…Esto ha dado lugar al desarrollo de síntesis de redes de procesos de tiempo expandido, PNST, propuesto en [21] [22]. Sin embargo, en el método propuesto no es sencillo determinar de manera única las diferentes rutas de evacuación dentro de un edificio [21] [22].…”

Section: Metodologíaunclassified

“…Sin embargo, en el método propuesto no es sencillo determinar de manera única las diferentes rutas de evacuación dentro de un edificio [21] [22]. En la presente contribución, se da solución a dicho problema de manera algorítmica.…”

Section: Metodologíaunclassified

Identifying evacuation routes via the P-graph methodology

García-Ojeda

Bertok

Friedler

et al. 2015

2015 10th Computing Colombian Conference (10CCC)

View full text Add to dashboard Cite

In this work, we propose a method and its concomitant software for the identification and assessment of building-evacuation routes. First, the building floor map is represented via P-graphs, thereby facilitating the identification of the evacuation routes. Second, each route identified is transformed into a time-expanded, process-network synthesis (PNST) problem, which can be algorithmically solved by the P-graph methodology. In the proposed method, each location and passage in the building is defined by a set of attributes to be taken into account in the evacuation-route planning. Third, the evacuation routes are ranked in terms of the evacuation time computed as the minimum cost of the corresponding PNST problem. Furthermore, the evacuation routes can be ranked according to specific criteria (e.g., bottlenecks, route utilization, etc.).Resumen-Este trabajo propone un método y software para la identificación y análisis de los planes de rutas de evacuación en edificios. Inicialmente, el plano arquitectónico del edificio se representa mediante P-graphs para facilitar la identificación de las rutas de evacuación. Posteriormente, cada una de estas rutas se transforma en un problema de síntesis de redes de procesos de tiempo expandido (PNST); el cual se resuelve algorítmicamente con base en la metodología P-graph. En el método propuesto, cada ubicación y corredor en el edificio se describe por medio de un conjunto de atributos que debe considerarse en el plan de rutas de evacuación. Finalmente, las rutas de evacuación se organizan con base en el tiempo de evacuación que se calcula como el costo mínimo del correspondiente problema PNST. Además, las rutas de evacuación pueden organizarse según diferentes criterios (e.g., cuellos de botella, utilización de rutas, etc.).

show abstract

“…It was also used in supply chain management; such results can be found at [1,2,8,15,22]. Moreover the P-graph framework was also used in planning building evaluation routes [11,12].…”

Section: Introductionmentioning

confidence: 99%

Heuristic Algorithms for the Robust PNS Problem

2014

APH

View full text Add to dashboard Cite

show abstract

Building-evacuation-route planning via time-expanded process-network synthesis

Cited by 19 publications

References 10 publications

Integrating Decentralized Indoor Evacuation with Information Depositories in the Field

Integrating Decentralized Indoor Evacuation with Information Depositories in the Field

Identifying evacuation routes via the P-graph methodology

Heuristic Algorithms for the Robust PNS Problem

Contact Info

Product

Resources

About