Towards crowd-aware indoor path planning (extended version)

T Liu, H Li, H Lu, MA Cheema, L Shou - arxiv preprint arxiv:2104.05480, 2021 - arxiv.org
Indoor venues accommodate many people who collectively form crowds. Such crowds in
turn influence people's routing choices, eg, people may prefer to avoid crowded rooms when …

ASTRO: reducing COVID-19 exposure through contact prediction and avoidance

C Anastasiou, C Costa, PK Chrysanthis… - ACM Transactions on …, 2021 - dl.acm.org
The fight against the COVID-19 pandemic has highlighted the importance and benefits of
recommending paths that reduce the exposure to and the spread of the SARS-CoV-2 …

Adaptive task planning for large-scale robotized warehouses

D Shi, Y Tong, Z Zhou, K Xu, W Tan… - 2022 IEEE 38th …, 2022 - ieeexplore.ieee.org
Robotized warehouses are deployed to automatically distribute millions of items brought by
the massive logistic orders from e-commerce. A key to automated item distribution is to plan …

Indoor mobility data encoding with TSTM-in: A topological-semantic trajectory model

J Qin, L Wang, T Wu, Y Li, L **ang, Y Zhu - Computers, Environment and …, 2024 - Elsevier
The growing ubiquity of location/activity sensing technologies has created unprecedented
opportunities for research on human spatiotemporal interaction behavior in mobile …

Towards indoor temporal-variation aware shortest path query

T Liu, Z Feng, H Li, H Lu, MA Cheema… - … on Knowledge and …, 2021 - ieeexplore.ieee.org
The recent years have witnessed the growing popularity of indoor location-based services
(LBS) in practice and research. Among others, indoor shortest path query (ISPQ) is of …

Collision-aware route planning in warehouses made efficient: A strip-based framework

D Shi, N Zhou, Y Tong, Z Zhou, Y Xu… - 2023 IEEE 39th …, 2023 - ieeexplore.ieee.org
Multi-robot systems are deployed in modern warehouses to reduce operational cost. The
robots are tasked to deliver items stored on racks to pickers for fast distribution. A central …

PeeK: A Prune-Centric Approach for K Shortest Path Computation

W Feng, S Chen, H Liu, Y Ji - … of the International Conference for High …, 2023 - dl.acm.org
The K shortest path (KSP) algorithm, which finds the top K shortest simple paths from a
source to a target vertex, has a wide range of real-world applications, eg, routing …

HMLPA*: a hierarchical multi-target LPA* pathfinding algorithm designed for dynamic indoor path network

Y Zhou, Y Zhang, Y Zhang - International Journal of Geographical …, 2025 - Taylor & Francis
Abstract The Lifelong Planning A*(LPA*) algorithm demonstrates unique advantages in
dynamic pathfinding by employing incremental update techniques that reuse previously …

Time-constrained indoor keyword-aware routing

HKH Chan, T Liu, H Li, H Lu - … of the 17th International Symposium on …, 2021 - dl.acm.org
With the increasingly available indoor positioning technologies, indoor location-based
services (LBS) are becoming popular. Among indoor LBS applications, indoor routing is …

Time-constrained indoor keyword-aware routing: foundations and extensions

HKH Chan, T Liu, H Li, H Lu - GeoInformatica, 2023 - Springer
With the increasingly available indoor positioning technologies, indoor location-based
services (LBS) are becoming popular. Among indoor LBS applications, indoor routing is …