On the theory of estimation and control with finite data-rate
Scabin Vicinansa, Guilherme
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/121350
Description
Title
On the theory of estimation and control with finite data-rate
Author(s)
Scabin Vicinansa, Guilherme
Issue Date
2023-07-12
Director of Research (if dissertation) or Advisor (if thesis)
Liberzon, Daniel
Doctoral Committee Chair(s)
Liberzon, Daniel
Committee Member(s)
Belabbas, Mohammed-Ali
Baryshnikov, Yuliy
Zharnitsky, Vadim
Department of Study
Electrical & Computer Eng
Discipline
Electrical & Computer Engr
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Estimation entropy
finite data-rate
Abstract
In this dissertation, we discuss control and estimation problems for systems that operate with data-rate constraints. We start by studying the estimation entropy of switched linear systems. This quantity is the minimal data-rate we need to use to estimate the state of a switched linear system with an estimation error that decays with a prescribed exponential decay rate. We provide upper and lower bounds for the estimation entropy in terms of the Lyapunov exponents of the switched system. Also, we show that those bounds coincide with the entropy when the system is Lyapunov regular. We provide a coding scheme that solves the state reconstruction problem with the data rate as close as desired to the minimum. Under the regularity assumption, we show how to make that algorithm work causally. Next, we present sufficient conditions for a system to be Lyapunov regular and show that Markov Jump Linear Systems belong to that class. We also illustrate those theoretical results with simulations. Then, we switch subjects to the problem of defining controllability for linear time-varying systems with a finite data-rate. We explain why the usual notion of controllability is unfit when data-rate constraints are present. Then, we define a new controllability notion that makes sense in this scenario. We also justify why such a notion is natural. Next, we present a necessary condition and a sufficient condition for a system to be controllable with a finite data-rate. Finally, we revisit the topic of controllability with a finite data-rate, but we specialize our analysis to switched linear systems. Although this part of the work is more restrictive than the previous one, we show how the switched system structure allows us to derive sufficient conditions for our system to be controllable with a finite data-rate using information about the individual modes and some mild assumptions about the switching signal. In particular, when our switching signal satisfies an average dwell-time condition, we give a simple relation between the sampling time, chatter bound, and average-dwell time that guarantees that our system will be controllable with a finite data-rate. Then, we generalize our analysis by assuming we can have packet losses in our communication channel. We prove a sufficient condition for such a system to be controllable with a finite data-rate even when we might lose packets. We demonstrate this condition by constructing an algorithm, which makes this proof constructive.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
