Switched Systems Control via Discreteness-Promoting Regularization
By: Masaaki Nagahara, Takuya Ikeda, Ritsuki Hoshimoto
Potential Business Impact:
Makes computer controls choose the best options faster.
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.
Similar Papers
Agile Temporal Discretization for Symbolic Optimal Control
Systems and Control
Makes robots learn faster with flexible timing.
Feedback stabilization of switched systems under arbitrary switching: A convex characterization
Optimization and Control
Makes machines with changing parts more stable.
Continuous-time reinforcement learning for optimal switching over multiple regimes
Optimization and Control
Teaches computers to make best choices faster.