Pursuit-evasion on trees by robot teams

IEEE Transactions on Robotics

Volumn 26, Issue 1, 2010, Pages 32-47

  Kolling, Andreas ^a   Carpin, Stefano ^a  

^a University of California   (United States)

Author keywords

Distributed robot systems; Pursuit evasion games; Surveillance systems

Indexed keywords

DISTRIBUTED ROBOT SYSTEMS; INDOOR ENVIRONMENT; MULTIPLE ROBOT; NP-HARD; OPTIMAL STRATEGIES; POLYNOMIAL-TIME ALGORITHMS; PURSUIT EVASION; PURSUIT EVASION GAMES; ROBOT TEAMS; SUBTREES; SURVEILLANCE SYSTEMS;

COMPUTATIONAL COMPLEXITY; OPTIMAL SYSTEMS; OPTIMIZATION; SECURITY SYSTEMS;

ROBOTS;

EID: 76949085830     PISSN: 15523098     EISSN: None     Source Type: Journal    
DOI: 10.1109/TRO.2009.2035737     Document Type: Article

References (38)

1. A. Kolling and S. Carpin, Extracting surveillance graphs from robot maps, in Proc. IEEE/RSJ Int. Conf. Intell. Robots Syst., 2008, pp. 2323- 2328.
2. T. Parsons, Pursuit-evasion in a graph, in Theory and Application of Graphs, vol.642, Y. Alavi and D. R. Lick, Eds. Berlin/Heidelberg, Germany: Springer-Verlag, 1976, pp. 426-441.
3. L. Barriere, P. Flocchini, P. Fraigniaud, and N. Santoro, Capture of an intruder by mobile agents, in Proc. 14th Annu. ACM Symp. Parallel Algorithms Archit. New York: ACM, 2002, pp. 200-209.
4. S. Sachs, S. Rajko, and S. LaValle, Visibility-based pursuit-evasion in an unknown planar environment, Int. J. Robot. Res., vol.23, no.1, pp. 3-26, Jan. 2004.
5. A. Kolling and S. Carpin, Surveillance strategies for target detection with sweep lines, in Proc. IEEE/RSJ Int. Conf. Intell. Robots Syst., 2009, pp. 5821-5827.
6. I. Suzuki and M. Yamashita, Searching for a mobile intruder in a polygonal region, SIAM J. Comput., vol.21, no.5, pp. 863-888, 1992.
7. M. Yamashita, H. Umemoto, I. Suzuki, and T. Kameda, Searching for mobile intruders in a polygonal region by a group of mobile searchers, in Proc. Symp. Comput. Geom., 1997, pp. 448-450.
8. S. LaValle, D. Lin, L. Guibas, J. Latombe, and R. Motwani, Finding an unpredictable target in a workspace with obstacles, in Proc. IEEE Int. Conf. Robot. Autom., 1997, pp. 737-742.
9. L. J. Guibas, J.-C. Latombe, S. M. LaValle, D. Lin, and R. Motwani, A visibility-based pursuit-evasion problem, Int. J. Comput. Geom. Appl., vol.9, pp. 471-494, 1999.
10. S.-M. Park, J.-H. Lee, and K.-Y. Chwa, Visibility-based pursuit-evasion in a polygonal region by a searcher, Lect. Notes Comput. Sci., vol.2076, pp. 456-468, 2001.
11. S. M. LaValle and J. Hinrichsen, Visibility-based pursuit-evasion: The case of curved environments, IEEE Trans. Robot. Autom., vol.17, no.2, pp. 196-201, Apr. 2001.
12. S. LaValle, B. Simov, and G. Slutzki, An algorithm for searching a polygonal region with a flashlight, Int. J. Comput. Geom., vol. 12, no. 1/2, pp. 87-113, 2002.
13. L. Guilamo, B. Tovar, and S. LaValle, Pursuit-evasion in an unknown environment using gap navigation trees, in Proc. IEEE/RSJ Int. Conf. Intell. Robots Syst., Apr. 2004, vol.4, pp. 3456-3462.
14. B. Tovar, L. Guilamo, and S. M. LaValle, Gap navigation trees: Minimal representation for visibility-based tasks, in Proc. Workshop Algorithmic Found. Robot., 2004, vol.17, pp. 3855-3862.
15. B. Tovar, S. M. LaValle, and R. Murrieta., Locally-optimal navigation in multiply-connected environments without geometric maps, in Proc. IEEE/RSJ Int. Conf. Intell. Robots Syst., 2003, vol.3, pp. 3491-3497.
16. B. Simov, G. Slutzki, and S. LaValle, Clearing a polygon with two 1- searchers, Int. J. Comput. Geom. Appl., vol.19, no.1, pp. 59-92, 2009.
17. B. Tovar and S. M. LaValle, Visibility-based pursuit-evasion with bounded speed, presented at the Workshop Algorithmic Found. Robot., New York, 2006.
18. J.Yu and S. LaValle, Tracking hidden agents through shadowinformation spaces, in Proc. IEEE Int. Conf. Robot. Autom., 2008, pp. 2331-2338.
19. F.V. Fomin and D. M. Thilikos, An annotated bibliography on guaranteed graph searching, Theor. Comput. Sci., vol.399, no.3, pp. 236-245, 2008.
20. N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou, The complexity of searching a graph, J. ACM, vol.35, no.1, pp. 18-44, 1988.
21. M. R. Garey and D. S. Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
22. A. S. LaPaugh, Recontamination does not help to search a graph, J. ACM, vol.40, no.2, pp. 224-245, 1993.
23. D. Bienstock and P. Seymour, Monotonicity in graph searching, J. Algorithms, vol.12, no.2, pp. 239-245, 1991.
24. M. Kirousis and C. H. Papadimitriou, Searching and pebbling, Theor. Comput. Sci., vol.47, no.2, pp. 205-218, 1986.
25. F. V. Fomin, D. Kratsch, and H. M̈uller, On the domination search number, Discrete Appl. Math., vol.127, no.3, pp. 565-580, 2003.
26. F. Makedon and I. H. Sudborough, On minimizing width in linear layouts, Discrete Appl. Math., vol.23, no.3, pp. 243-265, 1989.
27. J. A. Ellis, I. H. Sudborough, and J. S. Turner, The vertex separation and search number of a graph, Inf. Comput., vol.113, no.1, pp. 50-79, 1994.
28. K. Skodinis, Computing optimal linear layouts of trees in linear time, in ESA 2000: Proc. 8th Annu. Eur. Symp. Algorithms. London, U.K.: Springer-Verlag, 2000, pp. 403-414.
29. L. Parker, Distributed algorithms for multi-robot observation of multiple moving targets, Auton. Robots, vol.12, pp. 231-255, 2002.
30. A. Kolling, S. Carpin, Cooperative observation of multiple moving targets: An algorithm and its formalization, Int. J. Robot. Res., vol.29, no.9, pp. 935-953, 2007.
31. B. Jung and G. S. Sukhatme, Tracking targets using multiple mobile robots: The effect of environment occlusion, Auton. Robots, vol.13, no.2, pp. 191-205, 2002.
32. M. Moors, T. R̈ohling, and D. Schulz, A probabilistic approach to coordinated multi-robot indoor surveillance, in Proc IEEE/RSJ Int. Conf. Intell. Robots Syst., 2005, pp. 3447-3452.
33. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. Boston, MA: McGraw-Hill, 2001.
34. A. Kolling and S. Carpin, The graph-clear problem: Definition, theoretical properties and its connections to multirobot aided surveillance, in Proc. IEEE/RSJ Int. Conf. Intell. Robots Syst., 2007, pp. 1003-1008.
35. V. V. Vazirani, Approximation Algorithms. New York: Springer-Verlag, 2001.
36. A. Kolling and S. Carpin, Detecting intruders in complex environments with limited range mobile sensors, in Robot Motion and Control, K. Kozlowski, Ed., Lect. Notes Control Inf. Sci., vol.360. New York: Springer- Verlag London, 2007, pp. 41-426.
37. A. Kolling and S. Carpin, Multi-robot surveillance: An improved algorithm for the graph-clear problem, in Proc. IEEE Int. Conf. Robot. Autom., 2008, pp. 2360-2365.
38. A. Kolling and S. Carpin, Probabilistic graph clear, in Proc. IEEE Int. Conf. Robot. Autom., 2009, pp. 3508-3514.