Guaranteed strategies to search for mobile evaders in the plane
Authors:
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 07431619,p. 6 pp.
Abstract
This paper studies several problems of search in the two-dimensional plane for mobile intruders or evaders. In each case, both the searcher and evaders are assumed to have bounded velocities, with the velocity of the searcher greater than that of the evaders. The searcher has a sensor with a circular footprint which allows it to detect any evaders within the sensor radius. Unlike much of the past work done in search theory, the proposed strategies make no assumptions about the motion of the evaders, and are guaranteed to succeed for any trajectory of the evaders. The three problem formulations studied include the search for mobile targets through a linear corridor, the search for or bounding of mobile targets which start inside of a circular region, and the prevention of mobile targets from entering a circular region. The extension of the proposed strategies for multiple searchers is also discussedKeywords
This publication has 12 references indexed in Scilit:
- Pursuit-evasion strategies for teams of multiple agents with incomplete information2004
- Finding an unpredictable target in a workspace with obstacles2002
- A cooperative search framework for distributed agents2002
- The Diesel Submarine Flaming Datum ProblemMilitary Operations Research, 2001
- Two Dimensional Rendezvous SearchOperations Research, 2001
- Optimal search for a moving target - A geometric approach2000
- Successive Pursuit with a Bounded Detection DomainJournal of Optimization Theory and Applications, 1997
- Searching in the PlaneInformation and Computation, 1993
- Dynamic Search GamesOperations Research, 1991
- Search-Evasion Game in a Fixed RegionOperations Research, 1980