抄録
This paper is concemed with an intelligent behavior of mobile robots going through a maze having numbers of gates that close with unknown rejecting probabilities.
After the brief introduction concerning leaming behaviors of the hierarchical structure stochastic automata, the absolutely expedient leaming algorithm under the nonstationary multiteacher environment is proposed. It is shown that the hierarchical structure stochastic automata with this algorithm can be successfully applied in order to let mobile robots gradually find the best way in the maze.
