scholarly journals Opposition-based discrete action reinforcement learning automata algorithmcase study: optimal design of a PID controller

2013 ◽  
Vol 21 ◽  
pp. 1603-1614 ◽  
Author(s):  
Fatemeh MOHSENI POUR ◽  
Ali Akbar GHARAVEISI
2009 ◽  
Vol 18 (08) ◽  
pp. 1609-1625 ◽  
Author(s):  
MOHAMMAD KASHKI ◽  
YOUSSEF L. ABDEL-MAGID ◽  
MOHAMMAD A. ABIDO

In this paper, a novel efficient optimization method based on reinforcement learning automata (RLA) for optimum parameters setting of conventional proportional-integral-derivative (PID) controller for AVR system of power synchronous generator is proposed. The proposed method is Combinatorial Discrete and Continuous Action Reinforcement Learning Automata (CDCARLA) which is able to explore and learn to improve control performance without the knowledge of the analytical system model. This paper demonstrates the full details of the CDCARLA technique and compares its performance with Particle Swarm Optimization (PSO) as an efficient evolutionary optimization method. The proposed method has been applied to PID controller design. The simulation results show the superior efficiency and robustness of the proposed method.


2021 ◽  
Author(s):  
Sourav Mondal ◽  
Goutam Das

Edge computing servers like cloudlets from different service providers compensate scarce computational and storage resources of mobile devices, are distributed across access networks. However, the dynamically varying computational requirements of associated mobile devices make cloudlets either overloaded or under-loaded. Hence, load balancing among neighboring cloudlets appears to be an essential research problem. Especially, the load balancing problem among federated cloudlets from the same as well as different service providers for low-latency applications needs significant attention. Thus, in this paper, we propose a decentralized load balancing framework among federated cloudlets for low-latency applications that focuses on latency bound rather than latency minimization. In this framework, we employ dynamic processor slicing for handling heterogeneous classes of job requests. We propose a continuous-action reinforcement learning automata-based algorithm that enables cloudlets to independently compute the load balancing strategies in a completely distributed network setting without any exhaustive control message exchange. To capture the economic interaction among federated cloudlets, we model this load balancing problem as an economic and non-cooperative game and by scaffolding the properties of the game formulation, we achieve faster convergence of the reinforcement learning automata. Furthermore, through extensive simulations, we study the impacts of exploration and exploitation on learning accuracy.


2016 ◽  
Vol 31 (1) ◽  
pp. 77-95
Author(s):  
Abdel Rodríguez ◽  
Peter Vrancx ◽  
Ricardo Grau ◽  
Ann Nowé

AbstractLearning automata are reinforcement learners belonging to the class of policy iterators. They have already been shown to exhibit nice convergence properties in a wide range of discrete action game settings. Recently, a new formulation for a continuous action reinforcement learning automata (CARLA) was proposed. In this paper, we study the behavior of these CARLA in continuous action games and propose a novel method for coordinated exploration of the joint-action space. Our method allows a team of independent learners, using CARLA, to find the optimal joint action in common interest settings. We first show that independent agents using CARLA will converge to a local optimum of the continuous action game. We then introduce a method for coordinated exploration which allows the team of agents to find the global optimum of the game. We validate our approach in a number of experiments.


Sign in / Sign up

Export Citation Format

Share Document