scholarly journals Multi-Agent Reinforcement Learning Using Linear Fuzzy Model Applied to Cooperative Mobile Robots

Symmetry ◽  
2018 ◽  
Vol 10 (10) ◽  
pp. 461 ◽  
Author(s):  
David Luviano-Cruz ◽  
Francesco Garcia-Luna ◽  
Luis Pérez-Domínguez ◽  
S. Gadi
Keyword(s):  
Reinforcement Learning ◽  
Mobile Robots ◽  
State Space ◽  
Fuzzy Model ◽  
Discrete State ◽  
Continuous State Space ◽  
Continuous State ◽  
Multi Agent ◽  
Successful Approach ◽  
Q Function

A multi-agent system (MAS) is suitable for addressing tasks in a variety of domains without any programmed behaviors, which makes it ideal for the problems associated with the mobile robots. Reinforcement learning (RL) is a successful approach used in the MASs to acquire new behaviors; most of these select exact Q-values in small discrete state space and action space. This article presents a joint Q-function linearly fuzzified for a MAS’ continuous state space, which overcomes the dimensionality problem. Also, this article gives a proof for the convergence and existence of the solution proposed by the algorithm presented. This article also discusses the numerical simulations and experimental results that were carried out to validate the proposed algorithm.

scholarly journals Reinforcement learning versus swarm intelligence for autonomous multi-HAPS coordination

2021 ◽  
Vol 3 (6) ◽  
Author(s):  
Ogbonnaya Anicho ◽  
Philip B. Charlesworth ◽  
Gurvinder S. Baicher ◽  
Atulya K. Nagar
Keyword(s):  
Reinforcement Learning ◽  
State Space ◽  
Swarm Intelligence ◽  
Performance Indicators ◽  
Convergence Rates ◽  
Tuning Parameters ◽  
Continuous State Space ◽  
Continuous State ◽  
User Coverage ◽  
Better Than

AbstractThis work analyses the performance of Reinforcement Learning (RL) versus Swarm Intelligence (SI) for coordinating multiple unmanned High Altitude Platform Stations (HAPS) for communications area coverage. It builds upon previous work which looked at various elements of both algorithms. The main aim of this paper is to address the continuous state-space challenge within this work by using partitioning to manage the high dimensionality problem. This enabled comparing the performance of the classical cases of both RL and SI establishing a baseline for future comparisons of improved versions. From previous work, SI was observed to perform better across various key performance indicators. However, after tuning parameters and empirically choosing suitable partitioning ratio for the RL state space, it was observed that the SI algorithm still maintained superior coordination capability by achieving higher mean overall user coverage (about 20% better than the RL algorithm), in addition to faster convergence rates. Though the RL technique showed better average peak user coverage, the unpredictable coverage dip was a key weakness, making SI a more suitable algorithm within the context of this work.

Asymptotic behaviour of continuous time, continuous state-space branching processes

1974 ◽  
Vol 11 (04) ◽  
pp. 669-677 ◽  
Author(s):  
D. R. Grey
Keyword(s):  
Asymptotic Behaviour ◽  
State Space ◽  
Discrete Time ◽  
Continuous Time ◽  
Branching Processes ◽  
Discrete State ◽  
Space And Time ◽  
Continuous State Space ◽  
Continuous State ◽  
Discrete State Space

Results on the behaviour of Markov branching processes as time goes to infinity, hitherto obtained for models which assume a discrete state-space or discrete time or both, are here generalised to a model with both state-space and time continuous. The results are similar but the methods not always so.

A STATISTICAL METHOD FOR DETECTING CYCLES IN DISCRETE DYNAMICAL SYSTEMS

1996 ◽  
Vol 06 (12a) ◽  
pp. 2375-2388 ◽  
Author(s):  
MARKUS LOHMANN ◽  
JAN WENZELBURGER
Keyword(s):  
Dynamical Systems ◽  
State Space ◽  
Statistical Method ◽  
Basins Of Attraction ◽  
Discrete State ◽  
Continuous State Space ◽  
Continuous State ◽  
Long Term Behavior ◽  
Discrete Time Dynamical Systems

This paper introduces a statistical method for detecting cycles in discrete time dynamical systems. The continuous state space is replaced by a discrete one consisting of cells. Hashing is used to represent the cells in the computer’s memory. An algorithm for a two-parameter bifurcation analysis is presented which uses the statistical method to detect cycles in the discrete state space. The output of this analysis is a colored cartogram where parameter regions are marked according to the long-term behavior of the system. Moreover, the algorithm allows the computation of basins of attraction of cycles.

Sign in / Sign up

Export Citation Format

Share Document