Path-planning strategies for ambush avoidance

This thesis examines a variety of ambush games in which one player must navigate between an origin and a destination, and the other player seeks to intercept and ambush him. These games include single-stage games, in which all decisions are made at the outset of the game, and multi-stage games, in which the second player may choose his ambush locations based on real-time updates of the first player's position. For both types of ambush games, methods are presented for efficiently computing the optimal mixed strategies for the first player to navigate between the origin and destination, so as to minimize the probability of being ambushed. The results are applicable to a wide range of real-life situations, including the routing of VIPs and convoys through hostile areas.

Department dc:contributor.department

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

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2005

Author dc:creator

• Joseph, Farmey A. (Farmey Augustine)

Advisor dc:contributor.advisor

• Eric Feron.

• 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/33213

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/33213