Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit

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.

[1]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[2]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[3]  Daniel E. Quevedo,et al.  Sparse Representations for Packetized Predictive Networked Control , 2013, ArXiv.

[4]  Daniel E. Quevedo,et al.  Input-to-State Stability of Packetized Predictive Control Over Unreliable Networks Affected by Packet-Dropouts , 2011, IEEE Transactions on Automatic Control.