Pursuit-evasion using beam detection

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2, Issue , 2000, Pages 1657-1662

  Simov, Borislav H ^a   Slutzki, Giora ^a   LaValle, Steven M ^a  

^a IOWA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEAM DETECTION; DIFFERENTIAL MOTION MODELS; HOMICIDAL CHAUFFEUR PROBLEM; PURSUIT EVASION SCENARIOS; UNPREDICTABLE MOVING TARGET;

COMPUTATIONAL GEOMETRY; GRAPH THEORY; MATHEMATICAL MODELS; MOBILE ROBOTS; MOTION CONTROL; MOTION PLANNING; ROBOTICS;

ALGORITHMS;

EID: 0033705183     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. D. Bienstock and P. Seymour. Monotonicity in graph searching. J. Algorithms, 12:239-245, 1991.
2. D. Crass, I. Suzuki, and M. Yamashita. Searching for a mobile intruder in a corridor - the open edge variant of the polygon search problem. Int. J. Comput. Gtom. & Appl., 5(4):397-412, 1995.
3. P.C. Heffernan. An optimal algorithm for the two-guard problem. In Proc. ACM Symp. Comp. Gtom., pp. 348-358, 1993.
4. C. Icking and R. Klein. The two guards problem. In Proc. ACM Symp. Comp. Gtom., pp. 166-175, 1991.
5. R. Isaacs. Differential Games. Wiley, New York, 1965.
6. A. S. Lapaugh. Recontamination does not help to search a graph. J. ACM, 40(2):224-245, April 1993.
7. S. M. LaValle and J. Hinrichsen. Visibility-based pursuit-evasion: An extension to curved environments. In Proc. IEEE ICRA'1999, pp. 1677-1682, 1999.
8. S. M. LaValle, D. Lin, L. J. Guibas, J.-C. Latombe, and R. Motwani. Finding an unpredictable target in a workspace with obstacles. In Proc. IEEE ICRA '1997, pp. 737-742, 1997.
9. J.H. Lee, S.M. Park, and K.Y. Chwa. Searching a polygonal room with a door by a 1-searcher. Manuscript, 1999.
10. F. Makedon and I. H. Sudborough. Minimizing width in linear layouts. In Proc. 10th ICALP, LNCS 154, pp. 478-490, 1983.
11. N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou. The complexity of searching a graph. J. ACM, 35(1):18-44, January 1988.
12. B. Monien and I. H. Sudborough. Min cut is NP-complete for edge weighted graphs. Theoretical Computer Science, 58:209-229, 1988.
13. T. D. Parsons. Pursuit-evasion in a graph. In Y. Alavi and D. R. Lick, editors, Theory and Application of Graphs, pp. 426-441. Springer-Verlag, Berlin, 1976.
14. J. T. Schwartz and M. Sharir. On the piano movers' problem: II. General techniqies for computing topological properties of algebraic manifolds. Communications on Pure and Applied Mathematics, 36:345-398, 1983.
15. I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. Computing, 21(5):863-888, October 1992.