H∞ Analysis and Synthesis of Time-Scaled and Weighted Edge Consensus Networks

This work focuses on networks of single-integrator time-scaled agents interconnected through weighted edges, in which both the agents and their edges are affected by zero-mean Gaussian noise. The noise impact is measured using the H ∞ -norm of the resulting dynamical system. We propose a method to convexify the computation of the previously-mentioned H ∞ - norm in terms of the weights and time scales of the graph. Furthermore, we provide a convex synthesis method to minimize the norm based on the variable weights and time scales. We cover two performance indices based on the configurations of the system’s output: using the spanning tree edge states, or alongside the co-tree edge states. A numerical example illustrates the proposed method.

Authors

Institutions

Publication Details

Journal
IFAC-PapersOnLine
Published
2025-01-01
DOI
https://doi.org/10.1016/j.ifacol.2025.10.103
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

H∞ Analysis and Synthesis of Time-Scaled and Weighted Edge Consensus Networks

Dany Abou Jaoude, Mircea Şuşcă, Vlad Mihaly
IFAC-PapersOnLine
Distributed Control Multi-Agent Systems
article

H∞ Analysis and Synthesis of Time-Scaled and Weighted Edge Consensus Networks

Dany Abou Jaoude, Mircea Şuşcă, Vlad Mihaly
article en

Abstract

This work focuses on networks of single-integrator time-scaled agents interconnected through weighted edges, in which both the agents and their edges are affected by zero-mean Gaussian noise. The noise impact is measured using the H ∞ -norm of the resulting dynamical system. We propose a method to convexify the computation of the previously-mentioned H ∞ - norm in terms of the weights and time scales of the graph. Furthermore, we provide a convex synthesis method to minimize the norm based on the variable weights and time scales. We cover two performance indices based on the configurations of the system’s output: using the spanning tree edge states, or alongside the co-tree edge states. A numerical example illustrates the proposed method.

IFAC-PapersOnLineVol. 59(16)
Technical University of Cluj-Napoca (RO), American University of Beirut (LB)
Openalex Percentile: Top 63%
Distributed Control Multi-Agent Systems
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.