Randomized Pursuit-Evasion with Limited Visibility

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 1053-1062

  Isler, Volkan ^a   Kannan, Sampath ^a   Khanna, Sanjeev ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; COMPUTER SCIENCE; COMPUTER SIMULATION; GRAPH THEORY; INFORMATION ANALYSIS; POLYNOMIALS; PROBABILITY; ROBOTICS;

HUNTERS; PURSUIT-EVASION GAME;

GAME THEORY;

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

References (18)

1. M. Adler, H. Räcke, N. Sivadasan, C. Sohler, and B. Vöcking. Randomized pursuit-evasion in graphs. Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2002.
2. M. Aigner and M. Fromme. A game of cops and robbers. Discrete Applied Math, 8:1-12, 1984.
3. T. Basar and P. R. Kumar. On worst case design strategies. Computers and Mathematics with Applications: Special Issue on Pursuit-Evasion Differential Games, 13(1-3):239-245, 1987.
4. T. Basar and G. J. Olsder. Dynamic Noncooperative Game Theory. SIAM, 1998.
5. P. Bernhard, A.-L. Colomb, and G. P. Papavassilopoulos. Rabbit and hunter game: two discrete stochastic formulations. Comput. Math. Appl., 13(1-3):205-225, 1987.
6. G. Brightwell and P. Winkler. Gibbs measures and dismantlable graphs. J. Comb. Theory (Series B), 78, 2000.
7. J. A. Ellis, I. H. Sudborough, and J. S. Turner. The vertex separation and search number of a graph. Information and Computation, 113(1):50-79, 1994.
8. S. Fitzpatrick and R. Nowakowski. Copnumber of graphs with strong isometric dimension two. ARS COMBINATORIA, 59:65-73, 2001.
9. L. J. Guibas, J.-C. Latombe, S. M. LaValle, D. Lin, and R. Motwani. A visibility-based pursuit-evasion problem. International Journal of Computational Geometry and Applications, 9(4/5):471-, 1999.
10. J. P. Hespanha, G. J. Pappas, and M. Prandini. Greedy control for hybrid pursuit-evasion games. In Proceedings of the European Control Conference, pages 2621-2626, Porto, Portugal, September 2001.
11. I.Chatzigiannakis, S.Nikoletseas, and P.Spirakis. An efficient communication strategy for ad-hoc mobile networks. In Proc. of 15th Symposium on Distributed Computing (DISC'2001), pages 285-299, 2001.
12. A. S. LaPaugh. Recontamination does not help to search a graph. J. ACM, 40:224-245, 1993.
13. N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou. The complexity of searching a graph. J. ACM, 1988.
14. S. Neufeld and R. Nowakowski. A game of cops and robbers played on products of graphs. DISCRETE MATHEMATICS, 186:253-268, 1998.
15. R. Nowakawski and P. Winkler. Vertex-to-vertex pursuit in a graph. Discrete Math, 43:235-239, 1983.
16. S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal region by a searcher. Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2076, 2001.
17. T. D. Parsons. Pursuit evasion in a graph. In Y. Alavi and D. R. Lick, editors, Theory and Application of Graphs, pages 426-441. Springer Verlag, 1976.
18. R. Vidal, O. Shakernia, J. Kim, D. Shim, and S. Sastry. Probabilistic pursuit-evasion games: Theory, implementation and experimental evaluation. IEEE Transactions on Robotics and Automation, 18:662-669, 2002.