Switching Tube-Based MPC: Characterization of Minimum Dwell-Time for Feasible and Robustly Stable Switching
نویسندگان
چکیده
منابع مشابه
Switching Robust Control Synthesis for Teleoperation via Dwell Time Conditions
Control design for bilateral teleoperation is still an open problem, given that it is desirable to meet a proper balance in the inherent trade-off between transparency and stability. We propose the use of switching robust control, in which smooth switching among controllers is achieved by the existence of multiple Lyapunov functions with a special structure, linked by conditions of maximum aver...
متن کاملDwell-time controllers for stochastic systems with switching Markov chain
We study the problem of feedback stabilization of a family of nonlinear stochastic systems with switching mechanism modeled by a Markov chain. We introduce a novel notion of stability under switching, which guarantees a given probability that the trajectories of the system hit some target set in finite time and remaining thereinafter. Our main contribution is to prove that if the expectation of...
متن کاملNovel Switching H2/H∞ Control: Combination of Dwell Time Switching Signal and Multiple Lyapunov Function
In this paper, a switching strategy is employed to solve the H2/H∞ multi objective controller design. Two controllers are designed to meet the H2 and H∞ performance specifications. Linear matrix inequalities are used in the controller design process. New switching signal is defined which is the combination of dwell time switching signal and multiple Lyapunov function such that stability of clos...
متن کاملGraph-Based Minimum Dwell Time and Average Dwell Time Computations for Discrete-Time Switched Linear Systems
Discrete-time switched linear systems where switchings are governed by a digraph are considered. The minimum (or average) dwell time that guarantees the asymptotic stability can be computed by calculating the maximum cycle ratio (or maximum cycle mean) of a doubly weighted digraph where weights depend on the eigenvalues and eigenvectors of subsystem matrices. The graph-based method is applied t...
متن کاملApproximate robust dynamic programming and robustly stable MPC
We present a technique for approximate robust dynamic programming that is suitable for linearly constrained polytopic systems with piecewise affine cost functions. The approximation method uses polyhedral representations of the cost-to-go function and feasible set, and can considerably reduce the computational burden compared to recently proposed methods for exact robust dynamic programming [Be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2019
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2019.2897551