Genetic algorithm applied to maze passing problem of mobile robot-a comparison with the learning performance of the hierarchical structure stochastic automata

The study of genetic algorithms has been done quite extensively by many researchers. It has now reached certain level of maturity. However, only few of the comparisons with other optimization methods have been reported so far. In this paper, the performance of the genetic algorithms is compared with that of the hierarchical structure stochastic automata by utilizing an example of maze passing problem of mobile robots. It appears that several computer simulation results contained in this paper may be helpful for the discussion concerning the efficiency of the genetic algorithms.<
>