Sensor Selection by Greedy Method for Linear Dynamical Systems: Comparative Study on Fisher-Information-Matrix, Observability-Gramian and Kalman-Filter-Based Indices

被引：6

作者：

Takahashi, Shun ^{[1
]}

Sasaki, Yasuo ^{[1
]}

Nagata, Takayuki ^{[1
]}

Yamada, Keigo ^{[1
]}

Nakai, Kumi ^{[1
]}

Saito, Yuji ^{[1
]}

Nonomura, Taku ^{[1
]}

机构：

[1] Tohoku Univ, Dept Aerosp Engn, Sendai, Miyagi 9808577, Japan

来源：

IEEE ACCESS | 2023年 / 11卷

基金：

日本科学技术振兴机构;

关键词：

Greedy method; optimal design of experiment; sensor selection; linear time-invariant problem; Kalman filter; PLACEMENT; SUBMODULARITY; ALGORITHMS;

D O I：

10.1109/ACCESS.2023.3291415

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Objective functions for sensor selection are investigated in linear time-invariant systems with a large number of sensor candidates. This study compared the performance of sensor sets obtained using three types of D-optimality-based indices as objective functions for sensor selection based on the greedy method. The compared indices are computed based on the snapshot-to-snapshot Fisher information matrix, the observability Gramian and the Kalman filter-based matrix. Both random systems and systems with eigenmodes are considered, indices for selecting the best-performing sensor set for each are identified, as well as computational complexity and corresponding wall clock times. The sensor optimized for each index works best for that index, as expected. We also clarified the trend of the sensor sets selected by the greedy method based on each objective function in terms of the other objective function.

引用

页码：67850 / 67864

页数：15