首页> 外文会议>System Identification (SYSID 2000) >SUBSPACE ALGORITHMS FOR DATA FROM VARYING SENSOR LOCATIONS
【24h】

SUBSPACE ALGORITHMS FOR DATA FROM VARYING SENSOR LOCATIONS

机译:各种传感器位置的数据的子空间算法

获取原文

摘要

Subspace identification algorithms currently emerge as an efficient tool. In this paper, we investigate their use for the output-only identification of the eigenstructure of a linear MIMO system. We focus on the following situation: several successive data sets are recorded, with sensors at different locations in the structure; for doing this, some of the sensors, called the reference sensors, are kept fixed, while the other ones are moved for the different records. The interest of this setup is to emulate a situation in which hundreds of sensors are available, while in fact only, say, ten are actually at hand. This situation is typical in structural analysis in vibration mechanics, a case which motivated our study. One additional difficulty here is that the input, besides being not observed, is turbulent in nature and nonstationary. The purpose of this paper is to show how subspace methods can be adapted to such a situation.
机译:子空间识别算法当前成为一种有效的工具。在本文中,我们研究了它们在线性MIMO系统本征结构的仅输出识别中的应用。我们关注以下情况:记录了几个连续的数据集,其中传感器位于结构中的不同位置;为此,一些传感器(称为参考传感器)保持固定,而其他传感器则移动以用于不同的记录。这种设置的目的是模拟一种情况,其中有数百个传感器可用,而实际上仅说十个。这种情况在振动力学的结构分析中很典型,这是促使我们进行研究的一个案例。这里的另一个困难是,除了未被观察到之外,输入在本质上是湍流的并且是不稳定的。本文的目的是说明子空间方法如何适应这种情况。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号