Distributed optimal consensus control for discrete-time multi-agent systems with composite switching topologies via an iterative Q-learning method

This paper aims to achieve distributed optimal consensus control for discrete-time multi-agent systems (MASs) under composite switching topologies through utilising the iterative Q-learning approach. First, the optimal consensus control strategy, independent of system dynamics information, is developed by using the designed iterative Q-learning approach to guarantee that all follower states can synchronise to the desired trajectory formulated by the leader. Compared with the invariable algebraic or edge-fixed topology structures, the designed Q-learning control algorithm in this paper is implemented based on the composite switching topologies consisting of periodic and stochastic mechanisms. Then, an error dynamic system is established, which transforms the optimal consensus control issue into an optimal regulation issue and removes the influence of the two types of switching topologies. To conquer the problems of lack of model information and the inaccessible analytical solution of Hamilton-Jacobi-Isaacs (HJI) equation, an iterative Q-learning approach is designed according to the reconstructed Q-function Bellman equation. Through further iterative learning, the optimal control strategy can be acquired so as to realise consensus control and ensure the stability of the closed-loop systems. Finally, two simulation examples are provided to demonstrate the effectiveness of the proposed distributed optimal control scheme.

Authors

Institutions

Publication Details

Journal
International Journal of Systems Science
Published
2024-11-20
DOI
https://doi.org/10.1080/00207721.2024.2429027
Primary Topic
Adaptive Dynamic Programming Control
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Distributed optimal consensus control for discrete-time multi-agent systems with composite switching topologies via an iterative Q-learning method

Ning Zhao, Li Ren, Madini Obad Alassafi, Zhenhuan Wang et al.
International Journal of Systems Science
Adaptive Dynamic Programming Control
article

Distributed optimal consensus control for discrete-time multi-agent systems with composite switching topologies via an iterative Q-learning method

Ning Zhao, Li Ren, Madini Obad Alassafi, Zhenhuan Wang, Fanghua Tang
article en

Abstract

This paper aims to achieve distributed optimal consensus control for discrete-time multi-agent systems (MASs) under composite switching topologies through utilising the iterative Q-learning approach. First, the optimal consensus control strategy, independent of system dynamics information, is developed by using the designed iterative Q-learning approach to guarantee that all follower states can synchronise to the desired trajectory formulated by the leader. Compared with the invariable algebraic or edge-fixed topology structures, the designed Q-learning control algorithm in this paper is implemented based on the composite switching topologies consisting of periodic and stochastic mechanisms. Then, an error dynamic system is established, which transforms the optimal consensus control issue into an optimal regulation issue and removes the influence of the two types of switching topologies. To conquer the problems of lack of model information and the inaccessible analytical solution of Hamilton-Jacobi-Isaacs (HJI) equation, an iterative Q-learning approach is designed according to the reconstructed Q-function Bellman equation. Through further iterative learning, the optimal control strategy can be acquired so as to realise consensus control and ensure the stability of the closed-loop systems. Finally, two simulation examples are provided to demonstrate the effectiveness of the proposed distributed optimal control scheme.

International Journal of Systems ScienceVol. 56(8)
Harbin Institute of Technology (CN), China Electronics Corporation (China) (CN), Heilongjiang Institute of Technology (CN), Bohai University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 75%
Adaptive Dynamic Programming Control
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.