Probabilistic graph-clear

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2009, Pages 3508-3514

  Kolling, Andreas ^a   Carpin, Stefano ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AS GRAPH; DETERMINISTIC APPROACH; FAILURE RATE; FALSE NEGATIVES; FAULTY SENSOR; MULTIROBOTS; NEW DESIGN; PROBABILISTIC EXTENSION; PROBABILISTIC GRAPHS; PROBABILISTIC MODELS; ROBOT TEAMS; SENSING RANGES; SURVEILLANCE APPLICATIONS; SURVEILLANCE TASK;

MACHINE DESIGN; ROBOTICS; SENSORS;

ROBOTS;

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

References (14)

1. M. Adler, H. Racke, N. Sivadasan, C. Sohler, and B. Vocking. Randomized pursuit-evasion in graphs. In Proceedings of the International Colloquium on Automata, Languages and Programming, 2002.
2. V. Isler, S. Kannan, and S. Khanna. Randomized pursuit-evasion in a polygonal environment. In IEEE Transactions on Robotics, volume 21, pages 875 - 884, 2005.
3. V. Isler, S. Kannan, and S. Khanna. Randomized pursuit-evasion with local visibility. SIAM J. Discret. Math., 20(1):26-41, 2006.
4. A. Kolling and S. Carpin. The graph-clear problem: definition, theoretical properties and its connections to multirobot aided surveillance. In Proc. of IEEE/RSJ Intl. Conf. On Int. Robots and Systems, pages 1003-1008, 2007.
5. A. Kolling and S. Carpin. Extracting surveillance graphs from robot maps. In Proc. of IEEE/RSJ Intl. Conf. On Int. Robots and Systems, pages 2323-2328, 2008.
6. A. Kolling and S. Carpin. Multi-robot surveillance: an improved algorithm for the graph-clear problem. In Proc. IEEE Intl. Conf. on Robotics and Automation, pages 2360-2365, 2008.
7. A. S. LaPaugh. Recontamination does not help to search a graph. J. ACM, 40(2):224-245, 1993.
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. on Robotics and Automation, pages 737-742, 1997.
9. 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, 1988.
10. M. Moors, T. Röhling, and D. Schulz. A probabilistic approach to coordinated multi-robot indoor surveillance. In Proc IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pages 3447-3452, 2005.
11. T.D. Parsons. Pursuit-evasion in a graph. In Y. Alavi and D. R. Lick, editors, Theory and Appl. of Graphs, volume 642, pages 426-441. Springer Berlin/Heidelberg, 1976.
12. S. Sachs, S. Rajko, and S. M. LaValle. Visibility-based pursuit-evasion in an unknown planar environment. Int. J. Robotics Research, 23(1):3- 26, January 2004.
13. I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. on Computing, 21(5):863-888, 1992.
14. R. Vidal, O. Shakernia, H. Kin, D. Shim, and S. Sastry. Probabilistic pursuit-evasion games: theory, implementation and experimental evaluation. IEEE Transactions on Robotics and Automation, 18(5):662- 669, 2002.