A data-driven approach to predict decision point choice during normal and evacuation wayfinding in multi-story buildings

• URL: http://arxiv.org/abs/2308.03511v1
• Date: Mon, 7 Aug 2023 12:05:55 GMT
• Title: A data-driven approach to predict decision point choice during normal and evacuation wayfinding in multi-story buildings
• Authors: Yan Feng, Panchamy Krishnakumari
• Abstract summary: This paper presents a data-driven approach for understanding and predicting the pedestrian decision point choice during normal and emergency wayfinding in a multi-story building. We first built an indoor network representation and proposed a data mapping technique to map VR coordinates to the indoor representation. We then used a well-established machine learning algorithm, namely the random forest (RF) model to predict pedestrian decision point choice along a route during four wayfinding tasks in a multi-story building.
• Score: 19.36581352680941
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Understanding pedestrian route choice behavior in complex buildings is important to ensure pedestrian safety. Previous studies have mostly used traditional data collection methods and discrete choice modeling to understand the influence of different factors on pedestrian route and exit choice, particularly in simple indoor environments. However, research on pedestrian route choice in complex buildings is still limited. This paper presents a data-driven approach for understanding and predicting the pedestrian decision point choice during normal and emergency wayfinding in a multi-story building. For this, we first built an indoor network representation and proposed a data mapping technique to map VR coordinates to the indoor representation. We then used a well-established machine learning algorithm, namely the random forest (RF) model to predict pedestrian decision point choice along a route during four wayfinding tasks in a multi-story building. Pedestrian behavioral data in a multi-story building was collected by a Virtual Reality experiment. The results show a much higher prediction accuracy of decision points using the RF model (i.e., 93% on average) compared to the logistic regression model. The highest prediction accuracy was 96% for task 3. Additionally, we tested the model performance combining personal characteristics and we found that personal characteristics did not affect decision point choice. This paper demonstrates the potential of applying a machine learning algorithm to study pedestrian route choice behavior in complex indoor buildings.

Related papers

• Pedestrian wayfinding behavior in a multi-story building: a comprehensive modeling study featuring route choice, wayfinding performance, and observation behavior [17.538302663734225]
  This paper proposes a comprehensive approach for modeling pedestrian wayfinding behavior in complex buildings. Four wayfinding tasks were designed to determine how personal, infrastructure, and route characteristics affect indoor pedestrian wayfinding behavior. We find that pedestrian route choice behavior is primarily influenced by route characteristics, whereas wayfinding performance is also influenced by personal characteristics.
  arXiv  Detail & Related papers  (2023-04-20T08:22:10Z)
• R(Det)^2: Randomized Decision Routing for Object Detection [64.48369663018376]
  We propose a novel approach to combine decision trees and deep neural networks in an end-to-end learning manner for object detection. To facilitate effective learning, we propose randomized decision routing with node selective and associative losses. We name this approach as the randomized decision routing for object detection, abbreviated as R(Det)$2$.
  arXiv  Detail & Related papers  (2022-04-02T07:54:58Z)
• Pedestrian Detection: Domain Generalization, CNNs, Transformers and Beyond [82.37430109152383]
  We show that, current pedestrian detectors poorly handle even small domain shifts in cross-dataset evaluation. We attribute the limited generalization to two main factors, the method and the current sources of data. We propose a progressive fine-tuning strategy which improves generalization.
  arXiv  Detail & Related papers  (2022-01-10T06:00:26Z)
• Data Driven VRP: A Neural Network Model to Learn Hidden Preferences for VRP [9.434400627011108]
  We use a neural network model to estimate the arc probabilities, which allows for additional features and automatic parameter estimation. We investigate the difference with a prior weighted Markov counting approach, and study the applicability of neural networks in this setting.
  arXiv  Detail & Related papers  (2021-08-10T10:53:44Z)
• Diverse Complexity Measures for Dataset Curation in Self-driving [80.55417232642124]
  We propose a new data selection method that exploits a diverse set of criteria that quantize interestingness of traffic scenes. Our experiments show that the proposed curation pipeline is able to select datasets that lead to better generalization and higher performance.
  arXiv  Detail & Related papers  (2021-01-16T23:45:02Z)
• Detecting 32 Pedestrian Attributes for Autonomous Vehicles [103.87351701138554]
  In this paper, we address the problem of jointly detecting pedestrians and recognizing 32 pedestrian attributes. We introduce a Multi-Task Learning (MTL) model relying on a composite field framework, which achieves both goals in an efficient way. We show competitive detection and attribute recognition results, as well as a more stable MTL training.
  arXiv  Detail & Related papers  (2020-12-04T15:10:12Z)
• RNN-based Pedestrian Crossing Prediction using Activity and Pose-related Features [3.530819234519772]
  In this paper, different variations of a deep learning system are proposed to attempt to solve this problem. The proposed models are composed of two parts: a CNN-based feature extractor and an RNN module. The results indicate that the choice of the features extraction method, the inclusion of additional variables such as pedestrian gaze direction and discrete orientation, and the chosen RNN type have a significant impact on the final performance.
  arXiv  Detail & Related papers  (2020-08-26T16:06:24Z)
• DGSAC: Density Guided Sampling and Consensus [4.808421423598809]
  Kernel Residual Density is a key differentiator between inliers and outliers. We propose two model selection algorithms, an optimal quadratic program based, and a greedy. We evaluate our method on a wide variety of tasks like planar segmentation, motion segmentation, vanishing point estimation, plane fitting to 3D point cloud, line, and circle fitting.
  arXiv  Detail & Related papers  (2020-06-03T17:42:53Z)
• Pedestrian Action Anticipation using Contextual Feature Fusion in Stacked RNNs [19.13270454742958]
  We propose a solution for the problem of pedestrian action anticipation at the point of crossing. Our approach uses a novel stacked RNN architecture in which information collected from various sources, both scene dynamics and visual features, is gradually fused into the network.
  arXiv  Detail & Related papers  (2020-05-13T20:59:37Z)
• Generalizable Pedestrian Detection: The Elephant In The Room [82.37430109152383]
  We find that existing state-of-the-art pedestrian detectors, though perform quite well when trained and tested on the same dataset, generalize poorly in cross dataset evaluation. We illustrate that diverse and dense datasets, collected by crawling the web, serve to be an efficient source of pre-training for pedestrian detection.
  arXiv  Detail & Related papers  (2020-03-19T14:14:52Z)
• Spatiotemporal Relationship Reasoning for Pedestrian Intent Prediction [57.56466850377598]
  Reasoning over visual data is a desirable capability for robotics and vision-based applications. In this paper, we present a framework on graph to uncover relationships in different objects in the scene for reasoning about pedestrian intent. Pedestrian intent, defined as the future action of crossing or not-crossing the street, is a very crucial piece of information for autonomous vehicles.
  arXiv  Detail & Related papers  (2020-02-20T18:50:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.