A New Developed Q‐Learning Algorithm for Consensusability Problem of Model Unavailable Multi‐Agent System via Modified Riccati Design

ABSTRACT This paper solves the consensusability problem of the model unavailable discrete‐time single‐input multi‐agent system (MAS) over directed graphs by the modified Riccati design method. Firstly, a new iterative method is proposed to solve the modified algebraic Riccati equation (MARE) for synthesizing the stabilized feedback control gain which permits an arbitrary selection of the initial values. Then, the maximum guaranteed gain margin (GGM) yielded by the feedback control gain is rigorously derived for the first time and used to establish the necessary and sufficient condition for consensusability of the MAS. Furthermore, it is proved that in the sense of the radial projection, the maximum GGM is completely independent of the characteristic parameter of the MARE and identical to that of the standard discrete‐time algebraic Riccati equation (DARE). Benefit from the structure of the developed method, the Q‐Learning (QL) algorithm is employed to establish the consensusability criterion and implement the distributed design when the system model is entirely unavailable. Finally, the effectiveness of the proposed theoretical result and developed algorithm is verified by the numerical simulation.

Authors

Institutions

Publication Details

Journal
International Journal of Robust and Nonlinear Control
Published
2026-04-01
DOI
https://doi.org/10.1002/rnc.70533
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A New Developed Q‐Learning Algorithm for Consensusability Problem of Model Unavailable Multi‐Agent System via Modified Riccati Design

Fei Yan, Jilie Zhang, Jie Gao, Tao Feng
International Journal of Robust and Nonlinear Control
Distributed Control Multi-Agent Systems
article

A New Developed Q‐Learning Algorithm for Consensusability Problem of Model Unavailable Multi‐Agent System via Modified Riccati Design

Fei Yan, Jilie Zhang, Jie Gao, Tao Feng
article en

Abstract

ABSTRACT This paper solves the consensusability problem of the model unavailable discrete‐time single‐input multi‐agent system (MAS) over directed graphs by the modified Riccati design method. Firstly, a new iterative method is proposed to solve the modified algebraic Riccati equation (MARE) for synthesizing the stabilized feedback control gain which permits an arbitrary selection of the initial values. Then, the maximum guaranteed gain margin (GGM) yielded by the feedback control gain is rigorously derived for the first time and used to establish the necessary and sufficient condition for consensusability of the MAS. Furthermore, it is proved that in the sense of the radial projection, the maximum GGM is completely independent of the characteristic parameter of the MARE and identical to that of the standard discrete‐time algebraic Riccati equation (DARE). Benefit from the structure of the developed method, the Q‐Learning (QL) algorithm is employed to establish the consensusability criterion and implement the distributed design when the system model is entirely unavailable. Finally, the effectiveness of the proposed theoretical result and developed algorithm is verified by the numerical simulation.

International Journal of Robust and Nonlinear Control
Southwest Jiaotong University (CN)
National Natural Science Foundation of China, Natural Science Foundation of Sichuan Province
Openalex Percentile: Top 32%
Distributed Control Multi-Agent Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.