2000 年 36 巻 4 号 p. 356-363
In this paper, a learning algorithm is constructed for variable hierarchical structure learning automata with P-model stationary random environments at each level. The learning propertiy of our algorithm is considered theoretically, and it is proved that the probability finding the optimal objective path can be approached 1 as much as possible by using our algorithm. In numerical simulation, the usefulness of our algorithm is shown.