Search Results for author:
Found 7 papers, 0 papers with code
Angle-Constrained Formation Control under Directed Non-Triangulated Sensing Graphs (Extended Version)
Angle-constrained formation control has attracted much attention from control community due to the advantage that inter-edge angles are invariant under uniform translations, rotations, and scalings of the whole formation.
Distributed Multi-Agent Reinforcement Learning Based on Graph-Induced Local Value Functions
Achieving distributed reinforcement learning (RL) for large-scale cooperative multi-agent systems (MASs) is challenging because: (i) each agent has access to only limited information; (ii) issues on convergence or computational complexity emerge due to the curse of dimensionality.
Multi-agent Reinforcement Learning
reinforcement-learning
+1
Distributed Cooperative Multi-Agent Reinforcement Learning with Directed Coordination Graph
In this work, we study MARLs with directed coordination graphs, and propose a distributed RL algorithm where the local policy evaluations are based on local value functions.
Multi-agent Reinforcement Learning
reinforcement-learning
+1
Asynchronous Distributed Reinforcement Learning for LQR Control via Zeroth-Order Block Coordinate Descent
Recently introduced distributed zeroth-order optimization (ZOO) algorithms have shown their utility in distributed reinforcement learning (RL).
Decomposability and Parallel Computation of Multi-Agent LQR
Conditions for decomposability, an algorithm for constructing the transformation matrix, a parallel RL algorithm, and robustness analysis when the design is applied to non-homogeneous MAS are presented.
Hierarchical Reinforcement Learning
Reinforcement Learning (RL)
Model-Free Optimal Control of Linear Multi-Agent Systems via Decomposition and Hierarchical Approximation
The first component optimizes the performance of each independent cluster by solving the smaller-size LQR design problem in a model-free way using an RL algorithm.
Angle-Based Sensor Network Localization
Graphical conditions for equivalence of the formulated rank-constrained SDP and a linear SDP, decomposition of the SDP, as well as the effectiveness of the distributed protocol, are proposed, respectively.
