Thomas Leifeld

Thomas Leifeld

Auto-generated profile, based on publicly available information

Thomas Leifeld

Institute of Automatic Control, Technische Universität Kaiserslautern, Kaiserslautern, Germany

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
20 September 2017 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
ZZZhihua Zhang
Zhihua Zhang
TLThomas Leifeld
Thomas Leifeld
PZPing Zhang
Ping Zhang
In this paper, we propose an approach to design tracking controllers for Boolean control networks to track a time-varying reference output trajectory of finite length by applying the semi-tensor product method. First, we give necessary and sufficient conditions for the trackability of the reference output trajectory. Secondly, in the case of a trackable output trajectory, one control sequence that realizes exact tracking can be found directly by means of backward selection. Otherwise, l_1 and l_inifinity optimization problems can be formulated to find the control sequence that minimizes the tracking error. These optimization problems can be extended to take changes in control inputs into account. An additional advantage of the proposed approaches is that state, transition and input constraints can be easily taken into account during the design of the controllers. Finally, illustrative example is given to demonstrate the proposed approaches.

20 May 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
ZZZhihua Zhang
Zhihua Zhang
TLThomas Leifeld
Thomas Leifeld
PZPing Zhang
Ping Zhang
In this paper, we propose an approach to design reduced-order state observer for Boolean control networks (BCNs) by applying the semi-tensor product (STP). At first, an approach is given to find reducible state variables. After that, we introduce an approach for reduced-order observer design based on the reducible state variables. Then, it is shown that similar to the Luenberger-like observer, the state estimate provided by the reduced-order observer also converges to real state at time not later than the minimal reconstructibility index. Additionally, the reduced-order observer requires lower computational effort, which facilitates an online implementation.

4 July 2019 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
ZZZhihua Zhang
Zhihua Zhang
TLThomas Leifeld
Thomas Leifeld
PZPing Zhang
Ping Zhang
The reconstructibility analysis and observer design for general Boolean control networks (BCNs) are investigated in this paper. At first, to discriminate reconstructibility from observability, the relationship between different types of observability and reconstructibility existing in the literature is studied. For reconstructibility analysis, explicit and recursive methods are derived. A termination condition is provided to avoid the running of the recursive method longer than necessary. After that, if a general BCN is reconstructible, then an approach for observer design is given. The Luenberger-like observer for general BCNs is introduced to facilitate an online implementation. The state estimate always contains the real state and converges to the real state at a time not later than the minimal reconstructibility index. Finally, examples are given to illustrate the proposed approaches.

1 January 2019 in Annual Reviews in Control
Verified
Journal Article
Closed access
TLThomas Leifeld
Thomas Leifeld
ZZZhihua Zhang
Zhihua Zhang
PZPing Zhang
Ping Zhang

3 June 2016 in at - Automatisierungstechnik
Verified
Journal Article
Closed access
PDF file
TLThomas Leifeld
Thomas Leifeld
JSJan Schlegel
Jan Schlegel
PZPing Zhang
Ping Zhang
Zusammenfassung: Die Erstellung des Markovmodells einer komplexen Sicherheitseinrichtung unter Berücksichtigung von Instandhaltungsmaßnahmen zu festgelegten Zeitpunkten ist komplex und schränkt den möglichen Detailierungsgrad ein. Probabilistische Boolesche Netzwerke (PBN) werden als kompakte lineare Darstellung für stochastische Automaten mit deterministischen Übergängen eingeführt. Für diese wird dann eine neue Methode entwickelt, mit welcher das Modell eines komplexen Systems mit einfachen Eingaben automatisch erstellt werden kann.