Journal
of Zhejiang University SCIENCE
(ISSN 1009-3095, Monthly)
2003
Vol. 4 No. 3 p.264-269
|
Virtual local target method for avoiding local minimum in potential field based robot navigation ZOU
Xi-yong(×ÞϸÓÂ)(College of Electrical Engineering, National Laboratory of
Industrial Control Technology,Zhejiang University, Hangzhou 310027,
China) Abstract: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. |
| Foundation Item:Project (No.
69904009) supported by the National Natural Science Foundation of China
Author Resume:ZOU Xi-yong,E-mail: zouxiyong@163.net References: [1]Borenstein, J. and Koren, Y.,
1989. Real-time obstacle avoidance for fast mobile robots. IEEE Trans. On
Systems, Man and Cybernetics, 19(5):1179-1187. |
|
Manuscript Received:2002 June 3 Manuscript Revised:2002 Aug. 10 Published:2003 June 1 |