Design of Distributed Controller for Discrete-Time Systems Via the Integration of Extended LMI and Clique-Wise Decomposition
This study addresses the centralized synthesis of distributed controllers using linear matrix inequalities (LMIs). Sparsity constraints on control gains of distributed controllers result in conservatism via the convexification of the existing methods such as the extended LMI method. In order to mitigate the conservatism, we introduce a novel LMI formulation for this problem, utilizing the clique-wise decomposition method from our previous work on continuous-time systems. By reformulating the sparsity constraint on the gain matrix within cliques, this method achieves a broader solution set. Also, the analytical superiority of our method is confirmed through numerical examples.
Code (1)
Similar Papers 제목 키워드 기반
State Feedback System Level Synthesis in Continuous Time
System level synthesis (SLS) is a controller parameterization technique that facilitates synthesis of structured distributed controllers via convex optimization. Past results on SLS are primarily in the discrete-time set…
Achieving Optimal Output Consensus for Discrete-time Linear Multi-agent Systems with Disturbances Rejection
In this paper, an optimal output consensus problem is studied for discrete-time linear multi-agent systems subject to external disturbances. Each agent is assigned with a local cost function which is known only to itself…
Safety of Sampled-Data Systems with Control Barrier Functions via Approximate Discrete Time Models
Control Barrier Functions (CBFs) have been demonstrated to be a powerful tool for safety-critical controller design for nonlinear systems. Existing design paradigms do not address the gap between theory (controller desig…
Efficient Learning of Distributed Linear-Quadratic Controllers
In this work, we propose a robust approach to design distributed controllers for unknown-but-sparse linear and time-invariant systems. By leveraging modern techniques in distributed controller synthesis and structured li…
Sparse Representations of Dynamical Networks: A Coprime Factorization Approach
We study a class of dynamical networks modeled by linear and time-invariant systems which are described by state-space realizations. For these networks, we investigate the relations between various types of factorization…