Show simple item record

dc.contributor.authorArsie, Alessandro
dc.contributor.authorSavla, Ketan
dc.contributor.authorFrazzoli, Emilio
dc.date.accessioned2011-08-31T18:03:10Z
dc.date.available2011-08-31T18:03:10Z
dc.date.issued2009-09
dc.date.submitted2009-01
dc.identifier.issn0018-9286
dc.identifier.otherINSPEC Accession Number: 10917892
dc.identifier.urihttp://hdl.handle.net/1721.1/65574
dc.description.abstractIn 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.sponsorshipNational Science Foundation (U.S.) (Grant 0325716)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant 0715025)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant 0705451)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant 0705453)en_US
dc.description.sponsorshipUnited States. Air Force Office of Scientific Research (Grant F49620–02-1–0325)en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineers / IEEE Control Systems Societyen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/tac.2009.2028954en_US
dc.rightsArticle 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.sourceIEEEen_US
dc.titleEfficient Routing Algorithms for Multiple Vehicles With no Explicit Communicationsen_US
dc.typeArticleen_US
dc.identifier.citationArsie, 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, IEEEen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Aeronautics and Astronauticsen_US
dc.contributor.departmentMassachusetts Institute of Technology. Laboratory for Information and Decision Systemsen_US
dc.contributor.approverFrazzoli, Emilio
dc.contributor.mitauthorSavla, Ketan
dc.contributor.mitauthorFrazzoli, Emilio
dc.relation.journalIEEE transactions on automatic controlen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsArsie, A.; Savla, K.; Frazzoli, E.en
dc.identifier.orcidhttps://orcid.org/0000-0002-0505-1400
mit.licensePUBLISHER_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record