A coverage algorithm for multi-robot boundary inspection

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2005, Issue , 2005, Pages 727-734

  Easton, Kjerstin ^a   Burdick, Joel ^a  

^a California Institute of Technology   (United States)

Author keywords

Multiple robots; Planning algorithms; Robot coverage

Indexed keywords

MULTIPLE ROBOTS; PLANNING ALGORITHMS; ROBOT COVERAGE;

BOUNDARY CONDITIONS; COMPUTER SIMULATION; HEURISTIC METHODS; INSPECTION; PROBLEM SOLVING; ROBOTS; SENSORS;

ALGORITHMS;

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

References (9)

1. H. Choset, "Coverage for robotics - a survey of recent results," Annals of Mathematics and Artificial Intelligence, vol. 31, pp. 113-126, 2001.
2. Y. Zhang, E. K. Antonsson, and A. Martinoli, "Evolving neural controllers for collective robotic inspection," Proc. of the 9th Online World Conf. on Soft Computing in Industrial Applications, 2004.
3. N. Correll and A. Martinoli, "Collective inspection of regular structures using a swarm of miniature robots," Proc. of the Ninth Int. Symp. on Experimental Robotics ISER-04, 2004.
4. H. Choset and J. Burdick, "Sensor-based exploration: The hierarchical generalized voronoi graph," The International Journal of Robotics Research, vol. 19, no. 2, pp. 96-125, 2000.
5. C. S. Orloff, "A fundamental problem in vehicle routing," Networks, vol. 4, pp. 35-64, 1974.
6. D. Ahr and G. Reinelt, "New heuristics and lower bounds for the min-max k-chinese postman problem," in Algoritluns-Esa 2002, Proceedings, ser. Lecture Notes in Computer Science, 2002, vol. 2461, pp. 64-74.
7. G. N. Frederickson, M. S. Hecht, and C. E. Kim, "Approximation algorithms for some routing problems," SIAM Journal on Computing, vol. 7, no. 2, pp. 178-193, 1978.
8. T. F. Gonzalez, "Clustering to minimize the maximum intercluster distance," Theoretical Computer Science, vol. 38, no. 2-3, pp. 293-306, 1985.
9. J. Edmonds and E. L. Johnson, "Matching, euler tours, and the chinese postman," Mathematical Programming, vol. 5, pp. 88-124, 1973.