Graph-based approaches for simulating pedestrian dynamics in building models

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

40 Scopus citations

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.

Original languageEnglish
Title of host publicationeWork and eBusiness in Architecture, Engineering and Construction - Proceedings of the European Conference on Product and Process Modelling 2010
PublisherCRC Press
Pages389-394
Number of pages6
ISBN (Print)9780415605076
DOIs
StatePublished - 2010
Event1st European Conference for Product and Process Modelling, ECPPM 2010 - Cork, Ireland
Duration: 14 Sep 201016 Sep 2010

Publication series

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

Conference

Conference1st European Conference for Product and Process Modelling, ECPPM 2010
Country/TerritoryIreland
CityCork
Period14/09/1016/09/10

Fingerprint

Dive into the research topics of 'Graph-based approaches for simulating pedestrian dynamics in building models'. Together they form a unique fingerprint.

Cite this