.png){kind=icon}
Return
Q-learning algorithm in solving consensusability problem of discrete-time multi-agent systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2021.109576.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper solves the consensusability problem for the single-input discrete-time multi-agent system (MAS) over directed graphs by the linear quadratic regulator (LQR) design method. It is proved that the maximum consensus region is exactly the largest gain margin (GM) of LQR. Based on this, the necessary and sufficient condition on consensusability is derived by solving a standard algebraic Riccati equation (ARE). The developed framework permits that the consensusability problem can be solved when the agents' models are completely unavailable. Q-learning algorithm is employed to compute the maximum consensus region and implement the consensus protocol design. The algorithm runs only on a single agent rather than the intercommunicating MAS hence the unattainable initial admissible protocols are not required. A numerical example is given to illustrate the effectiveness of the developed methods. (c) 2021 Elsevier Ltd. All rights reserved.
Keywords:
Consensusability
Consensus region
Linear quadratic regulator (LQR)
Q-learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
Cited Papers
ShareSaveShareSaveConsensusability of Multiagent Systems With Delay and Packet Dropout Under Predictor-Like Protocols
OAAI
OAAIShareSave
H∞ almost state synchronization for homogeneous networks of non-introspective agents: A scale-free protocol design.png)
AUTOMATICAOAAI
AUTOMATICAIF5.9
OAAIShareSaveShareSaveSynchronization of discrete-time multi-agent systems on graphs using Riccati designAUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSave
View more