dc.contributor.author | Pavone, Marco | |
dc.contributor.author | Frazzoli, Emilio | |
dc.date.accessioned | 2011-08-25T16:12:07Z | |
dc.date.available | 2011-08-25T16:12:07Z | |
dc.date.issued | 2010-05 | |
dc.identifier.issn | 1050-4729 | |
dc.identifier.other | INSPEC Accession Number: 11430910 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/65357 | |
dc.description.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. | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant no. 0705451) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant no. 0705453) | en_US |
dc.language.iso | en_US | |
dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/ROBOT.2010.5509222 | en_US |
dc.rights | 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. | en_US |
dc.source | IEEE | en_US |
dc.title | Dynamic Vehicle Routing with Stochastic Time Constraints | en_US |
dc.type | Article | en_US |
dc.identifier.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 | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems | en_US |
dc.contributor.approver | Frazzoli, Emilio | |
dc.contributor.mitauthor | Pavone, Marco | |
dc.contributor.mitauthor | Frazzoli, Emilio | |
dc.relation.journal | IEEE International Conference on Robotics and Automation (ICRA) 2010 | en_US |
dc.eprint.version | Final published version | en_US |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
dspace.orderedauthors | Pavone, Marco; Frazzoli, Emilio | en |
dc.identifier.orcid | https://orcid.org/0000-0002-0505-1400 | |
mit.license | PUBLISHER_POLICY | en_US |
mit.metadata.status | Complete | |