Discretized pursuit learning automata

DOI10.1109/21.105092zbMath0709.68064OpenAlexW1996494912WikidataQ60328288 ScholiaQ60328288MaRDI QIDQ3493280

B. John Oommen, J. Kevin Lanctot

Publication date: 1990

Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/21.105092

zbMATH Keywords

stochastic learning automatonpursuit automaton

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Related Items (10)

On ε-Optimality of the Pursuit Learning Algorithm ⋮ Stochastic learning-based weak estimation of multinomial random variables and its applications to pattern recognition in non-stationary environments ⋮ A strategy for controlling nonlinear systems using a learning automaton ⋮ Solving two‐armed Bernoulli bandit problems using a Bayesian learning automaton ⋮ A novel technique for stochastic root-finding: enhancing the search with adaptive \(d\)-ary search ⋮ A new continuous action-set learning automaton for function optimization ⋮ A learning automata based algorithm for optimization of continuous complex functions ⋮ The design of absorbing Bayesian pursuit algorithms and the formal analyses of their \(\varepsilon\)-optimality ⋮ Absorbing stochastic estimator learning automata for S-model stationary environments ⋮ Multi-modal parameter optimization by the automata approach

This page was built for publication: Discretized pursuit learning automata