Sparse and Constrained Stochastic Predictive Control for Networked Systems
arXiv:1706.01792 · doi:10.1016/j.automatica.2017.09.013
Abstract
This article presents a novel class of control policies for networked control of Lyapunov-stable linear systems with bounded inputs. The control channel is assumed to have i.i.d. Bernoulli packet dropouts and the system is assumed to be affected by additive stochastic noise. Our proposed class of policies is affine in the past dropouts and saturated values of the past disturbances. We further consider a regularization term in a quadratic performance index to promote sparsity in control. We demonstrate how to augment the underlying optimization problem with a constant negative drift constraint to ensure mean-square boundedness of the closed-loop states, yielding a convex quadratic program to be solved periodically online. The states of the closed-loop plant under the receding horizon implementation of the proposed class of policies are mean square bounded for any positive bound on the control and any non-zero probability of successful transmission.
References in corpus (10)
- State Estimation over Sensor Networks with Correlated Wireless Fading Channels
- Maximum Hands-Off Control: A Paradigm of Control Effort Minimization
- Receding-horizon Stochastic Model Predictive Control with Hard Input Constraints and Joint State Chance Constraints
- Sparse Packetized Predictive Control for Networked Control over Erasure Channels
- On convex problems in chance-constrained stochastic model predictive control
- Stochastic model predictive control with bounded control inputs: a vector space approach
- Stochastic Stability of Event-triggered Anytime Control
- Stability and performance of stochastic predictive control
- Stability of Sequence-Based Control with Random Delays and Dropouts
- Mean-square boundedness of stochastic networked control systems with bounded control inputs