2.50
Hdl Handle:
http://hdl.handle.net/10547/250938
Title:
Genetic algorithm based solution to dead-end problems in robot navigation
Authors:
Kang, Xiaoming; Yue, Yong; Li, Dayou; Maple, Carsten
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.
Citation:
Genetic algorithm based solution to dead-end problems in robot navigation 2011, 41 (3/4):177-184 International Journal of Computer Applications in Technology
Publisher:
Inderscience
Journal:
International Journal of Computer Applications in Technology
Issue Date:
2011
URI:
http://hdl.handle.net/10547/250938
DOI:
10.1504/IJCAT.2011.042693
Additional Links:
http://www.inderscience.com/link.php?id=42693
Type:
Article
Language:
en
ISSN:
0952-8091; 1741-5047
Appears in Collections:
Centre for Research in Distributed Technologies (CREDIT)

Full metadata record

DC FieldValue Language
dc.contributor.authorKang, Xiaomingen_GB
dc.contributor.authorYue, Yongen_GB
dc.contributor.authorLi, Dayouen_GB
dc.contributor.authorMaple, Carstenen_GB
dc.date.accessioned2012-11-05T09:43:28Z-
dc.date.available2012-11-05T09:43:28Z-
dc.date.issued2011-
dc.identifier.citationGenetic algorithm based solution to dead-end problems in robot navigation 2011, 41 (3/4):177-184 International Journal of Computer Applications in Technologyen_GB
dc.identifier.issn0952-8091-
dc.identifier.issn1741-5047-
dc.identifier.doi10.1504/IJCAT.2011.042693-
dc.identifier.urihttp://hdl.handle.net/10547/250938-
dc.description.abstractIn 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.en_GB
dc.language.isoenen
dc.publisherInderscienceen_GB
dc.relation.urlhttp://www.inderscience.com/link.php?id=42693en_GB
dc.rightsArchived with thanks to International Journal of Computer Applications in Technologyen_GB
dc.subjectdead end areasen_GB
dc.subjectgenetic algorithmsen_GB
dc.subjectobstacle avoidanceen_GB
dc.subjectrobot navigationen_GB
dc.subjectmobile robotsen_GB
dc.subjectrobotic explorationen_GB
dc.subjectdead-end detectionen_GB
dc.subjectescape mechanismsen_GB
dc.subjectdead endsen_GB
dc.titleGenetic algorithm based solution to dead-end problems in robot navigationen
dc.typeArticleen
dc.identifier.journalInternational Journal of Computer Applications in Technologyen_GB
All Items in UOBREP are protected by copyright, with all rights reserved, unless otherwise indicated.