Guaranteed Coverage with a Blind Unreliable Robot

We consider the problem of coverage planning for a particular type of very simple mobile robot. The robot must be able to translate in a commanded direction (specified in a global reference frame), with bounded error on the motion direction, until reaching the environment boundary. The objective, for a given environment map, is to generate a sequence of motions that is guaranteed to cover as large a portion of that environment as possible, in spite of the severe limits on the robot's sensing and actuation abilities. We show how to model the knowledge available to this kind of robot about its own position within the environment, show how to compute the region whose coverage can be guaranteed for a given plan, and characterize regions whose coverage cannot be guaranteed by any plan. We also describe a heuristic algorithm that generates coverage plans for this robot, based on a search across a specially-constructed graph. Simulation results demonstrate the effectiveness of the approach.

[1]  Ehud Rivlin,et al.  Sensory-based motion planning with global proofs , 1997, IEEE Trans. Robotics Autom..

[2]  Xin Yu,et al.  An optimization approach for planning robotic field coverage , 2015, IECON 2015 - 41st Annual Conference of the IEEE Industrial Electronics Society.

[3]  Xiaotie Deng,et al.  How to learn an unknown environment. I: the rectilinear case , 1998, JACM.

[4]  Wesley H. Huang.  Optimal line-sweep-based decompositions for coverage algorithms , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[5]  Lino Marques,et al.  Multisensor Demining Robot , 2005, Auton. Robots.

[6]  Jason M. O'Kane,et al.  Planning for provably reliable navigation using an unreliable, nearly sensorless robot , 2013, Int. J. Robotics Res..

[7]  Michael A. Erdmann,et al.  Using Backprojections for Fine Motion Planning with Uncertainty , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[8]  Elias B. Kosmatopoulos,et al.  Distributed multi-robot coverage using micro aerial vehicles , 2013, 21st Mediterranean Conference on Control and Automation.

[9]  Ehud Rivlin,et al.  Range-sensor based navigation in three dimensions , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[10]  Ioannis M. Rekleitis,et al.  Efficient multi-robot coverage of a known environment , 2017, 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[11]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

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

[13]  Philippe Pasquier,et al.  Complete and robust cooperative robot area coverage with limited range , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[14]  Howie Choset,et al.  Limited communication, multi-robot team based coverage , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[15]  Carlos Sagüés,et al.  Optimal path planning and coverage control for multi-robot persistent coverage in environments with obstacles , 2017, 2017 IEEE International Conference on Robotics and Automation (ICRA).

[16]  Mark Moll,et al.  Manipulation of Pose Distributions , 2002, Int. J. Robotics Res..

[17]  Emilio Frazzoli,et al.  The coverage problem for loitering Dubins vehicles , 2007, 2007 46th IEEE Conference on Decision and Control.

[18]  L. Guvenc,et al.  Household robotics: autonomous devices for vacuuming and lawn mowing [Applications of control] , 2007, IEEE Control Systems.

[19]  Howie Choset,et al.  Uniform Coverage of Simple Surfaces Embedded in for Auto-Body Painting , 2004, WAFR.

[20]  Matthew T. Mason,et al.  An exploration of sensorless manipulation , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[21]  Kevin M. Lynch,et al.  Parts Feeding on a Conveyor with a One Joint Robot , 2000, Algorithmica.

[22]  Howie Choset,et al.  Coverage Path Planning: The Boustrophedon Cellular Decomposition , 1998 .

[23]  Marc Carreras,et al.  A survey on coverage path planning for robotics , 2013, Robotics Auton. Syst..

[24]  Mark H. Overmars,et al.  Geometry and Part Feeding , 2000, Sensor Based Intelligent Robots.

[25]  Steven M. LaValle,et al.  Mapping and Pursuit-Evasion Strategies For a Simple Wall-Following Robot , 2011, IEEE Transactions on Robotics.

