Search

This paper is devoted to the generic parameters identifiability analysis for structured linear systems with unknown inputs. The proposed method is based on a graph-theoretic approach and assumes only the knowledge of the system’s structure. Necessary and sufficient conditions are expressed in graphical terms which ensure that a given set of unknown parameters characterising the model of the system are structurally identifiable using the available measurements, assuming that the inputs and initial conditions are quite informative. Even if we are not interested in proposing identification schemes, these given conditions are necessary and sufficient to the parameter identification whatever the used algorithms to determine numerically the parameters values. Finally, note that the given conditions are quite easy to check because they are based on searching and comparing some specific paths and cycles in a digraph. This makes our approach well suited to study large-scale systems. [ABSTRACT FROM PUBLISHER]

Abstract: This paper deals with the observability of the discrete mode, the internal state and the input of switching structured linear systems with unknown input. The proposed method, based on a graph-theoretic approach, assumes only the knowledge of the system’s structure. We express, in graphical terms, necessary and sufficient conditions for the generic observability of the discrete mode, the continuous internal state and the input of a switching structured linear system. These conditions can be implemented by classical graph theory algorithms based on finding particular paths and cycles in a digraph. [ABSTRACT FROM AUTHOR]

Abstract: This paper deals with the problem of additional sensor location in order to recover the state and input observability for structured linear systems. The proposed method is based on a graph-theoretic approach and assumes only the knowledge of the system’s structure. It allows one to provide the minimal number of the required sensors and either their pertinent location or a necessary and sufficient condition which allows one to check if a sensor location is adequate or not. We obtain a sensor placement procedure based on classical and well-known graph theory algorithms, which have polynomial complexity orders. [Copyright &y& Elsevier]