• DocumentCode
    3175087
  • Title

    Path planning: an approach based on connecting all the minimizers and maximizers of a potential function

  • Author

    Shashikala, H. ; Sancheti, N.K. ; Keerthi, S.S.

  • Author_Institution
    Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India
  • fYear
    1992
  • fDate
    12-14 May 1992
  • Firstpage
    2309
  • Abstract
    An improved potential-based method for robot path planning is developed by connecting all the local minima and local maxima of the potential function defined in the configuration space of the robot. The authors construct an adjacency graph of the local minima and maxima of the potential function. An edge connecting a local minimum and a local maximum has an associated pair of perturbations which gives a way of moving between them. The method is based on the stability theory of dynamical systems. The usefulness of the method was demonstrated on a two-dimensional piano mover´s problem with three degrees of freedom
  • Keywords
    graph theory; optimisation; path planning; robots; stability; 2D piano mover problem; adjacency graph; local maxima; local minima; potential function; robot path planning; stability theory; Computer science; Feedback control; Joining processes; Kinematics; Motion planning; Orbital robotics; Path planning; Polynomials; Robotics and automation; Stability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Robotics and Automation, 1992. Proceedings., 1992 IEEE International Conference on
  • Conference_Location
    Nice
  • Print_ISBN
    0-8186-2720-4
  • Type

    conf

  • DOI
    10.1109/ROBOT.1992.219915
  • Filename
    219915