Transmit or Retransmit: A Tradeoff in Networked Control of Dynamical Processes Over Lossy Channels With Ideal Feedback

We study networked control of a dynamical process over a lossy channel with a hybrid automatic repeat request protocol that connects a sensor to an actuator. The dynamical process is modeled by a Gauss-Markov process, and the lossy channel by a packet-erasure channel with ideal feedback. We suppose that data is communicated in the format of packets with negligible quantization error. In such a networked control system, whenever a packet loss occurs, there exists a tradeoff between transmitting new sensory information with a lower success probability and retransmitting previously failed sensory information with a higher success probability. In essence, an inherent tradeoff between freshness and reliability. To address this tradeoff, we consider a linear-quadratic-regulator performance index, which penalizes state deviations and control efforts over a finite horizon, and jointly design optimal encoding and decoding policies for the encoder and the decoder, which are collocated with the sensor and the actuator, respectively. Our emphasis here lies specifically on designing switching and control policies, rather than error-correcting codes. We show that the optimal encoding policy is a threshold switching policy and the optimal decoding policy is a certainty-equivalent control policy. In addition, we determine the equations that the encoder and the decoder need to solve in order to implement the optimal policies. More specifically, we show that the encoder must solve the Kalman filtering equations, a mismatch linear equation, and a Bellman optimality equation, while the decoder must solve a linear filtering equation and an algebraic Riccati equation.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Information Theory
Published
2024-09-02
DOI
https://doi.org/10.1109/tit.2024.3452976
Citations
4
Primary Topic
Simulation Techniques and Applications
Type
article
Field-Weighted Citation Impact
1.96

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Transmit or Retransmit: A Tradeoff in Networked Control of Dynamical Processes Over Lossy Channels With Ideal Feedback

Denız Gündüz, John S. Baras, Touraj Soleymani
4 citations
IEEE Transactions on Information Theory
Simulation Techniques and Applications
1.96
article

Transmit or Retransmit: A Tradeoff in Networked Control of Dynamical Processes Over Lossy Channels With Ideal Feedback

Denız Gündüz, John S. Baras, Touraj Soleymani
article en
4 citations

Abstract

We study networked control of a dynamical process over a lossy channel with a hybrid automatic repeat request protocol that connects a sensor to an actuator. The dynamical process is modeled by a Gauss-Markov process, and the lossy channel by a packet-erasure channel with ideal feedback. We suppose that data is communicated in the format of packets with negligible quantization error. In such a networked control system, whenever a packet loss occurs, there exists a tradeoff between transmitting new sensory information with a lower success probability and retransmitting previously failed sensory information with a higher success probability. In essence, an inherent tradeoff between freshness and reliability. To address this tradeoff, we consider a linear-quadratic-regulator performance index, which penalizes state deviations and control efforts over a finite horizon, and jointly design optimal encoding and decoding policies for the encoder and the decoder, which are collocated with the sensor and the actuator, respectively. Our emphasis here lies specifically on designing switching and control policies, rather than error-correcting codes. We show that the optimal encoding policy is a threshold switching policy and the optimal decoding policy is a certainty-equivalent control policy. In addition, we determine the equations that the encoder and the decoder need to solve in order to implement the optimal policies. More specifically, we show that the encoder must solve the Kalman filtering equations, a mismatch linear equation, and a Bellman optimality equation, while the decoder must solve a linear filtering equation and an algebraic Riccati equation.

IEEE Transactions on Information TheoryVol. 70(11)
Imperial College London (GB), University of Maryland, College Park (US)
Engineering and Physical Sciences Research Council
Openalex Percentile: Top 13%
Simulation Techniques and Applications
1.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.