Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit
classification
💻 cs.SY
cs.ITmath.ITmath.OC
keywords
controldropoutsmatchingorthogonalpacketpacketspredictivepursuit
read the original abstract
We study packetized predictive control, known to be robust against packet dropouts in networked systems. To obtain sparse packets for rate-limited networks, we design control packets via an L0 optimization, which can be effectively solved by orthogonal matching pursuit. Our formulation ensures asymptotic stability of the control loop in the presence of bounded packet dropouts.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.