Genetic algorithm based solution to dead-end problems in robot navigation

Xiaoming Kang, Yong Yue*, Dayou Li, Carsten Maple

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

22 Citations (Scopus)
Plum Print visual indicator of research metrics
  • Citations
    • Citation Indexes: 22
  • Captures
    • Readers: 13
see details

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.

Original languageEnglish
Pages (from-to)177-184
Number of pages8
JournalInternational Journal of Computer Applications in Technology
Volume41
Issue number3-4
DOIs
Publication statusPublished - Sept 2011
Externally publishedYes

Keywords

  • Dead end
  • Genetic algorithm
  • Obstacle avoidance
  • Robot navigation

Cite this

Kang, X., Yue, Y., Li, D., & Maple, C. (2011). Genetic algorithm based solution to dead-end problems in robot navigation. International Journal of Computer Applications in Technology, 41(3-4), 177-184. https://doi.org/10.1504/IJCAT.2011.042693