Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published May 2006 | Published
Book Section - Chapter Open

Multi-robot Boundary Coverage with Plan Revision

Abstract

This paper revisits the multi-robot boundary coverage problem in which a group of k robots must inspect every point on the boundary of a 2-dimensional environment. We focus on the case in which revision of the original inspection plan may be necessary due to changes in the robot team size or the environment. Building upon prior work, which presented a graph-based approach to path planning for this problem, we present a graph representation of the task that is greatly reduced in complexity and a path revision algorithm appropriate for addressing such changes.

Additional Information

© 2006 IEEE. Issue Date: 15-19 May 2006, Date of Current Version: 26 June 2006. The authors would like thank Elon Rimon for valuable discussions regarding graph-based approaches to multi-robot coverage.

Attached Files

Published - Williams2006p95122008_Ieee_International_Conference_On_Robotics_And_Automation_Vols_1-9.pdf

Files

Williams2006p95122008_Ieee_International_Conference_On_Robotics_And_Automation_Vols_1-9.pdf

Additional details

Created:
August 19, 2023
Modified:
October 23, 2023