Pith. sign in

REVIEW

Latency-Reliability Tradeoffs for State Estimation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1810.11831 v1 pith:4XMRXSS2 submitted 2018-10-28 math.OC cs.ITcs.SYeess.SYmath.IT

classification math.OCcs.ITcs.SYeess.SYmath.IT
keywords channelsabstractioncodescommunicationcommunicationscontrollatencylatency-reliability
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Pith tools