Multi-robot surveillance: An improved algorithm for the GRAPH-CLEAR problem

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2008, Pages 2360-2365

  Kolling, Andreas ^a   Carpin, Stefano ^a  

^a Merced   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; GRAPH THEORY; INDUSTRIAL ENGINEERING; INDUSTRIAL ROBOTS; MULTIPURPOSE ROBOTS; NUCLEAR PROPULSION; ROBOTICS;

IMPROVED ALGORITHM; INTERNATIONAL CONFERENCES; MULTI ROBOTS;

SET THEORY;

EID: 51649118423     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2008.4543566     Document Type: Conference Paper

References (14)

1. L. Barriere, P. Flocchini, P. Fraigniaud, and N. Santoro. Capture of and intruder by mobile agents. In Proceedings of the 14th annual ACM symposium on Parallel algorithms and architectures, pages 200-209, 2002.
2. M.R Garey and D.S. Johnson. Computers and Intractability. A guide to the theory of NP-Completeness. W.H. Freeman and Company, 1979.
3. B. Gerkey, S. Thrun, and G. Gordon. Visibility-based pursuit-evasion with limited field of view. International Journal of Robotics Research, 25(4):299-316, 2006.
4. 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-494, 1999.
5. A. Kolling and S. Carpin. Multirobot cooperation for surveillance of multiple moving targets - a new behavioral approach. In Proceeding of the IEEE International Conference on Robotics and Automation, pages 1311-1316, 2006.
6. A. Kolling and S. Carpin. Cooperative observation of multiple moving targets: an algorithm and its formalization. International Journal of Robotics Research, 26(9):935-953, 2007.
7. A. Kolling and S. Carpin. Detecting intruders in complex environments with limited range mobile sensors. In K. Kowzlowski, editor, Robot Motion and Control 2007, Lecture Notes in Information and Control, pages 417-426. Springer, 2007.
8. A. Kolling and S. Carpin. The graph-clear problem: definition, theoretical properties and its connections to multirobot aided surveillance. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, pages 1003-1008, 2007.
9. A. Kolling and S. Carpin. An improved algorithm for the GRAPH-SEARCH problem. Technical Report 2007-3, UC Merced, 2007.
10. 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.
11. L. E. Parker. Distributed algorithms for multi-robot observation of multiple moving targets. Autonomous robots, 12(3):231-255, 2002.
12. T. Parsons. Pursuit-evasion in a graph. In Y. Alavi and D. Lick, editors, Theory and Applications of Graphs. Springer-Verlag, 1976.
13. S. Sachs, S. Rajko, and S. M. LaValle. Visibility-based pursuit-evasion in an unknown planar environment. International Journal of Robotics Research, 23(1):3-26, 2004.
14. I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal of Computing, 21(5):863-888, 1992.