Algorithms and complexity results for pursuit-evasion problems

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 59-66

  Borie, Richard ^a   Tovey, Craig ^b   Koenig, Sven ^c  

^a UNIVERSITY OF ALABAMA   (United States)

^b Georgia Institute of Technology   (United States)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; TOPOLOGY; TREES (MATHEMATICS);

ALGORITHMS AND COMPLEXITY; POLYNOMIAL-TIME ALGORITHMS; PURSUIT EVASION PROBLEM; STATE-OF-THE-ART ALGORITHMS; TASK COMPLETION TIME; THEORETICAL FOUNDATIONS; THEORETICAL RESEARCH; TRAVEL DISTANCE;

COMPUTATIONAL COMPLEXITY;

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

References (15)

1. N. Agmon, S. Kraus, and G. A. Kaminka. Multi-robot perimeter patrol in adversarial settings. Proceedings of IEEE International Conference on Robotics and Automation, 2008.
2. N. Agmon, V. Sadov, S. Kraus, and G. A. Kaminka. The impact of adversarial knowledge on adversarial planning in perimeter patrol. Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems, 2008.
3. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12(2):308-340, 1991.
4. D. Bienstock and P.D. Seymour. Monotonicity in graph searching. Journal of Algorithms, 12(2):239-245, 1991.
5. R.B. Borie, R.G. Parker, and C.A. Tovey. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7(1-6):555-581, 1992.
6. B. Courcelle and M. Mosbah. Monadic second-order evaluations on tree-decomposable graphs. Theoretical Computer Science, 109(1-2):49-82, 1993.
7. J. Ellis and R. Warren. Lower bounds on the pathwidth of some grid-like graphs. Discrete Applied Mathematics, 156(5):545-555, 2008.
8. M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman and Company, New York, 1979.
9. L.M. Kirousis and C.H. Papadimitriou. Interval graphs and searching. Discrete Mathematics, 55(2):181-184, 1985.
10. L.M. Kirousis and C.H. Papadimitriou. Searching and pebbling. Theoretical Computer Science, 47(2):205-218, 1986.
11. A.S. LaPaugh. Recontamination does not help to search a graph. Journal of the ACM, 40(2):224-245, 1993.
12. N. Megiddo, S.L. Hakimi, M.R. Garey, D.S. Johnson, and C.H. Papadimitriou. The complexity of searching a graph. Journal of the ACM, 35(1):18-44, 1988.
13. T.D. Parsons. Pursuit-evasion in a graph. In Y. Alavi and D. Lick, editors, Theory and Applications of Graphs, Lecture Notes in Mathematics, pages 426-441. Springer Verlag, 1976.
14. J. Pita, M. Jain, J. Marecki, F. Ordonez, C. Portway, M. Tambe, C. Western, P. Paruchuri, and S. Kraus. Deployed armor protection: The application of a game theoretic model for security at the Los Angeles international airport. Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems, 2008.
15. R. Vidal, O. Shakernia, H.J.Kim, D.H.Shim, and S. Sastry. Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation. IEEE Transactions on Robotics and Automation, 18(5):662-669, 2002.