Continuous Lifelong Conflict-Aware AGV Routing with Kinematic Constraints
Summary: Presents an online, continuous lifelong AGV-routing framework handling unknown future tasks, conflicts, and acceleration/deceleration/rotation constraints at warehouse scale. Its Multi-Hop Conflict-Aware Search combines actions and decomposes motions, reportedly cutting routing time by three orders of magnitude. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Ruizhong Wu (Hong Kong University of Science and Technology)
- 2. Mengxuan Zhang (Australian National University)
- 3. Shuxin Wang (Hong Kong Industrial Artificial Intelligence and Robotics Centre)
- 4. Frodo Kin Sun Chan (Hong Kong Industrial Artificial Intelligence and Robotics Centre)
- 5. Yan Nei Law (Hong Kong Industrial Artificial Intelligence and Robotics Centre)
- 6. Lei Li (Hong Kong University of Science and Technology; Hong Kong University of Science and Technology (HZ campus))
BibTeX Citation
@article{wu_vldb25,
title = {{Continuous Lifelong Conflict-Aware AGV Routing with Kinematic Constraints}},
author = {Wu, Ruizhong and Zhang, Mengxuan and Wang, Shuxin and Chan, Frodo Kin Sun and Law, Yan Nei and Li, Lei},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {7},
pages = {2254--2267},
doi = {10.14778/3734839.3734859},
url = {https://doi.org/10.14778/3734839.3734859},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 195 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025813775 |
| 1,613 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD | 0.00010216983 |
| 2,097 | Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees | 2020 | VLDB | 9.1725037e-05 |
| 4,135 | Minimal On-Road Time Route Scheduling on Time-Dependent Graphs | 2017 | VLDB | 6.8814581e-05 |
| 6,844 | An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network | 2021 | VLDB | 5.7566172e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,035 | Large Scale Real-time Ridesharing with Service Guarantee on Road Networks | 2014 | VLDB |
| 2 | 3,694 | Anytime Stochastic Routing with Hybrid Learning | 2020 | VLDB |
| 3 | 10,918 | Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks | 2025 | VLDB |
| 4 | 9,814 | Real-time Insertion Operator for Shared Mobility on Time-Dependent Road Networks | 2024 | VLDB |
| 5 | 4,807 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB |
| 6 | 11,254 | Efficient Stochastic Routing in Path-Centric Uncertain Road Networks | 2024 | VLDB |
| 7 | 6,302 | Last-Mile Delivery Made Practical: An Efficient Route Planning Framework with Theoretical Guarantees | 2020 | VLDB |
| 8 | 5,289 | Interactive Route Search in the Presence of Order Constraints | 2010 | VLDB |
| 9 | 11,695 | Towards Crowd-aware Indoor Path Planning | 2021 | VLDB |
| 10 | 9,229 | Continuously Monitoring Alternative Shortest Paths on Road Networks | 2020 | VLDB |