Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications
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...
Main Authors: | Savla, Ketan (Contributor), Frazzoli, Emilio (Contributor), Arsie, Alessandro (Author) |
---|---|
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,
2010-03-08T20:05:24Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications
by: Arsie, Alessandro, et al.
Published: (2011) -
Stochastic and Dynamic Routing Problems for Multiple Uninhabited Aerial Vehicles
by: Frazzoli, Emilio, et al.
Published: (2011) -
Strategic Dynamic Vehicle Routing with Spatio-Temporal Dependent Demands
by: Feijer Rovira, Diego Francisco, et al.
Published: (2013) -
Dynamic Vehicle Routing for Robotic Systems
by: Bullo, Francesco, et al.
Published: (2013) -
Game-theoretic learning algorithm for a spatial coverage problem
by: Savla, Ketan, et al.
Published: (2010)