mlsanityData to 14 Oct 2026

Distributed Optimization of Average Consensus Containment with Multiple Stationary Leaders

arXiv 2203.16451 ↗First posted 30 Mar 2022math.OC cs.SY eess.SYcited by 1

Not on the map. Why?

Abstract (arXiv)

In this paper, we consider the problem of containment control of multi-agent systems with multiple stationary leaders, interacting over a directed network. While, containment control refers to just ensuring that the follower agents reach the convex hull of the leaders states, we focus on the problem where the followers achieve a consensus to the average values of the leaders states. We propose an algorithm that can be implemented in a distributed manner to achieve the above consensus among followers. Next we optimize the convergence rate of the followers to the average consensus by proper choice of weights for the interaction graph. This optimization is also performed in a distributed manner using Alternating Direction Method of Multipliers (ADMM). Finally, we complement our results by illustrating them with numerical examples.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 30 Mar 2022.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.