A genetic algorithm for robot navigation

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The sensory capabilities of the human brain makes it possible for even blind people to maneuver through unfamiliar terrain with the help of guiding devices. However, the abilities of modern robots are not so sophisticated. Given a terrain with obstacles, determining an optimally short robot navigation path poses a major search problem. In this paper, a genetic search method is developed to solve the robot navigation problem. The search node or path is represented by a string of integers, each integer representing a cell in the terrain. Simulation results comparing the proposed genetic algorithm and a sequential navigation algorithm are presented.

Cite

CITATION STYLE

APA

Calaiselvy, Foo, T. Y., & Lee, W. P. (2004). A genetic algorithm for robot navigation. In Lecture Notes in Computer Science (Vol. 3320, pp. 314–317). Springer Verlag. https://doi.org/10.1007/978-3-540-30501-9_66

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free