Fujipress Home | Search | About FINDER

Paper:
Language: English:

An Integrated Algorithm for Autonomous Navigation of a Mobile Robot in an Unknown Environment


Lee Gim Hee* and Marcelo H. Ang Jr.**


*DSO National Laboratories
20 Science Park Drive, Singapore 118230
Email: lgimhee@dso.org.sg
**Department of Mechanical Engineering, National University of Singapore
9 Engineering Drive 1, Singapore 117576
Email: mpeangh@nus.edu.sg


Received: April 23, 2007

Accepted: July 3, 2007


Keywords: global path planner, local navigation method, local minima, hybrid method, integrated algorithm

Journal ref: Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol.12, No.4 pp. 328-335, 2008

Abstract



Global path planning algorithms are good in planning an optimal path in a known environment, but would fail in an unknown environment and when reacting to dynamic and unforeseen obstacles. Conversely, local navigation algorithms perform well in reacting to dynamic and unforeseen obstacles but are susceptible to local minima failures. A hybrid integration of both the global path planning and local navigation algorithms would allow a mobile robot to find an optimal path and react to any dynamic and unforeseen obstacles during an operation. However, the hybrid method requires the robot to possess full or partial prior information of the environment for path planning and would fail in a totally unknown environment. The integrated algorithm proposed and implemented in this paper incorporates an autonomous exploration technique into the hybrid method. The algorithm gives a mobile robot the ability to plan an optimal path and does online collision avoidance in a totally unknown environment.
preview Preview (PDF)  full text Full Text (PDF 344KB)

Reference

[Notice]
* "Preview" is the first 2 pages of the article. You don't need the registration.
* To read the PDF file you will then need to download and install the Adobe Reader.
Adobe Reader is free and available for download here:

adobe reader

Terms and Conditions | Privacy Policy | Recruit | Advertising Information | Contact Us