Confidence-based roadmap using Gaussian process regression for a robot control

To achieve a realistic task by a recent complicated robot, a practical motion planning method is important. Especially in this decade, sampling-based motion planning methods have become popular thanks to recent high performance computers. In sampling-based motion planning, a graph that covers the state space is constructed based on reachability between node pairs, and the motion is planned using the graph. However, it requires an explicit model of a controlled target. In this research, we propose a motion planning method in which a system model is estimated by using Gaussian process regression. We apply our method to the control of an actual robot. Experimental results show that the control of the robot can be achieved by the proposed motion planning method.

[1]  Shin Ishii,et al.  Fast Approximation Method for Gaussian Process Regression Using Hash Function for Non-uniformly Distributed Data , 2013, ICANN.

[2]  Pieter Abbeel,et al.  LQG-MP: Optimized path planning for robots with motion uncertainty and imperfect state information , 2010, Int. J. Robotics Res..

[3]  Carl E. Rasmussen,et al.  Gaussian processes for machine learning , 2005, Adaptive computation and machine learning.

[4]  Dieter Fox,et al.  GP-BayesFilters: Bayesian filtering using Gaussian process prediction and observation models , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  Geoffrey E. Hinton.  Training Products of Experts by Minimizing Contrastive Divergence , 2002, Neural Computation.

[6]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

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

[8]  Jonathan P. How,et al.  Real-Time Motion Planning With Applications to Autonomous Urban Driving , 2009, IEEE Transactions on Control Systems Technology.

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

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

[11]  N. Roy,et al.  The Belief Roadmap: Efficient Planning in Belief Space by Factoring the Covariance , 2009, Int. J. Robotics Res..

[12]  Lonnie Chrisman,et al.  Reinforcement Learning with Perceptual Aliasing: The Perceptual Distinctions Approach , 1992, AAAI.

[13]  Nicholas Roy,et al.  Rapidly-exploring Random Belief Trees for motion planning under uncertainty , 2011, 2011 IEEE International Conference on Robotics and Automation.

[14]  Ashok Srivastava,et al.  Stable and Efficient Gaussian Process Calculations , 2009, J. Mach. Learn. Res..

[15]  Radford M. Neal.  Pattern Recognition and Machine Learning , 2007, Technometrics.

[16]  Florent Lamiraux,et al.  Dynamic walking and whole-body motion planning for humanoid robots: an integrated approach , 2013, Int. J. Robotics Res..

[17]  Nikos A. Vlassis,et al.  A point-based POMDP algorithm for robot planning , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[18]  Rina Dechter,et al.  Generalized best-first search strategies and the optimality of A* , 1985, JACM.

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

[20]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).