EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Efficient Sensor Node Selection for Observability Gramian Optimization

Keigo Yamada iD, Yasuo Sasaki, Takayuki Nagata iD, Kumi Nakai iD, Daisuke Tsubakino, Taku Nonomura iD

Sensors · 27.06.2023 · 23 (13) · 5961

DOI: 10.3390/s23135961 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sensors, online erschienen am 27.06.2023. Verfasst von Keigo Yamada und 5 weiteren Autor:innen. Beteiligte Einrichtung: The Department of Aerospace Engineering, Tohoku University, Sendai 9808579, Japan. Hauptthemen laut MEDLINE: Algorithms, Noise. Die Arbeit wurde bisher 18-mal zitiert (Crossref) und nennt 100 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Japan Society for the Promotion of Science, Japan Science and Technology Agency, JSPS KAKENHI.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Optimization approaches that determine sensitive sensor nodes in a large-scale, linear time-invariant, and discrete-time dynamical system are examined under the assumption of independent and identically distributed measurement noise. This study offers two novel selection algorithms, namely an approximate convex relaxation method with the Newton method and a gradient greedy method, and confirms the performance of the selection methods, including a convex relaxation method with semidefinite programming (SDP) and a pure greedy optimization method proposed in the previous studies. The matrix determinant of the observability Gramian was employed for the evaluations of the sensor subsets, while its gradient and Hessian were derived for the proposed methods. In the demonstration using numerical and real-world examples, the proposed approximate greedy method showed superiority in the run time when the sensor numbers were roughly the same as the dimensions of the latent system. The relaxation method with SDP is confirmed to be the most reasonable approach for a system with randomly generated matrices of higher dimensions. However, the degradation of the optimization results was also confirmed in the case of real-world datasets, while the pure greedy selection obtained the most stable optimization results.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsNoise

Stichwörter der Autor:innen

monitoringoptimizationschedulingsensor networksstate estimation

Autor:innen und Institutionen

  • The Department of Aerospace Engineering, Tohoku University, Sendai 9808579, Japan.
  • The Department of Aerospace Engineering, Nagoya University, Nagoya 4648603, Japan.

ORCID-Profile: Keigo Yamada, Takayuki Nagata, Kumi Nakai, Taku Nonomura

Förderung

  • Japan Society for the Promotion of Science
  • Japan Science and Technology Agency
  • JSPS KAKENHI
  • JST Moonshot
  • JST CREST
  • JST FOREST

Zitieren

APA

Yamada, K., Sasaki, Y., Nagata, T., Nakai, K., Tsubakino, D., & Nonomura, T. (2023). Efficient Sensor Node Selection for Observability Gramian Optimization. Sensors, 23(13), 5961. https://doi.org/10.3390/s23135961

Vancouver

Yamada K, Sasaki Y, Nagata T, Nakai K, Tsubakino D, Nonomura T. Efficient Sensor Node Selection for Observability Gramian Optimization. Sensors. 2023;23(13):5961. doi:10.3390/s23135961

BibTeX
@article{Yamada2023,
  author = {Yamada, Keigo and Sasaki, Yasuo and Nagata, Takayuki and Nakai, Kumi and Tsubakino, Daisuke and Nonomura, Taku},
  title = {Efficient Sensor Node Selection for Observability Gramian Optimization},
  journal = {Sensors},
  year = {2023},
  volume = {23},
  number = {13},
  pages = {5961},
  doi = {10.3390/s23135961}
}
Kostenlos starten →