MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications

Author(s)
Arsie, Alessandro; Savla, Ketan; Frazzoli, Emilio
Thumbnail
DownloadFrazzoli-2009-Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications.pdf (838.9Kb)
PUBLISHER_POLICY

Publisher Policy

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.

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.
Metadata
Show full item record
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.
Date issued
2009-09
URI
http://hdl.handle.net/1721.1/65574
Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Journal
IEEE transactions on automatic control
Publisher
Institute of Electrical and Electronics Engineers / IEEE Control Systems Society
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
Version: Final published version
Other identifiers
INSPEC Accession Number: 10917892
ISSN
0018-9286

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.