[26]  Jason M. O'Kane,et al.  Semi-boustrophedon coverage with a dubins vehicle , 2017, 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[27]  Howie Choset,et al.  Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach , 2008, Annals of Mathematics and Artificial Intelligence.

[28]  Elon Rimon,et al.  Spiral-STC: an on-line coverage algorithm of grid environments by a mobile robot , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[29]  Matthew T. Mason.  Kicking the Sensing Habit , 1993, AI Mag..

[30]  Zachary Dodds,et al.  Evaluating the Roomba: A low-cost, ubiquitous platform for robotics research and education , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[31]  László Szirmay-Kalos,et al.  Worst-case versus average case complexity of ray-shooting , 1998, Computing.

[32]  Mark H. Overmars,et al.  Trap Design for Vibratory Bowl Feeders , 2001 .

[33]  Steven M. LaValle,et al.  Gap Navigation Trees: Minimal Representation for Visibility-based Tasks , 2004, WAFR.

[34]  Dylan A. Shell,et al.  Minimalist Robot Navigation and Coverage Using a Dynamical System Approach , 2017, 2017 First IEEE International Conference on Robotic Computing (IRC).

[35]  Matthew T. Mason,et al.  Posing Polygonal Objects in the Plane by Pushing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[36]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[37]  Jason M. O'Kane,et al.  Probabilistic localization with a blind robot , 2008, 2008 IEEE International Conference on Robotics and Automation.

[38]  Se-Young Oh,et al.  Online complete coverage path planning for mobile robots based on linked spiral paths using constrained inverse distance transform , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[39]  Kenneth Y. Goldberg,et al.  Orienting polygonal parts without sensors , 1993, Algorithmica.

[40]  Howie Choset,et al.  Sensor based motion planning: the hierarchical generalized Voronoi graph , 1996 .

[41]  Noa Agmon,et al.  The giving tree: constructing trees for efficient offline and online multi-robot coverage , 2008, Annals of Mathematics and Artificial Intelligence.

[42]  Timothy Bretl,et al.  Robust coverage by a mobile robot of a planar workspace , 2013, 2013 IEEE International Conference on Robotics and Automation.

[43]  Sonal Jain,et al.  Multi-robot forest coverage , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[44]  Timothy Bretl,et al.  Probably approximately correct coverage for robots with uncertainty , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[45]  Zhiyang Yao,et al.  Finding Efficient Robot Path for the Complete Coverage of A Known Space , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[46]  Jason M. O'Kane,et al.  Localization With Limited Sensing , 2007, IEEE Transactions on Robotics.

[47]  Ioannis M. Rekleitis,et al.  Distributed coverage with multi-robot system , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[48]  Enrique González,et al.  BSA: A Complete Coverage Algorithm , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[49]  Jean-Claude Latombe,et al.  Landmark-Based Robot Navigation , 1992, Algorithmica.

[50]  Guilherme A. S. Pereira,et al.  Multi-UAV Routing for Area Coverage and Remote Sensing with Minimum Time , 2015, Sensors.

[51]  Michael A. Erdmann,et al.  Understanding Action and Sensing by Designing Action-Based Sensors , 1995, Int. J. Robotics Res..

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

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

[54]  Jason M. O'Kane,et al.  Multi-robot Dubins Coverage with Autonomous Surface Vehicles , 2018, 2018 IEEE International Conference on Robotics and Automation (ICRA).

[55]  Vladimir J. Lumelsky,et al.  An algorithm for maze searching with azimuth input , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[56]  Ioannis M. Rekleitis,et al.  Efficient complete coverage of a known arbitrary environment with applications to aerial operations , 2013, Autonomous Robots.

[57]  Baruch Schieber,et al.  Navigating in unfamiliar geometric terrain , 1991, STOC '91.

[58]  Leonidas J. Guibas,et al.  Visibility and intersection problems in plane geometry , 1989, Discret. Comput. Geom..

[59]  Noam Hazon,et al.  Redundancy, Efficiency and Robustness in Multi-Robot Coverage , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.