1 code implementation • 27 Feb 2024 • Christian Nauck, Michael Lindner, Nora Molkenthin, Jürgen Kurths, Eckehard Schöll, Jörg Raisch, Frank Hellmann
A functional property that is of theoretical and practical interest for oscillatory systems is the stability of synchrony to localized perturbations.
no code implementations • 29 Jan 2024 • Arnold Sterle, Christian A. Hans, Jörg Raisch
In this paper, a model predictive control scheme for wind farms is presented.
no code implementations • 8 May 2023 • Halil Yigit Oksuz, Fabio Molinari, Henning Sprekeler, Jörg Raisch
This strategy, often called federated learning, is mainly employed for two reasons: (i) improving resource-efficiency by avoiding to share potentially large datasets and (ii) guaranteeing privacy of local agents' data.
no code implementations • 4 May 2023 • Davide Zorzenon, Jan Komenda, Jörg Raisch
P-time event graphs are discrete event systems suitable for modeling processes in which tasks must be executed in predefined time windows.
1 code implementation • 28 Apr 2023 • Arnold Sterle, Aaron Grapentin, Christian A. Hans, Jörg Raisch
In this paper, an offset-free bilinear model predictive control approach for wind turbines is presented.
no code implementations • 14 Nov 2022 • Aaron Grapentin, Arnold Sterle, Jörg Raisch, Christian A. Hans
The simulations show a similar active power tracking performance, while the LQ optimal controller results in lower mechanical wear.
no code implementations • 1 Jun 2022 • Davide Zorzenon, Jiří Balun, Jörg Raisch
P-time event graphs (P-TEGs) are event graphs where the residence time of tokens in places is bounded by specified time windows.
no code implementations • 3 Apr 2022 • Davide Zorzenon, Jan Komenda, Jörg Raisch
P-time event graphs are discrete event systems suitable for modeling processes in which tasks must be executed in predefined time windows.
no code implementations • 5 Jul 2016 • Vladislav Nenchev, Christos G. Cassandras, Jörg Raisch
This paper addresses an optimal control problem for a robot that has to find and collect a finite number of objects and move them to a depot in minimum time.