Strategic Dynamic Vehicle Routing with Spatio-Temporal Dependent Demands
Name
Frazzoli_Strategic Dymanic.pdf
Size
146.77 KB
Format
Adobe PDF
Checksum (MD5)
4a8c67e0d856162575a4ecdaaf3619b9
Author(s)
Feijer Rovira, Diego Francisco
Savla, Ketan D.
Frazzoli, Emilio
Date Issued
June 2012
Journal
Proceedings of the 2012 American Control Conference
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Feijer Rovira, Diego Francisc et al. "Strategic Dynamic Vehicle Routing with Spatio-Temporal Dependent Demands." IEEE American Control Conference, 2012.
Version
Author's final manuscript
Abstract
We study a zero-sum game formulation of a dynamic vehicle routing problem: a system planner seeks to design dynamic routing policies for a team of vehicles to minimize the average waiting time of demands that are strategically placed in a region by an adversarial agent with unitary capacity operating from a depot. We characterize an equilibrium in the limiting case where vehicles travel arbitrarily slower than the agent (heavy load). We show that such an equilibrium consists of a routing policy based on performing successive TSP tours through outstanding demands and a unique power-law spatial density centered at the depot location.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6315552
