Towards Crowd-aware Indoor Path Planning (Extended Version)

by   Tiantian Liu, et al.

Indoor venues accommodate many people who collectively form crowds. Such crowds in turn influence people's routing choices, e.g., people may prefer to avoid crowded rooms when walking from A to B. This paper studies two types of crowd-aware indoor path planning queries. The Indoor Crowd-Aware Fastest Path Query (FPQ) finds a path with the shortest travel time in the presence of crowds, whereas the Indoor Least Crowded Path Query (LCPQ) finds a path encountering the least objects en route. To process the queries, we design a unified framework with three major components. First, an indoor crowd model organizes indoor topology and captures object flows between rooms. Second, a time-evolving population estimator derives room populations for a future timestamp to support crowd-aware routing cost computations in query processing. Third, two exact and two approximate query processing algorithms process each type of query. All algorithms are based on graph traversal over the indoor crowd model and use the same search framework with different strategies of updating the populations during the search process. All proposals are evaluated experimentally on synthetic and real data. The experimental results demonstrate the efficiency and scalability of our framework and query processing algorithms.


An Experimental Analysis of Indoor Spatial Queries: Modeling, Indexing, and Processing

Indoor location-based services (LBS), such as POI search and routing, ar...

Path Planning in Support of Smart Mobility Applications using Generative Adversarial Networks

This paper describes and evaluates the use of Generative Adversarial Net...

An Efficient Approximation Algorithm for Multi-criteria Indoor Route Planning Queries

A route planning query has many real-world applications and has been stu...

RFID-Based Indoor Spatial Query Evaluation with Bayesian Filtering Techniques

People spend a significant amount of time in indoor spaces (e.g., office...

An Overview of Query Processing on Crowdsourced Databases

Crowd-sourcing is a powerful solution for finding correct answers to exp...

Toward Crowd-Sensitive Path Planning

If a robot can predict crowds in parts of its environment that are inacc...

A 2D kinetic model for crowd dynamics with disease contagion

We focus on the modeling and simulation of an infectious disease spreadi...