Abstract

In the context of state estimation under communication constraints, several notions of dynamical entropy play a fundamental role, among them: topological entropy and restoration entropy. In this paper, we present a theorem that demonstrates that for most dynamical systems, restoration entropy strictly exceeds topological entropy. This implies that robust estimation policies in general require a higher rate of data transmission than non-robust ones. The proof of our theorem is quite short, but uses sophisticated tools from the theory of smooth dynamical systems.

Highlights

  • This paper compares two notions of entropy that are relevant in the context of state estimation under communication constraints

  • A big drawback of this notion in the context of state estimation is that topological entropy is highly discontinuous with respect to the dynamical system under consideration in any reasonable topology, cf. [4]

  • We compared two notions of entropy for dynamical systems that have an operational meaning in the context of state estimation over digital channels: topological entropy and restoration entropy

Read more

Summary

Introduction

This paper compares two notions of entropy that are relevant in the context of state estimation under communication constraints. One of the main ideas in these papers is to replace the topological entropy as a figure-of-merit for the necessary rate of data transmission with a possibly larger quantity, named restoration entropy, which describes the smallest data rate above which a more robust form of state estimation can be achieved (called regular observability in [9,10]). Our result shows that the equality of topological and restoration entropy implies a great amount of uniformity in the dynamical system under consideration, which can be expressed in terms of the unstable Lyapunov exponents at each point, whose sum essentially has to be a constant.

Tools from Dynamical Systems
Entropy and Pressure
Subadditive Cocycles
Anosov Diffeomorphisms
State Estimation and Restoration Entropy
Results
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call