Switched Systems Control via Discreteness-Promoting Regularization
Abstract
This paper proposes a novel method for designing finite-horizon discrete-valued switching signals in linear switched systems based on discreteness-promoting regularization. The inherent combinatorial optimization problem is reformulated as a continuous optimization problem with a non-convex regularization term that promotes discreteness of the control. We prove that any solution obtained from the relaxed problem is also a solution to the original problem. The resulting non-convex optimization problem is efficiently solved through time discretization. Numerical examples demonstrate the effectiveness of the proposed method.
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.