Deep Neural Networks for Swept Volume Prediction Between Configurations

Swept Volume (SV), the volume displaced by an object when it is moving along a trajectory, is considered a useful metric for motion planning. First, SV has been used to identify collisions along a trajectory, because it directly measures the amount of space required for an object to move. Second, in sampling-based motion planning, SV is an ideal distance metric, because it correlates to the likelihood of success of the expensive local planning step between two sampled configurations. However, in both of these applications, traditional SV algorithms are too computationally expensive for efficient motion planning. In this work, we train Deep Neural Networks (DNNs) to learn the size of SV for specific robot geometries. Results for two robots, a 6 degree of freedom (DOF) rigid body and a 7 DOF fixed-based manipulator, indicate that the network estimations are very close to the true size of SV and is more than 1500 times faster than a state of the art SV estimation algorithm.

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

[2]  Kenneth I. Joy,et al.  Using isosurface methods for visualizing the envelope of a swept trivariate solid , 2000, Proceedings the Eighth Pacific Conference on Computer Graphics and Applications.

[3]  Olivier Stasse,et al.  Fast Humanoid Robot Collision-Free Footstep Planning Using Swept Volume Approximations , 2012, IEEE Transactions on Robotics.

[4]  Richard Hans Robert Hahnloser,et al.  Digital selection and analogue amplification coexist in a cortex-inspired silicon circuit , 2000, Nature.

[5]  Peter K. Allen,et al.  Swept volumes and their use in viewpoint computation in robot work-cells , 1995, Proceedings. IEEE International Symposium on Assembly and Task Planning.

[6]  Peter K. Allen,et al.  Computing swept volumes , 2000, Comput. Animat. Virtual Worlds.

[7]  Nancy M. Amato,et al.  Choosing good distance metrics and local planners for probabilistic roadmap methods , 2000, IEEE Trans. Robotics Autom..

[8]  Kurt Hornik,et al.  Approximation capabilities of multilayer feedforward networks , 1991, Neural Networks.

[9]  F. Litvin,et al.  Swept Volume Determination and Interference Detection for Moving 3-D Solids , 1991 .

[10]  Kenneth I. Joy,et al.  Swept Volumes: Fundation, Perspectives, and Applications , 2006, Int. J. Shape Model..

[11]  Elmar Schömer,et al.  High Precision Conservative Surface Mesh Generation for Swept Volumes , 2015, IEEE Transactions on Automation Science and Engineering.

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

[13]  Marcel Campen,et al.  Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes , 2010, Comput. Graph. Forum.

[14]  Jean-Paul Laumond,et al.  Swept Volume Approximation of Polygon Soups , 2007, IEEE Transactions on Automation Science and Engineering.

[15]  Mitul Saha,et al.  Exact Collision Checking of Robot Paths , 2002, WAFR.

[16]  Dinesh Manocha,et al.  Fast swept volume approximation of complex polyhedral models , 2003, SM '03.

[17]  James J. Kuffner,et al.  Effective sampling and distance metrics for 3D rigid body path planning , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.