A Path & velocity profile planning based on a* algorithm for dynamic environment

  • Kwon, M.
  • Kang, Y.
  • Kim, C.
  • Park, G.
Citations

SCOPUS

1

초록

This paper presents a hierarchical trajectory planning method which can handle a collision-free of the planned path in complex and dynamic environments. A PV (Path & Velocity profile) planning method minimizes a sharp change of orientation and waiting time to avoid a collision with moving obstacle through detour path. The path generation problem is solved by three steps. In the first step, a smooth global path is generated using A* algorithm. The second step sets up the velocity profile for the optimization problem considering the maximum velocity and acceleration. In the third step, the velocity profile for obtaining the shortest path is optimized using the fuzzy and genetic algorithm. To show the validity and effectiveness of the proposed method, realistic simulations are performed. © ICROS 2011.

키워드

A* algorithmMobile robotObstacle avoidanceOptimal path planningDetour pathsDynamic environmentsHierarchical trajectoryMaximum velocityMoving obstaclesOptimal path planningOptimization problemsPath generationPlanning methodRealistic simulationShortest pathVelocity profilesWaiting-timeAlgorithmsCollision avoidanceMobile robotsMotion planningOptimizationVelocity
제목
A Path & velocity profile planning based on a* algorithm for dynamic environment
저자
Kwon, M.Kang, Y.Kim, C.Park, G.
DOI
10.5302/J.ICROS.2011.17.5.405
발행일
2011
유형
Article
저널명
제어.로봇.시스템학회 논문지
17
5
페이지
405 ~ 411