CORTEXA
← Browse
arxiveess.SYcs.MAmath.OC2026-07-21

How network perturbations distort agreement trajectories in LTI multi-agent systems

Gal Barkai, Irinel-Constantin Morărescu

Distributed coordination of multi-agent systems frequently relies on cooperative protocols designed to achieve agreement on a prescribed, non-trivial trajectory. While the robustness of such protocols to various uncertainties is well documented, existing literature universally assumes that the target agreement trajectory itself remains invariant. This assumption may hold in ideal cases, but we prove that network perturbations can vastly modify the asymptotic agreement trajectory. We first investigate the exact trajectories of Linear Time-Invariant (LTI) agents subjected to dynamic coupling uncertainties by establishing a new Laplace-domain criterion that characterizes the specific closed-loop poles governing the perturbed agreement manifold. To formalize our analysis, we introduce the notion of structure-preserving dynamics, perturbations that maintain the null space of the communication graph's Laplacian, and contrast them with transmission only dynamics, affecting only the adjacency matrix. We prove a critical fragility within standard cooperative output regulation schemes: while static consensus is uniquely robust to heterogeneous transmission delays, synchronization to periodic trajectories is destroyed by arbitrarily small transmission delays. Furthermore, we demonstrate that for d-regular topologies, uniform transmission perturbations can easily shift the system to synchronize with an unexpected, entirely new frequency. These findings expose a previously unidentified vulnerability in classical robust synchronization, demonstrating that transmission dynamics necessitate fundamental structural modifications to networked reference generators.

View free PDFSource page

Related papers

arxivcs.MAeess.SYmath.OC2026-07-18

Laplacian Spectral Shaping for Non-Uniform Scaling Formation Control of Open Multi-Agent Systems

Tao He, Gangshan Jing

Non-uniform scaling control enables a multi-agent formation to adjust its shape by compressing or stretching independently along different coordinate axes through inter-agent interactions, offering high flexibility in complex environments. The fundamental idea is encoding the des…

View free PDFSource page
arxivcs.AIcs.CLcs.MAeess.SYmath.OC2026-07-07

How Much Does Correctness Cost? Budgeted Placement of Strong Correctors in a Weak Multi-Agent Swarm

Igor Itkin

A cheap swarm of unreliable agents can be steered to a correct consensus by a few strong, expensive "oracle" correctors. We ask how much one must spend, and where to place the oracles. We model the swarm as a consensus on a graph in which each oracle pins one node toward the trut…

View free PDFSource page
arxivmath.OCcs.LGcs.MAeess.SY2026-07-10

Control Laguerre Tessellation: Semi-discrete Optimal Transport Over Control Systems

Ripon C. Sarker, Abhishek Halder

We study the optimal transport of optimally controlled agents from a compactly supported absolutely continuous source to a discrete target measure. The ground cost for the transport is induced by the optimal cost of the agents' motion. When this ground cost satisfies the twist co…

View free PDFSource page
arxivstat.MEcs.MAeess.SYmath.OC2026-07-23

Equilibrium Causal Digital Twins: Validation, Transport, and Identification Limits

Faraz Dadgostari, Neda Nazemi

Digital twins are often used to predict how a system would respond to an intervention. In systems with feedback, a twin must reproduce an equilibrium counterfactual, and a twin developed in one domain may fail after mechanisms change. We study when these predictions can be valida…

View free PDFSource page
arxivcs.MAcs.AIcs.CYcs.DCeess.SY2026-07-19

The Optimization Trilemma: Efficiency, Comfort and Fairness in Decentralized Multi-agent Coordination

Jovan Nikolic, Maciej Krzysztof Zuziak, Evangelos Pournaras

The problem of fair multi-agent coordination in decentralized settings is one of the most pressing challenges for building efficient collaborative systems. Resource allocation is based on optimized collective arrangements accounting for agents' needs. Such coordination should not…

View free PDFSource page
arxivcs.MAcs.CLcs.LGeess.SY2026-06-25

Delayed Verification Destabilizes Multi-Agent LLM Belief: Instability Thresholds and Optimal Corrector Placement

Igor Itkin

Multi-agent large language model (LLM) systems often rely on verifier and critic agents to suppress hallucinations, but verification is delayed. During this delay, false claims can propagate through the agent network. We model this process as delayed consensus on a graph with gro…

View free PDFSource page