Self-Learning Control for Multi-Agent Consensus

This paper addresses the consensus problem in multi-agent systems via a self-learning control scheme that directly reuses prior control information to accelerate transient coordination while maintaining robustness. I study agents with linear dynamics and external disturbances, and design a lightweight self-learning consensus control law for the distributed consensus domain, formulated as ui(t)=k1ui(t−τ)+k2si(t) with learning intensity k1 and learning interval τ. I provide a Lyapunov-based stability proof showing uniform ultimate boundedness of the consensus error under bounded disturbances. Compared to non-learning consensus laws, the proposed strategy achieves faster agreement with reduced long-term effort and retains simplicity suitable for resource-constrained multi-agent platforms, while also achieving decent performance against external disturbances. Simulations validate the improved transient speed and steady accuracy. The full-version-source code is open-sourced.

Authors

Institutions

Publication Details

Journal
AppliedMath
Published
2026-03-03
DOI
https://doi.org/10.3390/appliedmath6030037
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Self-Learning Control for Multi-Agent Consensus

Chengxi Zhang
AppliedMath
Distributed Control Multi-Agent Systems
article

Self-Learning Control for Multi-Agent Consensus

Chengxi Zhang
article en

Abstract

This paper addresses the consensus problem in multi-agent systems via a self-learning control scheme that directly reuses prior control information to accelerate transient coordination while maintaining robustness. I study agents with linear dynamics and external disturbances, and design a lightweight self-learning consensus control law for the distributed consensus domain, formulated as ui(t)=k1ui(t−τ)+k2si(t) with learning intensity k1 and learning interval τ. I provide a Lyapunov-based stability proof showing uniform ultimate boundedness of the consensus error under bounded disturbances. Compared to non-learning consensus laws, the proposed strategy achieves faster agreement with reduced long-term effort and retains simplicity suitable for resource-constrained multi-agent platforms, while also achieving decent performance against external disturbances. Simulations validate the improved transient speed and steady accuracy. The full-version-source code is open-sourced.

AppliedMathVol. 6(3)
Jiangnan University (CN)
Peace, Justice and strong institutions
Openalex Percentile: Top 46%
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.