The full text of this article

 

Genetic algorithm based solution to dead-end problems in robot navigation
by Xiaoming Kang; Yong Yue; Dayou Li; Carsten Maple
International Journal of Computer Applications in Technology (IJCAT), Vol. 41, No. 3/4, 2011

 

Abstract: In robot navigation, mobile robots can suffer from dead-end problems, that is, they can be stuck in areas which are surrounded by obstacles. Attempts have been reported to avoid a robot entering into such a dead-end area. However, in some applications, for example, rescue work, the dead-end areas must be explored. Therefore, it is vital for the robot to come out from the dead-end areas after exploration. This paper presents an approach which enables a robot to come out from dead-end areas. There are two main parts: a dead-end detection mechanism and a genetic algorithm (GA) based online training mechanism. When the robot realises that it is stuck in a dead-end area, it will operate the online training to produce a new best chromosome that will enable the robot to escape from the area.

Online publication date: Sun, 25-Sep-2011

 

is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

 
Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

 
Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

 

    Username:        Password:         

Forgotten your password?


 
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

 
If you still need assistance, please email subs@inderscience.com