Hierarchical discretized pursuit nonlinear learning automata
Athanasios V. Vasilakos, Georgios I. Papadimitriou, Constantinos T. Paximadis
Abstract
Athanasios V. Vasilakos, Georgios I. Papadimitriou, Constantinos T. Paximadis
Abstract
A new absorbing multiaction learning automaton is presented which is epsilon-optimal. The proposed automaton (named HDPNRI) is a hierarchical discretized nonlinear one which utilizes a new pursuit learning algorithm. The HDPNRI automaton has the best performance (speed of convergence, CPU time and accuracy) among all the absorbing learning automata reported in the literature. Extensive simulation results indicate the superiority of HDPNRI's performance. Furthermore, it is proved that the HDPNRI learning automaton is epsilon-optimal in every stationary environment.>
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A new absorbing multiaction learning automaton is presented which is epsilon-optimal. The proposed automaton (named HDPNRI) is a hierarchical discretized nonlinear one which utilizes a new pursuit learning algorithm. The HDPNRI automaton has the best performance (speed of convergence, CPU time and accuracy) among all the absorbing learning automata reported in the literature. Extensive simulation results indicate the superiority of HDPNRI's performance. Furthermore, it is proved that the HDPNRI learning automaton is epsilon-optimal in every stationary environment.>
Key concepts: Learning automata, Discretization, Automaton, Convergence (economics), Computer science, Nonlinear system, Two-way deterministic finite automaton, Deterministic automaton