Context-Aware Route Planning
- 517 Downloads
In context-aware route planning, there is a set of transportation agents each with a start and destination location on a shared infrastructure. Each agent wants to find a shortest-time route plan without colliding with any of the other agents, or ending up in a deadlock situation. We present a single-agent route planning algorithm that is both optimal and conflict-free. We also present a set of experiments that compare our algorithm to finding a conflict-free schedule along a fixed path. In particular, we will compare our algorithm to the approach where the shortest conflict-free schedule is chosen along one of k shortest paths. Although neither approach can guarantee optimality with regard to the total set of agent route plans — and indeed examples can be constructed to show that either approach can outperform the other — our experiments show that our approach consistently outperforms fixed-path scheduling.
KeywordsShort Path Random Graph Destination Location Agent Plan Route Planning
Unable to display preview. Download preview PDF.
- 2.Hatzack, W., Nebel, B.: The operational traffic problem: Computational complexity and solutions. In: ECP’01, pp. 49–60 (2001)Google Scholar
- 4.ter Mors, A.W.: The world according to MARP: multi-agent route planning. PhD thesis, Delft University of Technology (March 2010)Google Scholar
- 9.ter Mors, A.W., Zutt, J., Witteveen, C.: Context-aware logistic routing and scheduling. In: ICAPS, pp. 328–335 (2007)Google Scholar