Continuous Lifelong Conflict-Aware AGV Routing with Kinematic Constraints
Summary: Framework that, for the first time, jointly handles continuous-time, lifelong online task arrivals, kinematic constraints (acceleration/deceleration/turning) and scalable conflict-aware AGV routing. Introduces Multi-Hop Conflict-Aware Search (MHCAS) with action-combination (MHSC) and OHSMD motion decomposition to cut routing time by ≈3 orders of magnitude and empirically beat MAPF baselines. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Ruizhong Wu
- 2. Mengxuan Zhang
- 3. Shuxin Wang
- 4. Frodo Kin Sun Chan
- 5. Yan Nei Law
- 6. Lei Li
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 |
|---|---|---|---|---|
| 260 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00030040036 |
| 2,201 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD | 9.3048105e-05 |
| 2,547 | Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees | 2020 | VLDB | 8.5683079e-05 |
| 3,164 | Minimal On-Road Time Route Scheduling on Time-Dependent Graphs | 2017 | VLDB | 7.4543722e-05 |
| 6,494 | An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network | 2021 | VLDB | 5.0417258e-05 |
Previous
Page 1 / 1
Next