Dynamic Vehicle Routing with Stochastic Time Constraints
Name
Frazzoli-2010-Dynamic vehicle routing with stochastic time constraints.pdf
Size
488.94 KB
Format
Adobe PDF
Checksum (MD5)
3a36780d89fdbc7936ac3a22d03207b2
Author(s)
Pavone, Marco
Frazzoli, Emilio
Date Issued
May 2010
Journal
IEEE International Conference on Robotics and Automation (ICRA) 2010
Publisher
Institute of Electrical and Electronics Engineers
Citation
Pavone, Marco, and Emilio Frazzoli. “Dynamic Vehicle Routing with Stochastic Time Constraints.” 2010 IEEE International Conference on Robotics and Automation. Anchorage, AK, 2010. 1460-1467. Copyright ©2010 IEEE
Version
Final published version
Abstract
In this paper we study a dynamic vehicle routing problem where demands have stochastic deadlines on their waiting times. Specifically, a network of robotic vehicles must service demands whose time of arrival, location and on-site service are stochastic; moreover, once a demand arrives, it remains active for a stochastic amount of time, and then expires. An active demand is successfully serviced when one of the vehicles visits its location before its deadline and provide the required on-site service. The aim is to find the minimum number of vehicles needed to ensure that the steady-state probability that a demand is successfully serviced is larger than a desired value, and to determine the policy the vehicles should execute to ensure that such objective is attained. First, we carefully formulate the problem, and we show its well-posedness by providing some novel ergodic results. Second, we provide a lower bound on the optimal number of vehicles; finally, we analyze two service policies, and we show that one of them is optimal in light load. Simulation results are presented and discussed.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ROBOT.2010.5509222
