...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Automatic Control >Identifiability of Dynamical Networks With Partial Node Measurements
【24h】

Identifiability of Dynamical Networks With Partial Node Measurements

机译：具有部分节点测量的动态网络的可识别性

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Much recent research has dealt with the identifiability of a dynamical network in which the node signals are connected by causal linear transfer functions and are excited by known external excitation signals and/or unknown noise signals. A major research question concerns the identifiability of the whole network-topology and all transfer functions-from the measured node signals and external excitation signals. So far all results on the identifiability of the whole network have assumed that all node signals are measured. This paper presents the first results for the situation where not all node signals are measurable, under the assumptions that, first, the topology of the network is known, and, second, each node is excited by a known external excitation. Using graph theoretical properties, we show that the transfer functions that can be identified depend essentially on the topology of the paths linking the corresponding vertices to the measured nodes. A practical outcome is that, under those assumptions, a network can often be identified using only a small subset of node measurements.
机译：最近的研究已经处理了一种动态网络的可识别性，其中节点信号通过因果线性传递函数连接，并且通过已知的外部激励信号和/或未知噪声信号激发。一个主要的研究问题涉及整个网络拓扑的可识别性和所有传递函数 - 来自测量的节点信号和外部激励信号。到目前为止，所有导致整个网络的可识别性都假定了测量所有节点信号。本文介绍了不是所有节点信号都可以测量的情况的第一个结果，在假设中，首先是网络的拓扑所知道的，并且第二，每个节点被已知的外部激励激发。使用图形理论属性，我们表明可以识别的传递函数基本上取决于将相应顶点链接到测量节点的路径的拓扑。实际结果是，在这些假设下，通常可以仅使用小节点测量的小子集来识别网络。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号