On finite memory observability of a class of systems over finite alphabets with linear dynamics

On finite memory observability of a class of systems over finite alphabets with linear dynamics
复制标题

线性动力学有限字母表上一类系统的有限记忆可观测性

DOI:
10.1109/cdc.2014.7039992
复制
发表时间:
2014
期刊:
53rd IEEE Conference on Decision and Control
影响因子:
--
通讯作者:
D. Tarraf
D. Tarraf
中科院分区:
--
文献类型:
--
作者:
Donglei Fan;D. Tarraf

文献摘要

被引文献

相似文献

本文考虑有限字母表上具有线性内部动力学和量化输出的系统。我们激励需要一个新的概念,这类系统的可观性,我们提出了一个新的定义有限记忆可观性。观测器来自确定性有限状态机类,其目的是为了输出预测而估计系统状态。我们推导出系统是有限记忆可观测的充分必要条件,并举例说明。
In this paper, we consider systems over finite alphabets with linear internal dynamics and quantized output. We motivate the need for a new notion of observability for this class of systems, and we propose a new definition of finite memory observability. The observers are drawn from the class of deterministic finite state machines, with the objective of estimating the system state for the purpose of output prediction. We derive both necessary and sufficient conditions for the system to be finite memory observable, and we illustrate with examples.