Event-triggered concurrent-learning optimal containment control for discrete-time multi-agent systems

This paper studies distributed optimal containment control for linear discrete-time multi-agent systems with multiple autonomous leaders. An event-triggered concurrent-learning (ET-CL) adaptive dynamic programming framework is developed. It reduces communication and retains informative transient data after online excitation decays. The containment task is reformulated as stabilization of coupled local errors. A stacked linear-quadratic game supplies a verifiable Nash benchmark. The distributed actor realizes a local projection of this benchmark. The omitted coupling is treated as a bounded approximation residual. Coupled discrete-time algebraic Riccati equations and rank-robustness conditions for sampled history stacks are provided. A closed-loop bound on state increments is also derived. Under the stated rank, state-span and admissible-initialization conditions, the critic and actor weight errors and the containment errors are uniformly ultimately bounded. A three-follower study verifies the Riccati residual and closed-loop Schur margin. It also tests the learned controller under the considered follower-side perturbations of S and B i .

Authors

Institutions

Publication Details

Journal
Systems & Control Letters
Published
2026-10-09
DOI
https://doi.org/10.1016/j.sysconle.2026.106599
Primary Topic
Adaptive Dynamic Programming Control
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Event-triggered concurrent-learning optimal containment control for discrete-time multi-agent systems

Shicheng Dai, Xiaoli Wang
Systems & Control Letters
Adaptive Dynamic Programming Control
article

Event-triggered concurrent-learning optimal containment control for discrete-time multi-agent systems

Shicheng Dai, Xiaoli Wang
article en

Abstract

This paper studies distributed optimal containment control for linear discrete-time multi-agent systems with multiple autonomous leaders. An event-triggered concurrent-learning (ET-CL) adaptive dynamic programming framework is developed. It reduces communication and retains informative transient data after online excitation decays. The containment task is reformulated as stabilization of coupled local errors. A stacked linear-quadratic game supplies a verifiable Nash benchmark. The distributed actor realizes a local projection of this benchmark. The omitted coupling is treated as a bounded approximation residual. Coupled discrete-time algebraic Riccati equations and rank-robustness conditions for sampled history stacks are provided. A closed-loop bound on state increments is also derived. Under the stated rank, state-span and admissible-initialization conditions, the critic and actor weight errors and the containment errors are uniformly ultimately bounded. A three-follower study verifies the Riccati residual and closed-loop Schur margin. It also tests the learned controller under the considered follower-side perturbations of S and B i .

Systems & Control LettersVol. 218
Weihai Science and Technology Bureau (CN)
Openalex Percentile: Top 13%
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.