3D time-space path planning algorithm in dynamic environment utilizing Arrival Time Field and Heuristically Randomized Tree
Igi Ardiyanto, Jun Miura · 2012
This paper deals with a path planning problem in the dynamic and cluttered environments. The presence of moving obstacles and kinodynamic constraints of the robot increases the complexity of path planning problem. We model the environment and motion of dynamic obstacles in 3D time-space. We propose the utilization of the arrival time field for examining the most promising area in those obstacles-occupied 3D time-space for approaching the goal. The arrival time field is used for guiding the expansion of a randomized tree search in a favorable way, considering kinodynamic constraints of the robot. The quality and the optimality of the path are taken into account by performing heuristic methods on the randomized tree. Simulation results are also provided to prove the feasibility, possibility, and effectiveness of our algorithm.