Oct 3, 2023 · This work proposes a novel pursuit learning scheme, called a discretized equal pursuit reward-inaction algorithm for arbitrary subset selection.
Dec 19, 2023 · It can address problems, such as selecting the optimal subset, the best and worst actions, actions in a given rank range, actions with odd/even ...
As a powerful reinforcement learning method, the learning automaton (LA) has been studied, analyzed, and applied to various engineering systems for decades.
The proposed scheme pursues the currently estimated arbitrary action subset and makes the probabilities of selecting each action in the subset equal, so as to ...
Simulation results of comparison experiments, parameter analysis, and a real-world application demonstrate the power of a novel pursuit learning scheme, ...
A New Learning Automaton for Selecting an Arbitrary Subset of Actions. Junqi Zhang, Peng Zu, Peng Zhan Qiu, Meng Chu Zhou · Electrical and Computer Engineering.
A new class of learning automata for the purpose of learning the optimal subset of actions has been proposed to fulfill the demand of application such as ...
May 5, 2016 · A New Learning Automaton for Selecting an Arbitrary Subset of Actions. 2024, IEEE Transactions on Systems, Man, and Cybernetics: Systems. A ...
A New Learning Automaton for Selecting an Arbitrary Subset of Actions · Junqi ZhangPeng ZuPengzhan QiuMengchu Zhou. Computer Science. IEEE Transactions on ...
This is a survey on active automata learning. Automata learning, or model learning, aims to construct black-box state diagram models of software and hardware ...