An Improvement of D* algorithm for Mobile Robot Path Planning in Partial Unknown Environment
An important problem in autonomous mobile robot (Mobot) navigation is that the mobot can effectively plan a path in the unknown or partial unknown environment. Its unpractical to know the environment completely. These factors, such as bias of environmental expression and change of obstacles state, will cause incomplete information of environment. In this case, the motion planning must be implemented in real-time. It is obvious that path planning in dynamic or partially known environment is a difficult problem to solve in practice. D* algorithm combines local planning and global planning, makes sufficient use of global environment and information from sensors, that had tested in the practice application. In this paper we analysis at the situation of partially known environment, and use D* algorithm to process the path planning. The improvement of D* algorithm is presented to plan better path. First, the model of 2D workspace with some obstacles is expressed in regularity grids. Optimal path is planned by using the improved D* algorithm by searching in the neighbor grid cells on 16 directions. It makes the robot that the smallest turning angle drops to π /8. The mobot moving angle discrete precision is raised and the unnecessary cost of path planning is reduced. So the mobot motion path is smoother. Then the improved D* algorithm is tested in WiRobotX80 mobile robot. Experiment results show that the improved D* algorithm is effective and it can result in higher quality path than the conventional D* algorithm in the same map environment.
mobile robot D* algorithm path planning partial unknown environment
Jianming GUO Liang LIU Qing Liu Yongyu Qu
School of Automation Wuhan University of Technology Wuhan Hubei,430063 P.R.China
国际会议
长沙
英文
2320-2323
2009-10-10（万方平台首次上网日期，不代表论文的发表时间）