Accession Number:

AD1004475

Title:

Multi-UAV Dynamic Routing with Partial Observations using Restless Bandit Allocation Indices

Descriptive Note:

Technical Report

Corporate Author:

Massachusetts Institute of Technology Cambridge United States

Personal Author(s):

Report Date:

2007-10-01

Pagination or Media Count:

6.0

Abstract:

Motivated by the type of missions currently performed by unmanned aerial vehicles, we investigate a discrete dynamic vehicle routing problem with a potentially large number of targets and vehicles. Each target is modeled as an independent two-state Markov chain, whose state is not observed if the target is not visited by some vehicle. The goal for the vehicles is to collect rewards obtained when they visit the targets in a particular state. This problem can be seen as a type of restless bandits problem with partial information. We compute an upper bound on the achievable performance and obtain in closed form an index policy proposed by Whittle. Simulation results provide evidence for the outstanding performance of this index heuristic and for the quality of the upper bound.

Subject Categories:

Distribution Statement:

APPROVED FOR PUBLIC RELEASE