Graph-based approaches for simulating pedestrian dynamics in building models

Mario Höcker, Volker Berkhahn, Angelika Kneidl, André Borrmann, Wolfram Klein

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

40 Zitate (Scopus)

Abstract

This paper presents different path-finding algorithms for simulating pedestrian dynamics in building models. Starting from a given model (scenario), we show how to automatically derive a visibility graph. This graph is used as the underlying structure for routing pedestrians from their sources to their destinations. Based on this graph, we search for fastest routes by means of a conventional Dijkstra algorithm where we assign dynamically changing travel times as edge weights. To update the shortest paths due to changing edge weights, we introduce a heuristic A*algorithm, which is faster in finding optimal paths. We compare the results of our approach to a variant where we assign Euclidean distances as static edge weights. Additionally, we show that the A*algorithm has a better performance in finding the shortest path for most cases.

OriginalspracheEnglisch
TiteleWork and eBusiness in Architecture, Engineering and Construction - Proceedings of the European Conference on Product and Process Modelling 2010
Herausgeber (Verlag)CRC Press
Seiten389-394
Seitenumfang6
ISBN (Print)9780415605076
DOIs
PublikationsstatusVeröffentlicht - 2010
Veranstaltung1st European Conference for Product and Process Modelling, ECPPM 2010 - Cork, Irland
Dauer: 14 Sept. 201016 Sept. 2010

Publikationsreihe

NameeWork and eBusiness in Architecture, Engineering and Construction - Proceedings of the European Conference on Product and Process Modelling 2010

Konferenz

Konferenz1st European Conference for Product and Process Modelling, ECPPM 2010
Land/GebietIrland
OrtCork
Zeitraum14/09/1016/09/10

Fingerprint

Untersuchen Sie die Forschungsthemen von „Graph-based approaches for simulating pedestrian dynamics in building models“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren