• DocumentCode
    3165968
  • Title

    Learning potential functions by demonstration for path planning

  • Author

    Winn, Andrew ; Xuemei Gao ; Mishra, Shivakant ; Julius, A. Agung

  • Author_Institution
    Dept. of Electr., Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA
  • fYear
    2012
  • fDate
    10-13 Dec. 2012
  • Firstpage
    4654
  • Lastpage
    4659
  • Abstract
    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.
  • Keywords
    collision avoidance; gradient methods; learning (artificial intelligence); search problems; agent behavior; gradient descent search algorithm; obstacle avoidance information; path planning; potential functions learning; pre-designed potential function; Humans; Machine learning algorithms; Radio frequency; Trajectory; Transforms; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control (CDC), 2012 IEEE 51st Annual Conference on
  • Conference_Location
    Maui, HI
  • ISSN
    0743-1546
  • Print_ISBN
    978-1-4673-2065-8
  • Electronic_ISBN
    0743-1546
  • Type

    conf

  • DOI
    10.1109/CDC.2012.6426153
  • Filename
    6426153