Learning potential functions by demonstration for path planning

Potential functions can be used to design efficient path planning schemes. However, it is often difficult to design appropriate potential functions to mimic desired behavior of the agent. Instead of using a pre-designed potential function for path planning, this paper presents an algorithm that learns the underlying potential function from a given sample trajectory generated by a “expert” (say, a human). This underlying potential function implicitly incorporates obstacle avoidance information that may be intuitive or experience-based. The potential function to be learned is parametrized and the parameter weights are obtained through minimization of a well-designed cost function via a gradient descent search algorithm. Once learned, this potential function can be used for path planning in case of alternative (and more complex) scenarios, such as those with multiple obstacles. The paper presents the theoretical foundation and numerical validation of the proposed algorithm.

[1]  Michael S. Branicky,et al.  Using path-length localized RRT-like search to solve challenging planning problems , 2011, 2011 IEEE International Conference on Robotics and Automation.

[2]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[3]  Jean-Claude Latombe,et al.  A Monte-Carlo algorithm for path planning with many degrees of freedom , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[4]  Yoshua. Bengio,et al.  Learning Deep Architectures for AI , 2007, Found. Trends Mach. Learn..

[5]  R. TimothyStack,et al.  Learning to fly. , 1998 .

[6]  Andrew Y. Ng,et al.  Pharmacokinetics of a novel formulation of ivermectin after administration to goats , 2000, ICML.

[7]  Pieter Abbeel,et al.  Apprenticeship learning via inverse reinforcement learning , 2004, ICML.

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

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

[10]  S. King Learning to fly. , 1998, Nursing Times.

[11]  Pradeep K. Khosla,et al.  Real-time obstacle avoidance using harmonic potential functions , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

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

[13]  The success story of the transfer and development of methods from geophysics to helioseismology , 1996 .

[14]  Emilio Frazzoli,et al.  Anytime Motion Planning using the RRT* , 2011, 2011 IEEE International Conference on Robotics and Automation.

[15]  HansenPer Christian The truncated SVD as a method for regularization , 1987 .

[16]  Thomas G. Dietterich,et al.  Structured machine learning: the next ten years , 2008, Machine Learning.

[17]  Charles W. Warren,et al.  Global path planning using artificial potential fields , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[18]  Kostas J. Kyriakopoulos,et al.  Adjustable navigation functions for unknown sphere worlds , 2011, IEEE Conference on Decision and Control and European Control Conference.

[19]  Stefan Schaal,et al.  Robot Learning From Demonstration , 1997, ICML.