Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit

Masaaki Nagahara, Daniel Quevedo, Jan Østergaard

Research output: Contribution to book/anthology/report/conference proceedingConference abstract in proceedingResearchpeer-review

242 Downloads (Pure)

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 ℓ0 optimization, which can be eectively solved by orthogonal matching pursuit. Our formulation ensures asymptotic stability of the control loop in the presence of bounded packet dropouts.
Original languageEnglish
Title of host publication20th International Symposium on Mathematical Theory of Networks and Systems
Number of pages3
Publication dateJul 2012
Publication statusPublished - Jul 2012
Event20th International Symposium on Mathematical Theory of Networks and systems - Melbourne, Australia
Duration: 9 Jul 201213 Jul 2012

Conference

Conference20th International Symposium on Mathematical Theory of Networks and systems
Country/TerritoryAustralia
CityMelbourne
Period09/07/201213/07/2012

Fingerprint

Dive into the research topics of 'Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit'. Together they form a unique fingerprint.

Cite this