Game-theoretic learning algorithm for a spatial coverage problem
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 appea...
Main Authors: | 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,
2010-12-17T16:38:31Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Traveling salesperson problems for a double integrator
by: Savla, Ketan, et al.
Published: (2010) -
Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications
by: Savla, Ketan, et al.
Published: (2010) -
Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications
by: Arsie, Alessandro, et al.
Published: (2011) -
Maximally Stabilizing Task Release Control Policy for a Dynamical Queue
by: Savla, Ketan, et al.
Published: (2011) -
A Dynamical Queue Approach to Intelligent Task Management for Human Operators
by: Frazzoli, Emilio, et al.
Published: (2013)