2002•Unpublished venueRequires access

Hierarchical discretized pursuit nonlinear learning automata

Athanasios V. Vasilakos, Georgios I. Papadimitriou, Constantinos T. Paximadis

Open publisher page 0 citations

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.>

About this research paper

What this paper is about

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.>

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.>

Key concepts: Learning automata, Discretization, Automaton, Convergence (economics), Computer science, Nonlinear system, Two-way deterministic finite automaton, Deterministic automaton

Related papers

Back to paper searchBrowse research topicsOriginal source
Hierarchical discretized pursuit nonlinear learning automata — Research Paper | ScholarLens