Daniel Gerbet

Mr. Daniel Gerbet


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2020 in at - Automatisierungstechnik
Verified
Journal Article
Closed access
DGDaniel Gerbet
Daniel Gerbet
KRKlaus Röbenack
Klaus Röbenack
It is very difficult to check the observability of nonlinear systems. Even for local observability, the observability rank condition provides only a sufficient condition. Much more difficult is the verification of global observability. This paper deals with the local and global observability analysis of polynomial systems based on algebraic geometry. In particular, we derive a decidable criterion for the verification of global observability of polynomial systems. Our framework can also be employed for local observability analysis.

10 August 2021 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
DGDaniel Gerbet
Daniel Gerbet
KRKlaus Röbenack
Klaus Röbenack
LaSalle’s invariance principle is a commonly used extension of Lyapunov’s second method to study asymptotic stability of nonlinear systems. If the system can be written in polynomial form, the examination can be automated using algebraic geometry and quantifier elimination. This article addresses this automated examination using a method relying on polynomial ideals and applies it on some example systems. In addition, some properties of these special ideals are derived that allow to reduce the computational effort significantly.

1 February 2023 in Machines
Verified
Journal Article
Open access
PDF file
DGDaniel Gerbet
Daniel Gerbet
KRKlaus Röbenack
Klaus Röbenack
This article deals with the construction of high-gain observers for autonomous polynomial dynamical systems. In contrast to the usual approach, the system’s state is embedded into a higher dimensional Euclidean space. The observer state will be contained in said Euclidean space, which has usually higher dimension than the system’s state space. Due to this embedding it is possible to avoid singularities in the observation matrix. For some systems this even allows constructing global observers in a structured way, which would not be possible in the lower-dimensional case. Finally, the state estimate in the original coordinates can be obtained by a projection. The proposed method is applied on some example systems.

27 August 2021 in Algorithms
Verified
Journal Article
Open access
PDF file
DGDaniel Gerbet
Daniel Gerbet
KRKlaus Röbenack
Klaus Röbenack
This paper addresses the problem of identifiability of nonlinear polynomial state-space systems. Such systems have already been studied via the input-output equations, a description that, in general, requires differential algebra. The authors use a different algebraic approach, which is based on distinguishability and observability. Employing techniques from algebraic geometry such as polynomial ideals and Gröbner bases, local as well as global results are derived. The methods are illustrated on some example systems.

14 March 2024 in Optimization Methods and Software
Verified
Journal Article
Open access
KRKlaus Röbenack
Klaus Röbenack
DGDaniel Gerbet
Daniel Gerbet

1 August 2023 in at - Automatisierungstechnik
Verified
Journal Article
Closed access
DGDaniel Gerbet
Daniel Gerbet
KRKlaus Röbenack
Klaus Röbenack
Zusammenfassung: In vielen Anwendungen der Regelungstechnik werden Beobachter eingesetzt, um interne Zustandsgrößen oder Parameter zu schätzen oder Fehler zu detektieren. Solche Beobachter lassen sich auch für nichtlineare Systeme systematisch auf Basis der Beobachter- oder der Beobachtbarkeitsnormalform entwerfen. Letztere existiert für eine größere Systemklasse. Allerdings ist das Vektorfeld in der Beobachtbarkeitsnormalform nicht unbedingt an allen Punkten definiert oder Lipschitz-stetig, selbst wenn diese Eigenschaften auf die ursprüngliche Systemdarstellung zutreffen. Durch die Einbettung in höherdimensionale Räume ist es möglich, die Normalform einerseits zu konstruieren und gegebenenfalls gewisse singuläre Punkte zu vermeiden. In diesem Beitrag wird gezeigt, wie dies systematisch für polynomiale Systeme mit mehreren Ein- oder Ausgängen bewerkstelligt werden kann.