Virtual local target method for avoiding local minimum in potential field based robot navigation.
A novel robot navigation algorithm with global path generation capability is presented. Local minimum is a most intractable but is an encountered frequently problem in potential field based robot navigation. Through appointing appropriately some virtual local targets on the journey, it can be solved effectively. The key concept employed in this algorithm are the rules that govern when and how to appoint these virtual local targets. When the robot finds itself in danger of local minimum, a virtual local target is appointed to replace the global goal temporarily according to the rules. After the virtual target is reached, the robot continues on its journey by heading towards the global goal. The algorithm prevents the robot from running into local minima anymore. Simulation results showed that it is very effective in complex obstacle environments.
Zou
Xi-Yong
XY
College of Electrical Engineering, National Laboratory of Industrial Control Technology, Zhejiang University, Hangzhou 310027, China. zouxiyong@163.net
Zhu
Jing
J
D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D007091:Image Processing, Computer-Assisted / Q000379:methods*; D018782:Maze Learning; D009038:Motion; D009949:Orientation; D010363:Pattern Recognition, Automated; D012371:Robotics / Q000379:methods*; D013028:Space Perception