A Decomposition-Based Approach to Reasoning about Free Space Path-Connectivity for Rigid Objects in 2D

In this paper, we compute a conservative approximation of the path-connected components of the free space of a rigid object in a 2D workspace in order to solve two closely related problems: to determine whether there exists a collision-free path between two given configurations, and to verify whether an object can escape arbitrarily far from its initial configuration -- i.e., whether the object is caged. Furthermore, we consider two quantitative characteristics of the free space: the volume of path-connected components and the width of narrow passages. To address these problems, we decompose the configuration space into a set of two-dimensional slices, approximate them as two-dimensional alpha-complexes, and then study the relations between them. This significantly reduces the computational complexity compared to a direct approximation of the free space. We implement our algorithm and run experiments in a three-dimensional configuration space of a simple object showing runtime of less than 2 seconds.

[1]  Attawith Sudsang,et al.  Two-Finger Caging of Nonconvex Polytopes , 2011, IEEE Transactions on Robotics.

[2]  Satoshi Makita,et al.  3D two-fingered caging for two types of objects: sufficient conditions and planning , 2013, Int. J. Mechatronics Autom..

[3]  Alberto Rodriguez,et al.  From caging to grasping , 2011, Int. J. Robotics Res..

[4]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[5]  Danica Kragic,et al.  Caging Grasps of Rigid and Partially Deformable 3-D Objects With Double Fork and Neck Features , 2016, IEEE Transactions on Robotics.

[6]  Attawith Sudsang,et al.  Two-finger caging of concave polygon , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[7]  Vijay Kumar,et al.  Decentralized Algorithms for Multi-Robot Manipulation via Caging , 2004, Int. J. Robotics Res..

[8]  Danica Kragic,et al.  Grasping objects with holes: A topological approach , 2013, 2013 IEEE International Conference on Robotics and Automation.

[9]  Dinesh Manocha,et al.  Efficient Cell Labelling and Path Non-existence Computation using C-obstacle Query , 2008, Int. J. Robotics Res..

[10]  Danica Kragic,et al.  Integrated motion and clasp planning with virtual linking , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  Andrew Blake,et al.  Caging Planar Bodies by One-Parameter Two-Fingered Gripping Systems , 1999, Int. J. Robotics Res..

[12]  Kenneth Y. Goldberg,et al.  Energy-Bounded Caging: Formal Definition and 2-D Energy Lower Bound Algorithm Based on Weighted Alpha Shapes , 2016, IEEE Robotics and Automation Letters.

[13]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[14]  A. D. Lewis,et al.  Geometric Control of Mechanical Systems , 2004, IEEE Transactions on Automatic Control.

[15]  Satoshi Makita,et al.  3D multifingered caging: Basic formulation and planning , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[16]  Danica Kragic,et al.  Caging and Path Non-existence: A Deterministic Sampling-Based Verification Algorithm , 2017, ISRR.

[17]  Leonidas J. Guibas,et al.  Disconnection proofs for motion planning , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[18]  Danica Kragic,et al.  A topology-based object representation for clasping, latching and hooking , 2013, 2013 13th IEEE-RAS International Conference on Humanoid Robots (Humanoids).

[19]  A. Frank van der Stappen,et al.  Caging Polygons with Two and Three Fingers , 2008, Int. J. Robotics Res..

[20]  Timothy Bretl,et al.  Proving path non-existence using sampling and alpha shapes , 2012, 2012 IEEE International Conference on Robotics and Automation.

[21]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[22]  Lydia E. Kavraki,et al.  A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..