Robust coverage by a mobile robot of a planar workspace

In this paper, we suggest a new way to plan coverage paths for a mobile robot whose position and velocity are subject to bounded error. Most prior approaches assume a probabilistic model of uncertainty and maximize the expected value of covered area. We assume a worst-case model of uncertainty and-for a particular choice of coverage path-are still able to guarantee complete coverage. We begin by considering the special case in which the region to be covered is a single point. The machinery we develop to express and solve this problem immediately extends to guarantee coverage of a small subset in the workspace. Finally, we use this subset as a sort of virtual coverage implement, achieving complete coverage of the entire workspace by tiling copies of the subset along boustrophedon paths.

[1]  B. O. Koopman,et al.  Search and its Optimization , 1979 .

[2]  Michael A. Erdmann,et al.  On Motion Planning with Uncertainty , 1984 .

[3]  Howie Choset,et al.  Coverage of Known Spaces: The Boustrophedon Cellular Decomposition , 2000, Auton. Robots.

[4]  Lawrence D. Stone.  Search Theory: A Mathematical Theory for Finding Lost Objects , 1977 .

[5]  J. Seaman.  Introduction to the theory of coverage processes , 1990 .

[6]  Esther M. Arkin,et al.  Angewandte Mathematik Und Informatik Universit at Zu K Oln Approximation Algorithms for Lawn Mowing and Milling Ss Andor P.fekete Center for Parallel Computing Universitt at Zu Kk Oln D{50923 Kk Oln Germany Approximation Algorithms for Lawn Mowing and Milling , 2022 .

[7]  J. R. Weisinger,et al.  A survey of the search theory literature , 1991 .

[8]  Howie Choset,et al.  Uniform Coverage of Automotive Surface Patches , 2005, Int. J. Robotics Res..

[9]  Howie Choset,et al.  Path Planning for Robotic Demining: Robust Sensor-Based Coverage of Unstructured Environments and Probabilistic Methods , 2003, Int. J. Robotics Res..

[10]  Douglas W. Gage,et al.  Randomized search strategies with imperfect sensors , 1994, Other Conferences.

[11]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[12]  Bruce Randall Donald,et al.  A Geometric Approach to Error Detection and Recovery for Robot Motion Planning with Uncertainty , 1987, Artif. Intell..

[13]  Timothy H. Chung.  On Probabilistic Search Decisions under Searcher Motion Constraints , 2008, WAFR.

[14]  Howie Choset,et al.  Sensor-based Coverage of Unknown Environments: Incremental Construction of Morse Decompositions , 2002, Int. J. Robotics Res..

[15]  Russell H. Taylor,et al.  Automatic Synthesis of Fine-Motion Strategies for Robots , 1984 .

[16]  Bruce Randall Donald.  Planning Multi-Step Error Detection and Recovery Strategies , 1990, Int. J. Robotics Res..

[17]  Jean-Claude Latombe,et al.  Robot Motion Planning with Uncertainty in Control and Sensing , 1991, Artif. Intell..