Approximating Cfree Space Topology by Constructing Vietoris-Rips Complex

We present a new way of constructing sparse roadmaps using point clouds that approximates and measures the underlying topology of the Cfree space. The main advantage of the constructed roadmap is its homotopy equivalence to the η-offset of the Cfree space. Though only used to plan paths as a regular roadmap in this work, because the roadmap preserves the topology of the underlying sampled space, the information can be used to plan paths beyond the simple connection of graph vertices. To construct the roadmap, we first sample the configuration space so that the resulting graph is a n-skeleton graph that constructs a Vietoris-Rips (VR) complex. Then, we perform a series of topological collapses to remove vertices from the graph while still preserving its topological properties. The resulting roadmaps are used to plan paths for different robots and the experimental results show that the proposed topological approach is faster and more feasible in complex high-dimensional spaces.

[1]  Chinwe Ekenna,et al.  Investigating heterogeneous planning spaces , 2018, 2018 IEEE International Conference on Simulation, Modeling, and Programming for Autonomous Robots (SIMPAR).

[2]  André Lieutier,et al.  Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes , 2013, Comput. Geom..

[3]  Vijay Kumar,et al.  Invariants for homology classes with application to optimal search and planning problem in robotics , 2012, Annals of Mathematics and Artificial Intelligence.

[4]  Florian T. Pokorny,et al.  Multiscale Topological Trajectory Classification with Persistent Homology , 2014, Robotics: Science and Systems.

[5]  Afra Zomorodian,et al.  Fast construction of the Vietoris-Rips complex , 2010, Comput. Graph..

[6]  Danica Kragic,et al.  Data-Driven Topological Motion Planning with Persistent Cohomology , 2015, Robotics: Science and Systems.

[7]  Pieter Abbeel,et al.  EG-RRT: Environment-guided random trees for kinodynamic motion planning with uncertainty and obstacles , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[8]  A. Björner Topological methods , 1996 .

[9]  Ananthram Swami,et al.  Simplifying the homology of networks via strong collapses , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[10]  Nancy M. Amato,et al.  UMAPRM: Uniformly sampling the medial axis , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[11]  Yi Wang,et al.  An improved three-dimension reconstruction method based on guided filter and Delaunay , 2018, International Conference on Optical Instruments and Technology.

[12]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[13]  R. Scopigno,et al.  Parallel 3D Delaunay Triangulation , 1993, Comput. Graph. Forum.

[14]  Shawna L. Thomas,et al.  Studying learning techniques in different phases of PRM construction , 2015 .

[15]  Don Sheehy,et al.  Linear-Size Approximations to the Vietoris–Rips Filtration , 2012, Discrete & Computational Geometry.

[16]  AurenhammerFranz Voronoi diagramsa survey of a fundamental geometric data structure , 1991 .

[17]  Vijay Kumar,et al.  Topological constraints in search-based robot path planning , 2012, Auton. Robots.

[18]  Rajeev Motwani,et al.  Path Planning in Expansive Configuration Spaces , 1999, Int. J. Comput. Geom. Appl..

[19]  Vijay Kumar,et al.  Identification and Representation of Homotopy Classes of Trajectories for Search-based Path Planning in 3D , 2011, Robotics: Science and Systems.

[20]  Erin W. Chambers,et al.  Vietoris–Rips Complexes of Planar Point Sets , 2009, Discret. Comput. Geom..

[21]  Nikolaos Papanikolopoulos,et al.  3D point cloud segmentation using topological persistence , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

[22]  David Hsu,et al.  The bridge test for sampling narrow passages with probabilistic roadmap planners , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[23]  Sam Ade Jacobs,et al.  Adaptive neighbor connection for PRMs: A natural fit for heterogeneous environments and parallelism , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[24]  Vijay Kumar,et al.  Persistent Homology for Path Planning in Uncertain Environments , 2015, IEEE Transactions on Robotics.

[25]  Erion Plaku,et al.  Clearance-driven motion planning for mobile robots with differential constraints , 2018, Robotica.

[26]  Troy McMahon,et al.  Sampling-based motion planning with reachable volumes: Theoretical foundations , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[27]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[28]  Daniel Vallejo,et al.  OBPRM: an obstacle-based PRM for 3D workspaces , 1998 .

[29]  Akira Tanaka,et al.  The worst-case time complexity for generating all maximal cliques and computational experiments , 2006, Theor. Comput. Sci..

[30]  Nancy M. Amato,et al.  A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[31]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[32]  L. Wasserman Topological Data Analysis , 2016, 1609.08227.

[33]  David Eppstein,et al.  Listing All Maximal Cliques in Large Sparse Real-World Graphs , 2011, JEAL.

[34]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[35]  K. Watanabe,et al.  Topological Map Generation based on Delaunay Triangulation for Mobile Robot , 2006, 2006 SICE-ICASE International Joint Conference.

[36]  R. Forman Combinatorial Differential Topology and Geometry , 1999 .

[37]  Jean-Daniel Boissonnat,et al.  Strong Collapse for Persistence , 2018, ESA.

[38]  P. Abbeel,et al.  Identification and Representation of Homotopy Classes of Trajectories for Search-Based Path Planning in 3D , 2012 .

[39]  Mark H. Overmars,et al.  The Gaussian sampling strategy for probabilistic roadmap planners , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[40]  Herbert Edelsbrunner,et al.  Persistent Homology: Theory and Practice , 2013 .

[41]  LongChen,et al.  OPTIMAL DELAUNAY TRIANGULATIONS , 2004 .

[42]  H. Edelsbrunner,et al.  Topological data analysis , 2011 .

[43]  Rocío González-Díaz,et al.  C V ] 2 3 M ay 2 01 1 On the Cohomology of 3 D Digital Images , 2013 .

[44]  Michael Robinson Understanding networks and their behaviors using sheaf theory , 2013, 2013 IEEE Global Conference on Signal and Information Processing.

[45]  Nancy M. Amato,et al.  Improved roadmap connection via local learning for sampling based planners , 2015, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).