Användning av cookies

Lunds universitet använder cookies för att se till att webbplatsen fungerar korrekt och för att förbättra din upplevelse.

Läs mer i vår cookiepolicy

Sökresultat

Filtrera

Nollställ filter

Filtyp

Din sökning på "*" gav 566170 sökträffar

No title

This note proposes a unified approach to analyse linear time-invariant consensus problems via the use of integral quadratic constraints (IQCs) without recourse to loop transformations, which may cloud the inherent structural properties of the multi-agent networked systems. The main technical hindrance to using IQCs lies in the presence of the marginally stable integral action in consensus setups.

No title

We study the notion of structured realizability for linear systems dened over graphs. A stabilizable and detectable realization is structured if the state-space matrices inherit the sparsity pattern of the adjacency matrix of the associated graph. In this paper, we demonstrate that not every structured transfer matrix has a structured realization and we reveal the practical meaning of this fact. W