Robot Coverage Path planning for general surfaces using quadratic differentials

Robot Coverage Path planning (i.e., the process of providing full coverage of a given domain by one or multiple robots) is a classical problem in the field of robotics and motion planning. The goal of such planning is to provide nearly full coverage while also minimize duplicately visited area. In this paper, we focus on the scenario of path planning on general surface, including planar domains with complex topology, complex terrain, and general surface in 3D space. Our approach described in this paper adopts a natural, intrinsic and global parametrization of the surface for robot path planning, namely the holomorphic quadratic differentials. We give each point on the surface a uv-coordinates naturally represented by a complex number, except for a small number of zero points (singularities). We show that natural, efficient robot paths can be obtained by using such coordinate systems. The method is based on intrinsic geometry and thus can be adapted to general surface exploration in 3D.

[1]  Vijay Kumar,et al.  Multi-robot coverage and exploration on Riemannian manifolds with boundaries , 2014, Int. J. Robotics Res..

[2]  Peter Li,et al.  LECTURES ON HARMONIC MAPS , 2011 .

[3]  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 .

[4]  Metin Ozkan,et al.  A pattern-based genetic algorithm for multi-robot coverage path planning minimizing completion time , 2010, Journal of Intelligent Manufacturing.

[5]  S. Yau,et al.  Global conformal surface parameterization , 2003 .

[6]  Peter Schröder,et al.  Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing , 2003 .

[7]  S. Yau,et al.  Lectures on Harmonic Maps , 1997 .

[8]  Simon X. Yang,et al.  Complete Coverage Path Planning in an Unknown Underwater Environment Based on D-S Data Fusion Real-Time Map Building , 2012, Int. J. Distributed Sens. Networks.

[9]  脇元 修一,et al.  IEEE International Conference on Robotics and Automation (ICRA) におけるフルードパワー技術の研究動向 , 2011 .

[10]  Pablo González de Santos,et al.  Mobile-robot navigation with complete coverage of unstructured environments , 2004, Robotics Auton. Syst..

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

[12]  S.X. Yang,et al.  A neural network approach to complete coverage path planning , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[13]  Chaomin Luo,et al.  A solution to vicinity problem of obstacles in complete coverage path planning , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[14]  Howie Choset,et al.  Exact Cellular Decomposition of Closed Orientable Surfaces Embedded in R3. , 2001 .

[15]  ALEX WRIGHT,et al.  THE POINCARÉ-HOPF THEOREM , 2008 .

[16]  G. Laumon,et al.  A Series of Modern Surveys in Mathematics , 2000 .

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

[18]  Zengyu Cai,et al.  Research on Complete Coverage Path Planning Algorithms based on A*Algorithms , 2014 .

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

[20]  Vijay Kumar,et al.  Multi-robot Coverage and Exploration in Non-Euclidean Metric Spaces , 2012, WAFR.

[21]  P. Hacking,et al.  Riemann Surfaces , 2007 .

[22]  Marc Carreras,et al.  Planning coverage paths on bathymetric maps for in-detail inspection of the ocean floor , 2013, 2013 IEEE International Conference on Robotics and Automation.

[23]  Elon Rimon,et al.  Spanning-tree based coverage of continuous areas by a mobile robot , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[24]  Vijay Kumar,et al.  Time-optimal UAV trajectory planning for 3D urban structure coverage , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[25]  Jian Jin,et al.  Coverage path planning on three‐dimensional terrain for arable farming , 2011, J. Field Robotics.

[26]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[27]  Alexander Zelinsky,et al.  Planning Paths of Complete Coverage of an Unstructured Environment by a Mobile Robot , 2007 .

[28]  Wei Zeng,et al.  Topology dependent space filling curves for sensor networks and applications , 2013, 2013 Proceedings IEEE INFOCOM.

[29]  Esther M. Arkin,et al.  Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..

[30]  Shing-Tung Yau,et al.  Slit Map: Conformal Parameterization for Multiply Connected Surfaces , 2008, GMP.

[31]  Shing-Tung Yau,et al.  Computing Conformal Structure of Surfaces , 2002, Commun. Inf. Syst..

[32]  Arto Visala,et al.  Coverage path planning algorithms for agricultural field machines , 2009 .

[33]  Howie Choset,et al.  Morse Decompositions for Coverage Tasks , 2002, Int. J. Robotics Res..

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

[35]  J. Hubbard,et al.  On the density of strebel differentials , 1975 .

[36]  Taejung Kim,et al.  Optimal sweeping paths on a 2-manifold: a new class of optimization problems defined by path structures , 2003, IEEE Trans. Robotics Autom..

[37]  Ioannis M. Rekleitis,et al.  Optimal complete terrain coverage using an Unmanned Aerial Vehicle , 2011, 2011 IEEE International Conference on Robotics and Automation.

[38]  Sylvia C. Wong,et al.  A topological coverage algorithm for mobile robots , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[39]  Arto Visala,et al.  Coverage path planning algorithms for agricultural field machines , 2009, J. Field Robotics.

[40]  Vladimir J. Lumelsky,et al.  A terrain-covering algorithm for an AUV , 1996, Auton. Robots.

[41]  Jie Gao,et al.  Space Filling Curves for 3D Sensor Networks with Complex Topology , 2015, CCCG.

[42]  Marc Carreras,et al.  Efficient seabed coverage path planning for ASVs and AUVs , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[43]  M. I. Ribeiro,et al.  Complete coverage path planning and guidance for cleaning robots , 1997, ISIE '97 Proceeding of the IEEE International Symposium on Industrial Electronics.

[44]  Howie Choset,et al.  Exact cellular decomposition of closed orientable surfaces embedded in /spl Rfr//sup 3/ , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).