Context-aware route planning

Authors:
Adriaan W. Ter Mors;Cees Witteveen;Jonne Zutt;Fernando A. Kuipers
Affiliations:
Delft University of Technology, The Netherlands;Delft University of Technology, The Netherlands;Delft University of Technology, The Netherlands;Delft University of Technology, The Netherlands
Venue:
MATES'10 Proceedings of the 8th German conference on Multiagent system technologies
Year:
2010

Citing 2
Cited 2

Achieving network optima using Stackelberg routing strategies

IEEE/ACM Transactions on Networking (TON)
A real-time traffic control scheme of multiple AGV systems for collision free minimum time motion: a routing table approach

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Multi-robot path planning with the spatio-temporal a* algorithm and its variants

AAMAS'11 Proceedings of the 10th international conference on Advanced Agent Technology
Empirical Evaluation of Multi-Agent Routing Approaches

WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.