dc.contributor.author | Arsie, Alessandro | |
dc.contributor.author | Savla, Ketan | |
dc.contributor.author | Frazzoli, Emilio | |
dc.date.accessioned | 2011-08-31T18:03:10Z | |
dc.date.available | 2011-08-31T18:03:10Z | |
dc.date.issued | 2009-09 | |
dc.date.submitted | 2009-01 | |
dc.identifier.issn | 0018-9286 | |
dc.identifier.other | INSPEC Accession Number: 10917892 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/65574 | |
dc.description.abstract | In this paper, we consider a class of dynamic vehicle
routing problems, in which a number of mobile agents in the plane
must visit target points generated over time by a stochastic process.
It is desired to design motion coordination strategies in order to
minimize the expected time between the appearance of a target
point and the time it is visited by one of the agents. We propose
control strategies that, while making minimal or no assumptions on
communications between agents, provide the same level of steadystate
performance achieved by the best known decentralized strategies.
In other words, we demonstrate that inter-agent communication
does not improve the efficiency of such systems, but merely
affects the rate of convergence to the steady state. Furthermore,
the proposed strategies do not rely on the knowledge of the details
of the underlying stochastic process. Finally, we show that our proposed
strategies yield an efficient, pure Nash equilibrium in a game
theoretic formulation of the problem, in which each agent’s objective
is to maximize the expected value of the “time spent alone”
at the next target location. Simulation results are presented and
discussed. | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant 0325716) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant 0715025) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant 0705451) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant 0705453) | en_US |
dc.description.sponsorship | United States. Air Force Office of Scientific Research (Grant F49620–02-1–0325) | en_US |
dc.language.iso | en_US | |
dc.publisher | Institute of Electrical and Electronics Engineers / IEEE Control Systems Society | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/tac.2009.2028954 | 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 | Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Arsie, A., K. Savla, and E. Frazzoli. “Efficient Routing Algorithms for Multiple Vehicles With No Explicit Communications.” Automatic Control, IEEE Transactions On 54.10 (2009) : 2302-2317. Copyright © 2009, 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 | Savla, Ketan | |
dc.contributor.mitauthor | Frazzoli, Emilio | |
dc.relation.journal | IEEE transactions on automatic control | en_US |
dc.eprint.version | Final published version | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dspace.orderedauthors | Arsie, A.; Savla, K.; Frazzoli, E. | en |
dc.identifier.orcid | https://orcid.org/0000-0002-0505-1400 | |
mit.license | PUBLISHER_POLICY | en_US |
mit.metadata.status | Complete | |