Saved in:
Bibliographic Details
Main Authors: Noom, Jacques, Soloviev, Oleg, Smith, Carlas, Verhaegen, Michel
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2401.05782
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909069486325760
author Noom, Jacques
Soloviev, Oleg
Smith, Carlas
Verhaegen, Michel
author_facet Noom, Jacques
Soloviev, Oleg
Smith, Carlas
Verhaegen, Michel
contents Stochastic Closed-Loop Active Fault Diagnosis (CLAFD) aims to select the input sequentially in order to improve the discrimination of different models by minimizing the predicted error probability. As computation of these error probabilities encompasses the evaluation of multidimensional probability integrals, relaxation methods are of interest. This manuscript presents a new method that allows to make an improved trade-off between three factors -- namely maximized accuracy of diagnosis, minimized number of consecutive measurements to achieve that accuracy, and minimized computational effort per time step -- with respect to the state-of-the-art. It relies on minimizing an upper bound on the error probability, which is in the case of linear models with Gaussian noise proven to be concave in the most challenging discrimination conditions. A simulation study is conducted both for open-loop and feedback controlled candidate models. The results demonstrate the favorable trade-off using the new contributions in this manuscript.
format Preprint
id arxiv_https___arxiv_org_abs_2401_05782
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Online input design for discrimination of linear models using concave minimization
Noom, Jacques
Soloviev, Oleg
Smith, Carlas
Verhaegen, Michel
Systems and Control
Stochastic Closed-Loop Active Fault Diagnosis (CLAFD) aims to select the input sequentially in order to improve the discrimination of different models by minimizing the predicted error probability. As computation of these error probabilities encompasses the evaluation of multidimensional probability integrals, relaxation methods are of interest. This manuscript presents a new method that allows to make an improved trade-off between three factors -- namely maximized accuracy of diagnosis, minimized number of consecutive measurements to achieve that accuracy, and minimized computational effort per time step -- with respect to the state-of-the-art. It relies on minimizing an upper bound on the error probability, which is in the case of linear models with Gaussian noise proven to be concave in the most challenging discrimination conditions. A simulation study is conducted both for open-loop and feedback controlled candidate models. The results demonstrate the favorable trade-off using the new contributions in this manuscript.
title Online input design for discrimination of linear models using concave minimization
topic Systems and Control
url https://arxiv.org/abs/2401.05782