Multi-robot coverage and exploration on Riemannian manifolds with boundaries

Multi-robot coverage and exploration are fundamental problems in robotics. A widely used, efficient and distributable algorithm for achieving coverage of a convex environment with Euclidean metrics is that proposed by Cortes which is based on the discrete-time Lloyd’s algorithm. This algorithm is not directly applicable to general Riemannian manifolds with boundaries that are non-convex and are intrinsically non-Euclidean. In this paper we generalize the control law based on minimization of the coverage functional to such non-Euclidean spaces punctured by obstacles. We also propose a practical discrete implementation based on standard graph search-based algorithms. We demonstrate the applicability of the proposed algorithm by solving efficient coverage problems on a sphere and a torus with obstacles, and exploration problems in non-convex indoor environments.

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

[2]  Wilfrid S. Kendall,et al.  Riemannian barycentres and geodesic convexity , 1999, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  J. Jost Compact Riemann Surfaces , 2002 .

[4]  Daniel E. Koditschek,et al.  The construction of analytic diffeomorphisms for exact robot navigation on star worlds , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[5]  Wolfram Burgard,et al.  Information Gain-based Exploration Using Rao-Blackwellized Particle Filters , 2005, Robotics: Science and Systems.

[6]  R. Cleary Mathematical Models , 2009 .

[7]  Stefan Friedrich,et al.  Topology , 2019, Arch. Formal Proofs.

[8]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[9]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[10]  Shunsuke Ihara,et al.  Information theory - for continuous systems , 1993 .

[11]  L. Hörmander The analysis of linear partial differential operators , 1990 .

[12]  S. Alexander,et al.  Distance geometry in Riemannian manifolds-with-boundary , 1981 .

[13]  Jorge Cortes,et al.  Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms , 2009 .

[14]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[15]  Jiang-Hua Lu,et al.  Progress in Mathematics , 2013 .

[16]  Vijay Kumar,et al.  Distributed Coverage and Exploration in Unknown Non-convex Environments , 2010, DARS.

[17]  Jesse Freeman,et al.  in Morse theory, , 1999 .

[18]  Miklós Pálfia,et al.  Means in metric spaces and the center of mass , 2011 .

[19]  A. Bobenko Compact Riemann Surfaces , 2005 .

[20]  Kevin Q. Brown,et al.  Voronoi Diagrams from Convex Hulls , 1979, Inf. Process. Lett..

[21]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[22]  Francesco Bullo,et al.  Esaim: Control, Optimisation and Calculus of Variations Spatially-distributed Coverage Optimization and Control with Limited-range Interactions , 2022 .

[23]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[24]  Andrew Adamatzky,et al.  Voronoi-like partition of lattice in cellular automata , 1996 .

[25]  M. Gromov Metric Structures for Riemannian and Non-Riemannian Spaces , 1999 .

[26]  W. Klingenberg,et al.  Contributions to Riemannian Geometry in the Large , 1959 .

[27]  Shin-ichi Ohta,et al.  Convexities of metric spaces , 2007 .

[28]  N. Hitchin A panoramic view of riemannian geometry , 2006 .

[29]  Cyrill Stachniss,et al.  Exploration and mapping with mobile robots , 2006 .

[30]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[31]  Wolfram Burgard,et al.  Probabilistic Robotics (Intelligent Robotics and Autonomous Agents) , 2005 .

[32]  Ruggero Carli,et al.  Discrete Partitioning and Coverage Control for Gossiping Robots , 2010, IEEE Transactions on Robotics.

[33]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[34]  Richard M. Murray,et al.  A Mathematical Introduction to Robotic Manipulation , 1994 .

[35]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[36]  I. Holopainen Riemannian Geometry , 1927, Nature.

[37]  S. Sastry Nonlinear Systems: Analysis, Stability, and Control , 1999 .

[38]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[39]  Louis Moresi,et al.  A Fast Robust Algorithm for Computing Discrete Voronoi Diagrams , 2009, J. Math. Model. Algorithms.

[40]  Emilio Frazzoli,et al.  Distributed Algorithms for Environment Partitioning in Mobile Robotic Networks , 2011, IEEE Transactions on Automatic Control.

[41]  Vijay Kumar,et al.  Sensing and coverage for a network of heterogeneous robots , 2008, 2008 47th IEEE Conference on Decision and Control.