Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit

Masaaki Nagahara, Daniel Quevedo, Jan Østergaard

Eksport af forskningsdata: Bidrag til bog/antologi/rapport/konference proceedingKonferenceabstrakt i proceedingForskningpeer review

160 Downloads (Pure)

Resumé

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.
OriginalsprogEngelsk
Titel20th International Symposium on Mathematical Theory of Networks and Systems
Antal sider3
Udgivelsesdatojul. 2012
PublikationsstatusUdgivet - jul. 2012
Begivenheder20th International Symposium on Mathematical Theory of Networks and systems - Melbourne, Australien
Varighed: 9 jul. 201213 jul. 2012

Konference

Konference20th International Symposium on Mathematical Theory of Networks and systems
LandAustralien
ByMelbourne
Periode09/07/201213/07/2012

Fingerprint

Asymptotic stability

Citer dette

Nagahara, M., Quevedo, D., & Østergaard, J. (2012). Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit. i 20th International Symposium on Mathematical Theory of Networks and Systems
Nagahara, Masaaki ; Quevedo, Daniel ; Østergaard, Jan. / Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit. 20th International Symposium on Mathematical Theory of Networks and Systems. 2012.
@inbook{b2313daf7e684c8296605f9a60b99787,
title = "Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit",
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.",
author = "Masaaki Nagahara and Daniel Quevedo and Jan {\O}stergaard",
year = "2012",
month = "7",
language = "English",
booktitle = "20th International Symposium on Mathematical Theory of Networks and Systems",
note = "20th International Symposium on Mathematical Theory of Networks and systems, MTNS 2012 ; Conference date: 09-07-2012 Through 13-07-2012",

}

Nagahara, M, Quevedo, D & Østergaard, J 2012, Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit. i 20th International Symposium on Mathematical Theory of Networks and Systems. 20th International Symposium on Mathematical Theory of Networks and systems, Melbourne, Australien, 09/07/2012.

Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit. / Nagahara, Masaaki; Quevedo, Daniel; Østergaard, Jan.

20th International Symposium on Mathematical Theory of Networks and Systems. 2012.

Eksport af forskningsdata: Bidrag til bog/antologi/rapport/konference proceedingKonferenceabstrakt i proceedingForskningpeer review

TY - ABST

T1 - Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit

AU - Nagahara, Masaaki

AU - Quevedo, Daniel

AU - Østergaard, Jan

PY - 2012/7

Y1 - 2012/7

N2 - 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.

AB - 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.

M3 - Conference abstract in proceeding

BT - 20th International Symposium on Mathematical Theory of Networks and Systems

T2 - 20th International Symposium on Mathematical Theory of Networks and systems

Y2 - 9 July 2012 through 13 July 2012

ER -

Nagahara M, Quevedo D, Østergaard J. Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit. i 20th International Symposium on Mathematical Theory of Networks and Systems. 2012