H_ network optimization for edge consensus

DOI10.1016/J.EJCON.2021.06.032MaRDI QIDQ2068543zbMATH OpenOpenAlexFDO

Authors Omar Farhat, Dany Abou Jaoude, Mathias Hudoba de Badyn

Publication date 19 January 2022

Published in European Journal of Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2107.02595

zbMATH Keywords

\(\mathcal{H}_\infty\)-norm minimizationedge consensusnetwork systemssemidefinite programmingtime-scaled agentsweighted graphs

Mathematics Subject Classification ID

(H^infty)-control (93B36) Networked control (93B70) Consensus (93D50)

Abstract: This paper examines the $mathcal{H}_{i}nfty$ performance problem of the edge agreement protocol for networks of agents operating on independent time scales, connected by weighted edges, and corrupted by exogenous disturbances. $mathcal{H}_{i}nfty$-norm expressions and bounds are computed that are then used to derive new insights on network performance in terms of the effect of time scales and edge weights on disturbance rejection. We use our bounds to formulate a convex optimization problem for time scale and edge weight selection. Numerical examples are given to illustrate the applicability of the derived $mathcal{H}_{i}nfty$-norm bound expressions, and the optimization paradigm is illustrated via a formation control example involving non-homogeneous agents.

Recommendations

• Network sensitivity function, optimization and robust performance in dynamic average consensus
• Distributed H_ constrained consensus problem
• Improved \(\mathrm{H}_\infty\) consensus of multi-agent systems under network constraints within multiple disturbances
• Distributed H_ consensus filtering with network-induced delays
• Distributed constrained optimization and consensus in uncertain networks via proximal minimization
• <inline-formula> <tex-math notation="TeX">$H_{\infty}$</tex-math></inline-formula> Consensus Achievement of Multi-Agent Systems With Directed and Switching Topology Networks
• Finite-time convergent gradient flows with applications to network consensus
• Optimal convergence rates for convex distributed optimization in networks
• Continuous-time algorithm design for distributed constrained optimization over weight-balanced directed networks
• Constrained Consensus and Optimization in Multi-Agent Networks

Cites work

• ${\mathcal {H}_2}$ Performance of Series-Parallel Networks: A Compositional Perspective
• \(\mathcal{H}_\infty\) network optimization for edge consensus
• Balanced truncation model reduction of nonstationary systems interconnected over arbitrary graphs
• Coherence in Large-Scale Networks: Dimension-Dependent Limitations of Local Feedback
• Consensus and Coherence in Fractal Networks
• Controllability of multi-agent systems from a graph-theoretic perspective
• Coprime Factors Model Reduction of Spatially Distributed LTV Systems Over Arbitrary Graphs
• Coprime factors reduction of distributed nonstationary LPV systems
• Distributed \(H_\infty\)-consensus filtering in sensor networks with multiple missing measurements: the finite-horizon case
• Distributed robust \(H_\infty \) consensus control in directed networks of agents with time-delay
• Edge Agreement: Graph-Theoretic Performance Bounds and Passivity Analysis
• Estimation From Relative Measurements: Electrical Analogy and Large Graphs
• Graph theoretic methods in multiagent networks
• scientific article; zbMATH DE number 1001726 (Why is no real title available?)
• scientific article; zbMATH DE number 1418964 (Why is no real title available?)
• scientific article; zbMATH DE number 967931 (Why is no real title available?)
• Model reduction of distributed nonstationary LPV systems
• On the Control and Estimation Over Relative Sensing Networks
• Paths in graphs
• Performance and Design of Consensus on Matrix-Weighted and Time-Scaled Graphs
• Semi-Autonomous Consensus: Network Measures and Adaptive Trees
• Solving semidefinite-quadratic-linear programs using SDPT3
• Time-Scale Separation in Networks: State-Dependent Graphs and Consensus Tracking

Cited in

(6)

• Performance and design of cycles in consensus networks
• \(\mathcal{H}_\infty\) network optimization for edge consensus
• Constrained control for a class of vessel operations: positioning under environmental and shielding effects
• Distributed optimisation and control of graph Laplacian eigenvalues for robust consensus via an adaptive multilayer strategy
• Synchronization of second-order Kuramoto networks from the perspective of edge dynamics
• Network sensitivity function, optimization and robust performance in dynamic average consensus

Describes a project that uses

Uses Software

• SDPT3
• YALMIP

This page was built for publication: \(\mathcal{H}_\infty\) network optimization for edge consensus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2068543)