Estimating Configuration Space Belief from Collision Checks for Motion Planning

For motion planning in high dimensional configuration spaces, a significant computational bottleneck is collision detection. Our aim is to reduce the expected number of collision checks by creating a belief model of the configuration space using results from collision tests. We assume the robot's configuration space to be a continuous ambient space whereby neighbouring points tend to share the same collision state. This enables us to formulate a probabilistic model that assigns to unevaluated configurations a belief estimate of being collision-free. We have presented a detailed comparative analysis of various kNN methods and distance metrics used to evaluate C-space belief. We have also proposed a weighting matrix in C-space to improve the performance of kNN methods. Moreover, we have proposed a topological method that exploits the higher order structure of the C-space to generate a belief model. Our results indicate that our proposed topological method outperforms kNN methods by achieving higher model accuracy while being computationally efficient.

[1]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[2]  S. LaValle Rapidly-exploring random trees : a new tool for path planning , 1998 .

[3]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[4]  Amit Chakrabarti,et al.  An optimal randomised cell probe lower bound for approximate nearest neighbour searching , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[5]  Lydia E. Kavraki,et al.  A two level fuzzy PRM for manipulation planning , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[6]  Dinesh Manocha,et al.  Faster Sample-Based Motion Planning Using Instance-Based Learning , 2012, WAFR.

[7]  V. A. Epanechnikov Non-Parametric Estimation of a Multivariate Probability Density , 1969 .

[8]  Danica Kragic,et al.  High-dimensional Winding-Augmented Motion Planning with 2D topological task projections and persistent homology , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

[9]  Oliver Brock,et al.  Sampling-Based Motion Planning Using Predictive Models , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

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

[11]  Siddhartha S. Srinivasa,et al.  Pareto-optimal search over configuration space beliefs for anytime motion planning , 2016, 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

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

[13]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[14]  Maxim Likhachev,et al.  Motion planning for robotic manipulators with independent wrist joints , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[15]  N. Altman An Introduction to Kernel and Nearest-Neighbor Nonparametric Regression , 1992 .

[16]  P. Mahalanobis On the generalized distance in statistics , 1936 .