Finding a moving fugitive. A game theoretic representation of search
MetadataShow full item record
We develop and analyze a “manhunting” game involving a mobile hider, who wishes to maximize his time to capture, and a mobile searcher, who wishes to minimize this same time. The game takes place within a variegated environment that offers better and worse locations to evade capture. The hider is able to move from one hide site to another at will. In choosing a hide site, he must consider the risk of discovery, the risk that he will be betrayed, and the risk that he will be captured while moving from one site to another. The searcher can select any cell to search within the fugitive’s feasible hiding set. We examine the strategic behavior of both players and provide examples. Published by Elsevier Ltd.
The article of record as published may be found at http://dx.doi.org/10.1016/j.cor.2006.09.020
Showing items related by title, author, creator and subject.
Harney, Sean M. (Monterey, California: Naval Postgraduate School, 2017-06);Cartels are known for their innovative smuggling techniques, across land, sea, or air, which allow them to clandestinely transport drugs across any point of entry into the United States. With this in mind, it is worth ...
Mundell, David J. (Monterey, California: Naval Postgraduate School, 2016-03);The Military Leadership Diversity Commission of 2011 and top Navy leaders have stressed the importance of achieving gender integration in the military, making it one of Navy’s top priorities. This study examines the promotion ...
Karamanlis, Vasilios (Monterey, California. Naval Postgraduate School, 1997-03);A problem of motion control in robot motion planning is to find a smooth transition while going from one path to another. The key concept of our theory is the steering function, used to manipulate the motion of our vehicle. ...