Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit
Systems and Control
2013-08-05 v1 Information Theory
math.IT
Optimization and Control
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.
Cite
@article{arxiv.1308.0518,
title = {Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit},
author = {Masaaki Nagahara and Daniel E. Quevedo and Jan Ostergaard},
journal= {arXiv preprint arXiv:1308.0518},
year = {2013}
}
Comments
3-page extended abstract for MTNS 2012 with 3 figures