Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications

Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications

Show other versions (1)

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 appe...

Full description

Bibliographic Details
Main Authors: Arsie, Alessandro (Author), Savla, Ketan (Contributor), Frazzoli, Emilio (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Aeronautics and Astronautics (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers / IEEE Control Systems Society, 2011-08-31T18:03:10Z.
Subjects:
Article
Online Access:Get fulltext
Description
Summary: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.
National Science Foundation (U.S.) (Grant 0325716)
National Science Foundation (U.S.) (Grant 0715025)
National Science Foundation (U.S.) (Grant 0705451)
National Science Foundation (U.S.) (Grant 0705453)
United States. Air Force Office of Scientific Research (Grant F49620-02-1-0325)

Similar Items