• DocumentCode
    2258012
  • Title

    Double-Safe-Edges Algorithm (DSE): A New Real-Time Path Planning Approach

  • Author

    Wu Xin-an ; Yao, Sun ; Yu-Xin, Zhao

  • Author_Institution
    Coll. of Autom., Harbin Eng. Univ., Harbin
  • Volume
    1
  • fYear
    2008
  • fDate
    20-22 Dec. 2008
  • Firstpage
    13
  • Lastpage
    17
  • Abstract
    This paper presents a new real-time path planning algorithm in dynamic uncertainty environment, and it has well real-time and high applicability. This algorithm is composed by two parts. The first part is the analysis and interpretation of the environment information by searching the characteristic information (double safe edges DSE), so the algorithm can catch the dynamic obstacle and estimate the state of the dynamic obstacle, and update the characteristic information to the second part of the algorithm at the same time. The second part is the choice of the local goal to generate the motion command by using the heuristic algorithm. The heuristic is a rule which can choice the optimal local goal through the cost function. These two parts of the algorithm will plan the path at each time until the robot reach the goal. The result of the simulation has proved that the DSE algorithm has well real-time and high applicability in dynamic uncertainty environment.
  • Keywords
    collision avoidance; mobile robots; uncertain systems; double-safe-edges algorithm; dynamic obstacle; dynamic uncertainty; heuristic algorithm; motion command; optimal local goal; real-time path planning approach; Algorithm design and analysis; Cost function; Heuristic algorithms; Information analysis; Information technology; Motion analysis; Path planning; Robot motion; Sun; Uncertainty; dynamic uncertainty environment; heuristic algorithm; path planning; real-time;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Information Technology Application, 2008. IITA '08. Second International Symposium on
  • Conference_Location
    Shanghai
  • Print_ISBN
    978-0-7695-3497-8
  • Type

    conf

  • DOI
    10.1109/IITA.2008.290
  • Filename
    4739526