mlsanityData to 7 Oct 2026

Sparse and Constrained Stochastic Predictive Control for Networked Systems

arXiv 1706.01792 ↗First posted 6 Jun 2017math.OCcited by 2

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Jun 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.