A Trisection Algorithm for Estimating Distance Measures for Strong Observability and Strong Detectability

Roland Falkensteiner, Richard Seeber, Martin Horn

Research output: Contribution to journalArticlepeer-review

Abstract

For reliably analyzing the properties of strong observability and strong detectability of a system, continuous distance measures can be used. When calculating these measures, it is necessary to find the global minimum of a non-convex target function. The main contribution of this publication is an optimization algorithm which guarantees to find this global minimum in a fast and efficient way by exploiting the special structure of the optimization problem. Using this optimization algorithm, the distance measures can be reliably calculated. The numerical properties and the usefulness of the algorithm in practical applications are illustrated by means of a numerical example.
Original languageEnglish
Number of pages8
JournalIEEE Transactions on Automatic Control
Early online date11 Jan 2022
DOIs
Publication statusE-pub ahead of print - 11 Jan 2022

Keywords

  • Optimization algorithms
  • Observability measures
  • Linear systems
  • Mechatronics
  • Upper bound
  • Controllability
  • Eigenvalues and eigenfunctions
  • Filtering theory
  • Observability
  • Optimization
  • Standards

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'A Trisection Algorithm for Estimating Distance Measures for Strong Observability and Strong Detectability'. Together they form a unique fingerprint.

Cite this