TL;DR
This paper compares two symbolic algorithms, ORC-DF and FISPO, for analyzing the observability of nonlinear systems with known and unknown inputs, highlighting their differences, strengths, and limitations, and implementing them in a MATLAB toolbox.
Contribution
It provides an analytical comparison of ORC-DF and FISPO algorithms, and integrates both into the STRIKE-GOLDD toolbox for easier application.
Findings
FISPO is more generally applicable to nonlinear models.
ORC-DF can be more efficient for affine models with known inputs.
The choice of algorithm depends on model characteristics.
Abstract
The observability of a dynamical system is affected by the presence of external inputs, either known (such as control actions) or unknown (disturbances). Inputs of unknown magnitude are especially detrimental for observability, and they also complicate its analysis. Hence the availability of computational tools capable of analysing the observability of nonlinear systems with unknown inputs has been limited until lately. Two symbolic algorithms based on differential geometry, ORC-DF and FISPO, have been recently proposed for this task, but their critical analysis and comparison is still lacking. Here we perform an analytical comparison of both algorithms and evaluate their performance on a set of problems, discussing their strengths and limitations. Additionally, we use these analyses to provide insights about certain aspects of the relationship between inputs and observability. We find…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
