Consensus Control and Optimization of Time-Delayed Multiagent Systems: Analysis on Different Order-Reduction Methods

This article addresses the consensus control and optimization issue for multiagent systems (MASs) with time-varying delay. Different from existing ones, an order-reduction method (ORM) is proposed to reduce the order of linear matrix inequalities (LMIs) without a complicated calculation process. The problem of complexity explosion caused by using LMI to analyze MASs is solved. To start with, we discuss and compare the existing ORMs and our ORM, respectively. Subsequently, under this improved ORM and the quadratic-delay-product method, a modified Lyapunov-Krasovskii functional (LKF) is constructed to obtain a less conservative consensus criterion. Then, we put forward a consensus controller which allows larger time delay upper bound. In addition, based on the self-adaptive differential evolution (DE) algorithm, the performance of the controller is significantly optimized. It is strictly proved that the designed controller can guarantee the realization of consensus and the LMI method used is feasible because it is independent of the number of agents. Finally, the simulation and comparison results illustrate the superiority of the theoretical results over others.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Systems Man and Cybernetics Systems
Published
2024-11-19
DOI
https://doi.org/10.1109/tsmc.2024.3492335
Citations
73
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
25.47

Funders

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

Consensus Control and Optimization of Time-Delayed Multiagent Systems: Analysis on Different Order-Reduction Methods

Xiao‐Jie Peng, Hongyi Li, Shengnan Tian, Yong He
73 citations
IEEE Transactions on Systems Man and Cybernetics Systems
Distributed Control Multi-Agent Systems
25.47
article

Consensus Control and Optimization of Time-Delayed Multiagent Systems: Analysis on Different Order-Reduction Methods

Xiao‐Jie Peng, Hongyi Li, Shengnan Tian, Yong He
article en
73 citations

Abstract

This article addresses the consensus control and optimization issue for multiagent systems (MASs) with time-varying delay. Different from existing ones, an order-reduction method (ORM) is proposed to reduce the order of linear matrix inequalities (LMIs) without a complicated calculation process. The problem of complexity explosion caused by using LMI to analyze MASs is solved. To start with, we discuss and compare the existing ORMs and our ORM, respectively. Subsequently, under this improved ORM and the quadratic-delay-product method, a modified Lyapunov-Krasovskii functional (LKF) is constructed to obtain a less conservative consensus criterion. Then, we put forward a consensus controller which allows larger time delay upper bound. In addition, based on the self-adaptive differential evolution (DE) algorithm, the performance of the controller is significantly optimized. It is strictly proved that the designed controller can guarantee the realization of consensus and the LMI method used is feasible because it is independent of the number of agents. Finally, the simulation and comparison results illustrate the superiority of the theoretical results over others.

IEEE Transactions on Systems Man and Cybernetics SystemsVol. 55(1)
Southwest University (CN), China University of Geosciences (CN)
National Natural Science Foundation of China, Higher Education Discipline Innovation Project
Openalex Percentile: Top 0%
Distributed Control Multi-Agent Systems
25.47
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.