Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

8-2013

Abstract

We consider the problem of adaptively routing a fleet of cooperative vehicles within a road network in the presence of uncertain and dynamic congestion conditions. To tackle this problem, we first propose a Gaussian Process Dynamic Congestion Model that can effectively characterize both the dynamics and the uncertainty of congestion conditions. Our model is efficient and thus facilitates real-time adaptive routing in the face of uncertainty. Using this congestion model, we develop an efficient algorithm for non-myopic adaptive routing to minimize the collective travel time of all vehicles in the system. A key property of our approach is the ability to efficiently reason about the long-term value of exploration, which enables collectively balancing the exploration/exploitation trade-off for entire fleets of vehicles. We validate our approach based on traffic data from two large Asian cities. We show that our congestion model is effective in modeling dynamic congestion conditions. We also show that our routing algorithm generates significantly faster routes compared to standard baselines, and achieves near-optimal performance compared to an omniscient routing algorithm. We also present the results from a preliminary field study, which showcases the efficacy of our approach.

Discipline

Databases and Information Systems | Theory and Algorithms

Publication

KDD '13 Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining

First Page

704

Last Page

712

ISBN

978-1-4503-2174-7

Identifier

10.1145/2487575.2487598

Publisher

ACM

Copyright Owner and License

LARC

Download

Share

COinS