Graph-based approaches for simulating pedestrian dynamics in building models

Höcker, M.; Berkhahn, Volker; Kneidl, Angelika; Borrmann, André; Klein, Wolfram

doi:10.1201/b10527-65

Cited by 34 publications

(24 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [19], pedestrians minimize their travel time by solving the HamiltonJacobi-Bellman equation, yielding the optimal pedestrian path at each time step. A combination of a graph-based routing with CA is presented in [17] where the fastest path for pedestrians is computed using a heuristic A * algorithm [31]. In [29] visibility graphs and the Dijkstra method are used to determine the route of pedestrians in discrete space.…”

Section: Introductionmentioning

confidence: 99%

Modeling the Dynamic Route Choice of Pedestrians to Assess the Criticality of Building Evacuation

Wagoum

Seyfried

Höll

2012

Advs. Complex Syst.

View full text Add to dashboard Cite

In this paper we propose an event-driven way finding algorithm for pedestrians in a graph-based structure. The motivation of each pedestrian is to leave the facility. The events used to redirect pedestrians include the identification of a jam situation and/or identification of a better route than the present. The modeled strategies are the shortest path (local and global); they are combined with a quickest path approach, which is based on an observation principle, i.e. pedestrians take their decisions based on the observed environment and are routed dynamically in the network using an appropriate cost benefit analysis function. The influences of the different strategies on the evacuation time, the individual times spent in jam, the jam size evolution, and the overall jam size itself are investigated. The response of the system to broken escape routes is also analyzed. A good and plausible dynamic response in the route choice behavior of the pedestrians is achieved.

show abstract

Section: Introductionmentioning

confidence: 99%

Modeling the Dynamic Route Choice of Pedestrians to Assess the Criticality of Building Evacuation

Wagoum

Seyfried

Höll

2012

Advs. Complex Syst.

View full text Add to dashboard Cite

show abstract

“…Travel time as determinant of the motion has been discussed and modeled in a number of previous works, sometimes for macro-or mesoscopic approaches [13,14,32,8,44], but more often within the scope of microscopic models. Of these the majority are field-based as the dynamic potential approach [12,49,46,26,27,23,47,29,28,7,24], but there exist also other methods which are based on an additional routing network, discrete choice or heuristics [5,3,11,21,34]. …”

Section: Related Workmentioning

confidence: 99%

Calibrating dynamic pedestrian route choice with an Extended Range Telepresence System

Kretz

Hengst

Roca

et al. 2011

2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)

View full text Add to dashboard Cite

In this contribution we present the results of a pilot study in which an Extended Range Telepresence System is used to calibrate parameters of a pedestrian model for simulation. The parameters control a model element that is intended to make simulated agents walk in the direction of the estimated smallest remaining travel time. We use this to, first, show that that an Extended Range Telepresence System can serve for such a task in general and second to actually find simulation parameters that yield realistic results.

show abstract

“…Other graph algorithms like A*, Floyd-Warshall or Bellman-Ford [35] are also used to determine the shortest path from a source to a destination. In [36] a reduced visibility graph is used to reflect possible route choices and the FastestPath Algorithm finds the fastest path for travelers [37]. In [38] metrical-topological models constructed from labelled floor plan geometry are used to describe the shape and connectivity of space, and constitute useful underlying tools for wayfinding.…”

Section: Related Workmentioning

confidence: 99%

Decision Making in Building Maintenance Using a Graph-Based Knowledge Representation

Palacz

Ślusarczyk

Łachwa

et al. 2017

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

Abstract-This paper is an attempt to support effective decision making in building management by assisting maintenance processes. Knowledge about buildings is stored in a graph with many hierarchies. This representation allows us to express different types of hierarchical dependencies between building parts, like geometrical and functional ones, in one structure. Moreover, such a structure is useful to extract subgraphs containing information necessary for a given computational task, such as locating a desired place and the shortest path leading to it. As maintanance processes often require dynamic path target selection, modified indoor navigation methods are proposed. The paper presents the capability of the described knowledge model to cope with complex queries referring to different types of information. The considered examples show that the proposed approach can be used for various facility maintenance management applications.

show abstract

Graph-based approaches for simulating pedestrian dynamics in building models

Cited by 34 publications

References 8 publications

Modeling the Dynamic Route Choice of Pedestrians to Assess the Criticality of Building Evacuation

Modeling the Dynamic Route Choice of Pedestrians to Assess the Criticality of Building Evacuation

Calibrating dynamic pedestrian route choice with an Extended Range Telepresence System

Decision Making in Building Maintenance Using a Graph-Based Knowledge Representation

Contact Info

Product

Resources

About