Optimal coverage of a known arbitrary environment

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2010, Pages 5525-5530

  Mannadiar, Raphael ^a   Rekleitis, Ioannis ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY ENVIRONMENT; CELL COVERAGE; CHINESE POSTMAN PROBLEM; CLASSICAL SOLUTIONS; ENTRY POINT; EULER TOUR; FREE SPACE; OPTIMAL COVERAGE; OPTIMAL PATHS; OPTIMAL SOLUTIONS; PROOF OF CORRECTNESS; REEB GRAPH;

OPTIMIZATION; ROBOTS;

ROBOTICS;

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

References (26)

1. V. J. Lumelsky, S. Mukhopadhyay, and K. Sun, "Dynamic path planning in sensor-based terrain acquisition," IEEE Transactions on Robotics and Automation, vol. 6, no. 4, pp. 462-472, Aug. 1990.
2. I. Rekleitis, V. Lee-Shue, A. P. New, and H. Choset, "Limited communication, multi-robot team based coverage," in Proc. of the 2004 IEEE Int. Conf. on Robotics and Automation, 2004.
3. H. Choset and P. Pignon, "Coverage path planning: The boustrophedon cellular decomposition," in Proc. of the Int. Conf. on Field and Service Robotics, Canberra, Australia, 1997.
4. E. U. Acar and H. Choset, "Sensor-based coverage of unknown environments: Incremental construction of morse decompositions," The Int. Journal of Robotics Research, vol. 21, no. 4, pp. 345-366, April 2002.
5. Z. Butler, "CC R : A complete algorithm for contact-sensor based coverage of rectilinear environments," The Robotics Institute, Carnegie Mellon University, Tech. Rep. CMU-RI-TR-98-27, 1998.
6. W. Huang, "Optimal line-sweep-based decompositions for coverage algorithms," in Proc. the IEEE Int. Conf. on Robotics and Automation, vol. 1, 2001, pp. 27-32.
7. Z. Yao, "Finding efficient robot path for the complete coverage of a known space," in Proc. of the IEEE Int. Conf. on Robotics and Automation, Beijing, China, 2006, pp. 3369-3374.
8. J. W. Kang, S. J. Kim, M. J. Chung, H. Myung, J. H. Park, and S. W. Bang, "Path planning for complete and efficient coverage operation of mobile robots," in Proc. of the IEEE Int. Conf. on Mechatronics and Automation, 5-8 Aug. 2007, pp. 2126 - 2131.
9. Y. Gabriely and E. Rimon, "Spanning-tree based coverage of continuous areas by a mobile robot," in Proc. of the 2001 IEEE Int. Conf. on Robotics and Automation, 2001.
10. -, "Spiral-stc: an on-line coverage algorithm of grid environments by a mobile robot," in Proc. of the IEEE Int. Conf. on Robotics and Automation, vol. 1, 11-15 May 2002, pp. 954 - 960.
11. X. Zheng, S. Jain, S. Koenig, and D. Kempe, "Multi-robot forest coverage," in Proc. of the IEEE Int. Conf. on Intelligent Robots and Systems (IROS), Edmonton Alberta, Canada, Aug. 2005, pp. 3852-3857.
12. J. Cortes, S. Martinez, T. Karatas, and F. Bullo, "Coverage control for mobile sensing networks," IEEE Transactions on Robotics, vol. 20, no. 2, pp. 243-255, 2004.
13. S. Martinez, J. Cortes, and F. Bullo, "Motion coordination with distributed information," IEEE Control Systems Magazine, vol. 27, no. 4, pp. 75-88, 2007.
14. A. Howard, M. J. Matarić, and G. S. Sukhatme, "Mobile sensor network deployment using potential fields: A distributed, scalable solution to the area coverage problem," in Proc. of the Int. Symposium on Distributed Autonomous Robotic Systems, 2002, pp. 299-308.
15. M. Schwager, J. J. Slotine, and D. Rus, "Unifying geometric, probabilistic, and potential field approaches to multi-robot coverage control," in Proc. of the Int. Symposium on Robotics Research (ISRR 09), Lucerne, Switzerland, August 2009.
16. P. Jimenez, B. Shirinzadeh, A. Nicholson, and G. Alici, "Optimal area covering using genetic algorithms," in Proc. of the IEEE/ASME Int. Conf. on Advanced Intelligent Mechatronics, 2007, pp. 1-5.
17. M. Weiss-Cohen, I. Sirotin, and E. Rave, "Lawn mowing system for known areas," in Proc. of the Int. Conf. on Computational Intelligence for Modelling Control and Automation, 2008, pp. 539-544.
18. K. Easton and J. Burdick, "A coverage algorithm for multi-robot boundary inspection," in Proc. of the IEEE Int. Conf. on Robotics and Automation, 18-22 April 2005, pp. 727-734.
19. H. Choset, "Coverage for robotics - a survey of recent results," Annals of Mathematics and Artificial Intelligence, vol. 31, pp. 113-126, 2001.
20. I. M. Rekleitis, A. P. New, E. S. Rankin, and H. Choset, "Efficient multi-robot coverage: An algorithmic approach," Annals of Mathematics and Artificial Intelligence, vol. 52, no. 2-4, pp. 109-142, Apr. 2008.
21. E. U. Acar, H. Choset, A. A. Rizzi, P. N. Atkar, and D. Hull, "Morse decompositions for coverage tasks," The Int. Journal of Robotics Research, vol. 21, no. 4, pp. 331-344, April 2002.
22. D. Meger, I. Rekleitis, and G. Dudek, "Heuristic search planning to reduce exploration uncertainty," in Proc. of the IEEE/RSJ Int. Conf. on Intelligent Robots and Systems (IROS), 2008, pp. 3382-3399.
23. I. M. Rekleitis, G. Dudek, and E. Milios, "Multi-robot collaboration for robust exploration," Annals of Mathematics and Artificial Intelligence, vol. 31, no. 1-4, pp. 7-40, 2001.
24. H. Choset and J. Burdick, "Sensor based planning, part ii: Incremental construction of the generalized voronoi graph," in Proc. of the IEEE Conf. on Robotics and Automation. Nagoya, Japan: IEEE Press, May 1995, pp. 1643-1648.
25. H. Choset, "Coverage of known spaces: The boustrophedon cellular decomposition," Autonomous Robots, vol. 9, pp. 247-253, 2000.
26. J. Edmonds and E. L. Johnson, "Matching, euler tours and the chinese postman," Mathematical Programming, vol. 5, pp. 88-124, 1973.