Papers › Distributed Control of Descriptor Networks: A Convex Procedure for Augmented Sparsity

Distributed Control of Descriptor Networks: A Convex Procedure for Augmented Sparsity

13 Sep 2021arXiv:2109.05954archive 2025-07-28

Andrei Sperilă, Cristian Oară, Bogdan D. Ciubotaru, Şerban Sabău

For networks of systems, with possibly improper transfer function matrices, we present a design framework which enables ℋ_∞ control, while imposing sparsity constraints on the controller's coprime factors. We propose a convex and iterative optimization procedure with guaranteed convergence to obtain distributed controllers. By exploiting the robustness-oriented nature of our proposed approach, we provide the means to obtain sparse representations of our control laws that may not be directly supported by the network's nominal model.

PaperPDFCode

Code

AndreiSperila/CONPRAS officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections