A general index heuristic for search with mobile agents

This dissertation considers a suite of search problems in which agents are trying to find goals in minimum expected time. Unlike search in data structures in which time is measured by a number operations, search in metric spaces measures time by units of distance and has received much less attention. In particular, search strategies that attempt to minimize expected search time are only available for a handful of relatively simple cases. Nonetheless many relevant search problems take place in metric spaces. This dissertation includes several concrete examples from navigation and surveillance that would have previously only been approachable by much more ad hoc methods. We visit these examples along the way to establishing relevance to a much larger set of problems. We present a policy that is an extension of Whittle's index heuristic and is applicable under the following assumptions. * The location of goals are independent random variables. " The agents and goals are in a length space, i.e., a metric space with continuous paths. * The agents move along continuous paths with bounded speed. " The agents' sensing is noiseless. We demonstrate the performance of our policy by applying it to a diverse set of problems for which solutions are available in the literature. We treat each of the following problems as a special case of a more general search problem: " search in one-dimensional spaces such as the Line Search Problem (LSP) and Cow Path Problem (CPP), " search in two-dimensional spaces such as the Lost in a Forest Problem (LFP) and problems of coverage, " problems in networks such as the Graph Search Problem (GSP) and Minimum Latency Tour Problem (MLTP), and " dynamic problems such as the Persistent Patrol Problem (PPP) and Dynamic Traveling Repairperson Problem (DTRP). On each of these we find that our policy performs comparably to, and occasionally better than, the accepted solutions developed specifically for these problems. As a result, we believe that this dissertation contributes a significant inroad into a large space of search problems that meets our assumptions, but that remains unaddressed.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2011

Author dc:creator

• Temple, Thomas J. (Thomas John)

Advisor dc:contributor.advisor

• Brian Williams and Anouck Girard.

• Aeronautics and Astronautics.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/67175

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/67175