Multi-robot boundary coverage with plan revision

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2006, Issue , 2006, Pages 1716-1723

  Williams, Kjerstin ^a   Burdick, Joel ^a  

^a California Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; COMPUTATIONAL COMPLEXITY; MOTION PLANNING; PROBLEM SOLVING; ROBOTICS;

BOUNDARY COVERAGE PROBLEM; MULTI-ROBOTS; PATH REVISION ALGORITHM;

MOBILE ROBOTS;

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

References (10)

1. K. Easton and J. Burdick, "A coverage algorithm for multi-robot boundary inspection," Proc. 2005 IEEE International Conference on Robotics and Automation, 2005.
2. N. Correll and A. Martinoli, "Modeling and analysis of beaconless and beacon-based policies for a swarm-intelligent inspection system," Proc. 2005 IEEE International Conference on Robotics and Automation, 2005.
3. _, "Collective inspection of regular structures using a swarm of miniature robots," Proc. of the Ninth Int. Symp. on Experimental Robotics ISER-04, 2004.
4. 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.
5. H. Choset, "Coverage for robotics - a survey of recent results," Annals of Mathematics and Artificial Intelligence, vol. 31, pp. 113-126, 2001.
6. 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.
7. D. Ahr and G. Reinelt, "New heuristics and lower bounds for the min-max k-chinese postman problem," in Algorithms-Esa 2002, Proceedings, ser. Lecture Notes in Computer Science, 2002, vol. 2461, pp. 64-74.
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.
10. J. Kruskal, "On the shortest spanning subtree of a graph and the travelling salesman problem," Proc. American Math. Society 7, pp. 48-50, 1956.