STATE ESTIMATION AND OBSERVABILITY OF SYSTEMS OVER FINITE ALPHABETS

Observability;Systems Over Finite Alphabets.;Electrical Engineering

Fan, Donglei

Johns Hopkins University

关键词: Observability;    Systems Over Finite Alphabets.;    Electrical Engineering;   

Others  :  https://jscholarship.library.jhu.edu/bitstream/handle/1774.2/39717/FAN-DISSERTATION-2016.pdf?sequence=1&isAllowed=y

瑞士|英语

来源: JOHNS HOPKINS DSpace Repository

【 摘 要 】

In this dissertation, the state estimation problem for systems over finite alphabets is studied, focusing in particular ona significant special instance of such systems consisting of an LTI system with a finite input set and an output quantizer. The need for new notions of observability is motivated, and a set of new notions of observability are formulated quantifying the degree to which the output of such systems can be predicted by an observer. The characterization of observability is investigated, with both necessary and sufficient conditions derived in terms of the dynamics of the system, the properties of the quantizer, and the finitealphabet sets. The use ofdeterministic finite state machine as observers is also explored, with a view towards understanding their advantages and limitations. Building on the notion of finite memory observability, a control design problem is formulated. Lastly, an idea inspired by the characterization of observability isappliedto solve some remaining open questions in the theory of bisimulation.