Stochastic and Dynamic Routing Problems for Multiple Uninhabited Aerial Vehicles

Stochastic and Dynamic Routing Problems for Multiple Uninhabited Aerial Vehicles

Consider a routing problem for a team of vehicles in the plane: target points appear randomly over time in a bounded environment and must be visited by one of the vehicles. It is desired to minimize the expected system time for the targets, i.e., the expected time elapsed between the appearance of a...

Full description

Bibliographic Details
Main Authors: Frazzoli, Emilio (Contributor), Enright, John J. (Contributor), Bullo, Francesco (Author), Savla, Ketan (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: American Institute of Aeronautics and Astronautics, 2011-01-19T17:07:52Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items