pith. sign in

arxiv: 1810.11831 · v1 · pith:4XMRXSS2new · submitted 2018-10-28 · 🧮 math.OC · cs.IT· cs.SY· math.IT

Latency-Reliability Tradeoffs for State Estimation

classification 🧮 math.OC cs.ITcs.SYmath.IT
keywords channelsabstractioncodescommunicationcommunicationscontrollatencylatency-reliability
0
0 comments X
read the original abstract

The emerging interest in low-latency high-reliability applications, such as connected vehicles, necessitates a new abstraction between communication and control. Thanks to advances in cyber-physical systems over the past decades, we understand this interface for classical bit-rate models of channels as well as packet-loss-type channels. This work proposes a new abstraction characterized as a tradeoff curve between latency, reliability and rate. Our aim is to understand: Do we (control engineers) prefer faster but less reliable communications (with shorter codes), or slower but more reliable communications (with longer codes)? In this paper we examine the tradeoffs between latency and reliability for the problem of estimating dynamical systems over communication channels. Employing different latency-reliability curves derived from practical coding schemes, we develop a co-design methodology, i.e., select the code length depending on the system dynamics to optimize system performance.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.