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: Savla, Ketan, Frazzoli, Emilio, Arsie, Alessandro
Other Authors: Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers 2010
Subjects:
spatial games
multi-agent systems
facility location
Dynamic vehicle routing
Online Access:http://hdl.handle.net/1721.1/52393
https://orcid.org/0000-0002-0505-1400

Internet

http://hdl.handle.net/1721.1/52393
https://orcid.org/0000-0002-0505-1400

Similar Items