Sparse H∞ Controller for Networked Control Systems: Non-Structured and Optimal Structured Design

Abstract

This paper provides a comprehensive analysis of the design of optimal structured and sparse H∞ controllers for continuous-time linear time-invariant (LTI) systems. Three problems are considered. First, designing the sparsest H∞ controller, which minimizes the sparsity of the controller while satisfying the given performance requirements. Second, designing a sparsity-promoting H∞ controller, which balances system performance and controller sparsity. Third, designing a H∞ controller subject to a structural constraint, which enhances system performance with a specified sparsity pattern. For each problem, we adopt a linearization technique that transforms the original nonconvex problem into a convex semidefinite programming (SDP) problem. Subsequently, we design an iterative linear matrix inequality (ILMI) algorithm for each problem, which ensures guaranteed convergence. We further characterize the first-order optimality using the Karush-Kuhn-Tucker (KKT) conditions and prove that any limit point of the solution sequence generated by the ILMI algorithm is a stationary point. For the first and second problems, we validate that our algorithms can reduce the number of non-zero elements and thus the communication burden through several numerical simulations. For the third problem, we refine the solutions obtained in existing literature, demonstrating that our approaches achieve significant improvements.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…