Consensus over matrix-weighted networks with time-delays

05 May 2024 (modified: 06 Nov 2024)Submitted to NeurIPS 2024EveryoneRevisionsBibTeXCC BY-NC 4.0
Keywords: optimization and control theory; multi-agent systems; matrix-weighted networks; time-delays; network localization
TL;DR: Our paper provides consensus conditions for delayed leaderless and leader-follower matrix-weighted networks.
Abstract: This paper studies consensus conditions for leaderless and leader-follower matrix-weighted consensus networks under the presence of constant time-delays. Several delayed consensus algorithms for networks of single- and double-integrators using only the relative positions are considered. Conditions for the networks to asymptotically converge to a consensus or clustering configuration are derived based on direct eigenvalue evaluation or the Lyapunov-Krasovkii theorem. Furthermore, an application of these algorithms in bearing-based network localization is also considered. The theoretical results are supported by numerical simulations.
Primary Area: Optimization (convex and non-convex, discrete, stochastic, robust)
Submission Number: 1926
Loading