2026-09-19T00:23:20Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/332132022-01-13T07:54:11Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Eric Feron.
Joseph, Farmey A. (Farmey Augustine)
Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
2006-06-20T12:56:56Z
2006-06-20T12:56:56Z
2005
2005
http://hdl.handle.net/1721.1/33213
67837015
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2005.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 71-72).
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.
by Farmey A. Joseph.
S.M.
72 p.
435237 bytes
430825 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Aeronautics and Astronautics.
Path-planning strategies for ambush avoidance
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="68b383a8-34a7-464d-80e6-f6b2b91a37a5">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Path-planning strategies for ambush avoidance</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2005</PublicationDate>
<Authors>
<Author>
<DisplayName>Joseph, Farmey A. (Farmey Augustine)</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Aeronautics and Astronautics.</Keyword>
<Abstract>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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>