Path-planning strategies for ambush avoidance
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2005.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/33213 |
| _version_ | 1826200549081481216 |
|---|---|
| author | Joseph, Farmey A. (Farmey Augustine) |
| author2 | Eric Feron. |
| author_facet | Eric Feron. Joseph, Farmey A. (Farmey Augustine) |
| author_sort | Joseph, Farmey A. (Farmey Augustine) |
| collection | MIT |
| description | Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2005. |
| first_indexed | 2024-09-23T11:38:06Z |
| format | Thesis |
| id | mit-1721.1/33213 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T11:38:06Z |
| publishDate | 2006 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/332132019-04-12T21:48:36Z Path-planning strategies for ambush avoidance Joseph, Farmey A. (Farmey Augustine) Eric Feron. Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics. Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics. Aeronautics and Astronautics. 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. 2006-06-20T12:56:56Z 2006-06-20T12:56:56Z 2005 2005 Thesis http://hdl.handle.net/1721.1/33213 67837015 eng 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 72 p. 435237 bytes 430825 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Aeronautics and Astronautics. Joseph, Farmey A. (Farmey Augustine) Path-planning strategies for ambush avoidance |
| title | Path-planning strategies for ambush avoidance |
| title_full | Path-planning strategies for ambush avoidance |
| title_fullStr | Path-planning strategies for ambush avoidance |
| title_full_unstemmed | Path-planning strategies for ambush avoidance |
| title_short | Path-planning strategies for ambush avoidance |
| title_sort | path planning strategies for ambush avoidance |
| topic | Aeronautics and Astronautics. |
| url | http://hdl.handle.net/1721.1/33213 |
| work_keys_str_mv | AT josephfarmeyafarmeyaugustine pathplanningstrategiesforambushavoidance |