Context-Aware Route Planning

Context-Aware Route Planning

Ter Mors, A.W.
Witteveen, C.
Zutt, J.
Kuipers, F.A.

Electrical Engineering, Mathematics and Computer Science

Network Architectures & Services (NAS)

2010-09-29

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.

http://resolver.tudelft.nl/uuid:98cf3152-cf69-49ee-b3e5-82654592cd85

Proc. of the 8th German Conference on Multi-Agent System Technologies (MATES 2010), Leipzig, Germany, 27 - 29 september 2010

Institutional Repository

conference paper

(c) 2010 Ter Mors, A.W.
Witteveen, C.
Zutt, J.
Kuipers, F.A.