Delaunay Graph Based Path Planning of Dynamic Obstacle Avoidance Method for Mobile
This paper is about dynamic obstacle avoidance. Delaunay Graph is used for modeling the working space, an approximate shortest path of mobile robot is determined by using floyd algorithm. Path can be found easily with genetic algorithm. Then genetic algorithm is used for obtaining the optimum path. It may meet which dynamic obstacle when robot follows optimum path. so it should avoid it. Results of simulation show that this path planning method is simple and realized easily.
H. Y. Dong et al., "Delaunay Graph Based Path Planning of Dynamic Obstacle Avoidance Method for Mobile", Advanced Materials Research, Vols. 217-218, pp. 1775-1780, 2011