HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Nonlinear Unknown Input Observability: Extension of the Observability Rank Condition and the Case of a Single Unknown Input

Agostino Martinelli 1
1 E-MOTION - Geometry and Probability for Motion and Action
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : This paper investigates the unknown input observability problem in the nonlinear case under the assumption that the unknown inputs are differentiable functions of time (up to a given order). The goal is not to design new observers but to provide simple analytic conditions in order to check the weak local observability of the state. The analysis starts by extending the observability rank condition. This is obtained by a state augmentation and is called the extended observability rank condition (first contribution). The proposed extension of the observability rank condition only provides sufficient conditions for the state observability. On the other hand, in the case of a single unknown input, the paper provides a simple algorithm to directly obtain the entire observable codistribution (second and main contribution). As in the standard case of only known inputs, the observable codistribution is obtained by recursively computing the Lie derivatives along the vector fields that characterize the dynamics. However, in correspondence of the unknown input, the corresponding vector field must be suitably rescaled. Additionally, the Lie derivatives must be computed also along a new set of vector fields that are obtained by recursively performing suitable Lie bracketing of the vector fields that define the dynamics. In practice, the entire observable codistribution is obtained by a very simple recursive algorithm. However, the analytic derivations required to prove that this codistribution fully characterizes the weak local observability of the state are complex. Finally, it is shown that the recursive algorithm converges in a finite number of steps and the criterion to establish that the convergence has been reached is provided. Also this proof is based on several tricky analytical steps. Several applications illustrate the derived theoretical results, both in the case of a single unknown input and in the case of multiple unknown inputs.
Complete list of metadata

Cited literature [40 references]  Display  Hide  Download

Contributor : Agostino Martinelli Connect in order to contact the contributor
Submitted on : Thursday, March 24, 2016 - 12:34:20 PM
Last modification on : Wednesday, February 2, 2022 - 3:56:36 PM
Long-term archiving on: : Monday, November 14, 2016 - 5:49:56 AM


Files produced by the author(s)


  • HAL Id : hal-01071314, version 5


Agostino Martinelli. Nonlinear Unknown Input Observability: Extension of the Observability Rank Condition and the Case of a Single Unknown Input. [Research Report] RR-8608, INRIA Grenoble. 2014. ⟨hal-01071314v5⟩



Record views


Files downloads