DocumentCode
3335003
Title
Genetic algorithm in robot path planning problem in crisp and fuzzified environments
Author
Sadati, Nasser ; Taheri, Javid
Author_Institution
Dept. of Electr. Eng., Sharif Univ. of Technol., Tehran, Iran
Volume
1
fYear
2002
fDate
2002
Firstpage
175
Abstract
Two approaches, using the combination of a Hopfield neural network and a genetic algorithm for solving the robot motion planning problem both in crisp and fuzzified environments are presented. Based on the hypothesis of genetic algorithms, the genomes and chromosomes of the algorithm are modified so that they can be used to solve the motion planning problem. Because some problem restrictions and limits hinder us in using the generic genetic algorithm; some modifications are applied to the main algorithm to able us to solve the problem. Although the proposed algorithms both rely on a genetic algorithm, the heart of both is based on a Hopfield neural network robot path planner to find some partial answers in the robot´s environment. In other words, in each new generation cycle of the main genetic algorithm, the Hopfield neural network path planner is launched regularly to improve the quality of each chromosome by reforming it. Simulation results demonstrate the correctness and efficiency of the proposed techniques.
Keywords
Hopfield neural nets; genetic algorithms; mobile robots; path planning; Hopfield neural network; crisp environments; crossover operator; fuzzified environments; genetic algorithm; mutation operator; robot motion planning problem; robot path planning; Biological cells; Genetic algorithms; Hopfield neural networks; Intelligent networks; Mobile robots; Motion planning; Orbital robotics; Path planning; Robot motion; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial Technology, 2002. IEEE ICIT '02. 2002 IEEE International Conference on
Print_ISBN
0-7803-7657-9
Type
conf
DOI
10.1109/ICIT.2002.1189886
Filename
1189886
Link To Document