## Publications

Liste im Research Information System öffnen

## 2021

B. Gebken, S. Peitz, Journal of Optimization Theory and Applications (2021), 188, pp. 696-723

In this article, we present an efficient descent method for locally Lipschitz continuous multiobjective optimization problems (MOPs). The method is realized by combining a theoretical result regarding the computation of descent directions for nonsmooth MOPs with a practical method to approximate the subdifferentials of the objective functions. We show convergence to points which satisfy a necessary condition for Pareto optimality. Using a set of test problems, we compare our method to the multiobjective proximal bundle method by M\"akel\"a. The results indicate that our method is competitive while being easier to implement. While the number of objective function evaluations is larger, the overall number of subgradient evaluations is lower. Finally, we show that our method can be combined with a subdivision algorithm to compute entire Pareto sets of nonsmooth MOPs.

@article{Gebken_Peitz_2021, title={An efficient descent method for locally Lipschitz multiobjective optimization problems}, volume={188}, DOI={10.1007/s10957-020-01803-w}, journal={Journal of Optimization Theory and Applications}, author={Gebken, Bennet and Peitz, Sebastian}, year={2021}, pages={696–723} }

M.B. Berkemeier, S. Peitz, Mathematical and Computational Applications (2021), 26(2), 31

We present a flexible trust region descend algorithm for unconstrained and convexly constrained multiobjective optimization problems. It is targeted at heterogeneous and expensive problems, i.e., problems that have at least one objective function that is computationally expensive. The method is derivative-free in the sense that neither need derivative information be available for the expensive objectives nor are gradients approximated using repeated function evaluations as is the case in finite-difference methods. Instead, a multiobjective trust region approach is used that works similarly to its well-known scalar pendants. Local surrogate models constructed from evaluation data of the true objective functions are employed to compute possible descent directions. In contrast to existing multiobjective trust region algorithms, these surrogates are not polynomial but carefully constructed radial basis function networks. This has the important advantage that the number of data points scales linearly with the parameter space dimension. The local models qualify as fully linear and the corresponding general scalar framework is adapted for problems with multiple objectives. Convergence to Pareto critical points is proven and numerical examples illustrate our findings.

@article{Berkemeier_Peitz_2021, title={Derivative-Free Multiobjective Trust Region Descent Method Using Radial Basis Function Surrogate Models}, volume={26}, DOI={10.3390/mca26020031}, number={231}, journal={Mathematical and Computational Applications}, author={Berkemeier, Manuel Bastian and Peitz, Sebastian}, year={2021} }

M. Dellnitz, E. Hüllermeier, M. Lücke, S. Ober-Blöbaum, C. Offen, S. Peitz, K. Pfannschmidt, in: arXiv:2104.03562, 2021

Many problems in science and engineering require the efficient numerical approximation of integrals, a particularly important application being the numerical solution of initial value problems for differential equations. For complex systems, an equidistant discretization is often inadvisable, as it either results in prohibitively large errors or computational effort. To this end, adaptive schemes have been developed that rely on error estimators based on Taylor series expansions. While these estimators a) rely on strong smoothness assumptions and b) may still result in erroneous steps for complex systems (and thus require step rejection mechanisms), we here propose a data-driven time stepping scheme based on machine learning, and more specifically on reinforcement learning (RL) and meta-learning. First, one or several (in the case of non-smooth or hybrid systems) base learners are trained using RL. Then, a meta-learner is trained which (depending on the system state) selects the base learner that appears to be optimal for the current situation. Several examples including both smooth and non-smooth problems demonstrate the superior performance of our approach over state-of-the-art numerical schemes. The code is available under https://github.com/lueckem/quadrature-ML.

@article{Dellnitz_Hüllermeier_Lücke_Ober-Blöbaum_Offen_Peitz_Pfannschmidt_2021, title={Efficient time stepping for numerical integration using reinforcement learning}, journal={arXiv:2104.03562}, author={Dellnitz, Michael and Hüllermeier, Eyke and Lücke, Marvin and Ober-Blöbaum, Sina and Offen, Christian and Peitz, Sebastian and Pfannschmidt, Karlson}, year={2021} }

S. Ober-Blöbaum, S. Peitz, International Journal of Robust and Nonlinear Control (2021), 31(2), pp. 380-403

Model predictive control is a prominent approach to construct a feedback control loop for dynamical systems. Due to real-time constraints, the major challenge in MPC is to solve model-based optimal control problems in a very short amount of time. For linear-quadratic problems, Bemporad et al. have proposed an explicit formulation where the underlying optimization problems are solved a priori in an offline phase. In this article, we present an extension of this concept in two significant ways. We consider nonlinear problems and - more importantly - problems with multiple conflicting objective functions. In the offline phase, we build a library of Pareto optimal solutions from which we then obtain a valid compromise solution in the online phase according to a decision maker's preference. Since the standard multi-parametric programming approach is no longer valid in this situation, we instead use interpolation between different entries of the library. To reduce the number of problems that have to be solved in the offline phase, we exploit symmetries in the dynamical system and the corresponding multiobjective optimal control problem. The results are verified using two different examples from autonomous driving.

@article{Ober-Blöbaum_Peitz_2021, title={Explicit multiobjective model predictive control for nonlinear systems with symmetries}, volume={31}, DOI={10.1002/rnc.5281}, number={2}, journal={International Journal of Robust and Nonlinear Control}, author={Ober-Blöbaum, Sina and Peitz, Sebastian}, year={2021}, pages={380–403} }

F. Nüske, S. Peitz, F. Philipp, M. Schaller, K. Worthmann, in: arXiv:2108.07102, 2021

The Koopman operator has become an essential tool for data-driven approximation of dynamical (control) systems in recent years, e.g., via extended dynamic mode decomposition. Despite its popularity, convergence results and, in particular, error bounds are still quite scarce. In this paper, we derive probabilistic bounds for the approximation error and the prediction error depending on the number of training data points; for both ordinary and stochastic differential equations. Moreover, we extend our analysis to nonlinear control-affine systems using either ergodic trajectories or i.i.d. samples. Here, we exploit the linearity of the Koopman generator to obtain a bilinear system and, thus, circumvent the curse of dimensionality since we do not autonomize the system by augmenting the state by the control inputs. To the best of our knowledge, this is the first finite-data error analysis in the stochastic and/or control setting. Finally, we demonstrate the effectiveness of the proposed approach by comparing it with state-of-the-art techniques showing its superiority whenever state and control are coupled.

@article{Nüske_Peitz_Philipp_Schaller_Worthmann_2021, title={Finite-data error bounds for Koopman-based prediction and control}, journal={arXiv:2108.07102}, author={Nüske, Feliks and Peitz, Sebastian and Philipp, Friedrich and Schaller, Manuel and Worthmann, Karl}, year={2021} }

B. Gebken, S. Peitz, Journal of Global Optimization (2021), 80, pp. 3-29

It is a challenging task to identify the objectives on which a certain decision was based, in particular if several, potentially conflicting criteria are equally important and a continuous set of optimal compromise decisions exists. This task can be understood as the inverse problem of multiobjective optimization, where the goal is to find the objective function vector of a given Pareto set. To this end, we present a method to construct the objective function vector of an unconstrained multiobjective optimization problem (MOP) such that the Pareto critical set contains a given set of data points with prescribed KKT multipliers. If such an MOP can not be found, then the method instead produces an MOP whose Pareto critical set is at least close to the data points. The key idea is to consider the objective function vector in the multiobjective KKT conditions as variable and then search for the objectives that minimize the Euclidean norm of the resulting system of equations. By expressing the objectives in a finite-dimensional basis, we transform this problem into a homogeneous, linear system of equations that can be solved efficiently. Potential applications of this approach include the identification of objectives (both from clean and noisy data) and the construction of surrogate models for expensive MOPs.

@article{Gebken_Peitz_2021, title={Inverse multiobjective optimization: Inferring decision criteria from data}, volume={80}, DOI={10.1007/s10898-020-00983-z}, journal={Journal of Global Optimization}, publisher={Springer}, author={Gebken, Bennet and Peitz, Sebastian}, year={2021}, pages={3–29} }

B. Gebken, K. Bieker, S. Peitz, in: arXiv:2111.06775, 2021

Regularization is used in many different areas of optimization when solutions are sought which not only minimize a given function, but also possess a certain degree of regularity. Popular applications are image denoising, sparse regression and machine learning. Since the choice of the regularization parameter is crucial but often difficult, path-following methods are used to approximate the entire regularization path, i.e., the set of all possible solutions for all regularization parameters. Due to their nature, the development of these methods requires structural results about the regularization path. The goal of this article is to derive these results for the case of a smooth objective function which is penalized by a piecewise differentiable regularization term. We do this by treating regularization as a multiobjective optimization problem. Our results suggest that even in this general case, the regularization path is piecewise smooth. Moreover, our theory allows for a classification of the nonsmooth features that occur in between smooth parts. This is demonstrated in two applications, namely support-vector machines and exact penalty methods.

@article{Gebken_Bieker_Peitz_2021, title={On the structure of regularization paths for piecewise differentiable regularization terms}, journal={arXiv:2111.06775}, author={Gebken, Bennet and Bieker, Katharina and Peitz, Sebastian}, year={2021} }

K. Bieker, B. Gebken, S. Peitz, IEEE Transactions on Pattern Analysis and Machine Intelligence (2021)

We present a novel algorithm that allows us to gain detailed insight into the effects of sparsity in linear and nonlinear optimization, which is of great importance in many scientific areas such as image and signal processing, medical imaging, compressed sensing, and machine learning (e.g., for the training of neural networks). Sparsity is an important feature to ensure robustness against noisy data, but also to find models that are interpretable and easy to analyze due to the small number of relevant terms. It is common practice to enforce sparsity by adding the ℓ1-norm as a weighted penalty term. In order to gain a better understanding and to allow for an informed model selection, we directly solve the corresponding multiobjective optimization problem (MOP) that arises when we minimize the main objective and the ℓ1-norm simultaneously. As this MOP is in general non-convex for nonlinear objectives, the weighting method will fail to provide all optimal compromises. To avoid this issue, we present a continuation method which is specifically tailored to MOPs with two objective functions one of which is the ℓ1-norm. Our method can be seen as a generalization of well-known homotopy methods for linear regression problems to the nonlinear case. Several numerical examples - including neural network training - demonstrate our theoretical findings and the additional insight that can be gained by this multiobjective approach.

@article{Bieker_Gebken_Peitz_2021, title={On the Treatment of Optimization Problems with L1 Penalty Terms via Multiobjective Continuation}, DOI={10.1109/TPAMI.2021.3114962}, journal={IEEE Transactions on Pattern Analysis and Machine Intelligence}, publisher={IEEE}, author={Bieker, Katharina and Gebken, Bennet and Peitz, Sebastian}, year={2021} }

S. Peitz, K. Bieker, in: arXiv:2102.04722, 2021

As in almost every other branch of science, the major advances in data science and machine learning have also resulted in significant improvements regarding the modeling and simulation of nonlinear dynamical systems. It is nowadays possible to make accurate medium to long-term predictions of highly complex systems such as the weather, the dynamics within a nuclear fusion reactor, of disease models or the stock market in a very efficient manner. In many cases, predictive methods are advertised to ultimately be useful for control, as the control of high-dimensional nonlinear systems is an engineering grand challenge with huge potential in areas such as clean and efficient energy production, or the development of advanced medical devices. However, the question of how to use a predictive model for control is often left unanswered due to the associated challenges, namely a significantly higher system complexity, the requirement of much larger data sets and an increased and often problem-specific modeling effort. To solve these issues, we present a universal framework (which we call QuaSiModO: Quantization-Simulation-Modeling-Optimization) to transform arbitrary predictive models into control systems and use them for feedback control. The advantages of our approach are a linear increase in data requirements with respect to the control dimension, performance guarantees that rely exclusively on the accuracy of the predictive model, and only little prior knowledge requirements in control theory to solve complex control problems. In particular the latter point is of key importance to enable a large number of researchers and practitioners to exploit the ever increasing capabilities of predictive models for control in a straight-forward and systematic fashion.

@article{Peitz_Bieker_2021, title={On the Universal Transformation of Data-Driven Models to Control Systems}, journal={arXiv:2102.04722}, author={Peitz, Sebastian and Bieker, Katharina}, year={2021} }

## 2020

S. Klus, F. Nüske, S. Peitz, J. Niemann, C. Clementi, C. Schütte, Physica D: Nonlinear Phenomena (2020), 406, 132416

We derive a data-driven method for the approximation of the Koopman generator called gEDMD, which can be regarded as a straightforward extension of EDMD (extended dynamic mode decomposition). This approach is applicable to deterministic and stochastic dynamical systems. It can be used for computing eigenvalues, eigenfunctions, and modes of the generator and for system identification. In addition to learning the governing equations of deterministic systems, which then reduces to SINDy (sparse identification of nonlinear dynamics), it is possible to identify the drift and diffusion terms of stochastic differential equations from data. Moreover, we apply gEDMD to derive coarse-grained models of high-dimensional systems, and also to determine efficient model predictive control strategies. We highlight relationships with other methods and demonstrate the efficacy of the proposed methods using several guiding examples and prototypical molecular dynamics problems.

@article{Klus_Nüske_Peitz_Niemann_Clementi_Schütte_2020, title={Data-driven approximation of the Koopman generator: Model reduction, system identification, and control}, volume={406}, DOI={10.1016/j.physd.2020.132416}, number={132416}, journal={Physica D: Nonlinear Phenomena}, author={Klus, Stefan and Nüske, Feliks and Peitz, Sebastian and Niemann, Jan-Hendrik and Clementi, Cecilia and Schütte, Christof}, year={2020} }

S. Peitz, S.E. Otto, C.W. Rowley, SIAM Journal on Applied Dynamical Systems (2020), 19(3), pp. 2162-2193

In recent years, the success of the Koopman operator in dynamical systems analysis has also fueled the development of Koopman operator-based control frameworks. In order to preserve the relatively low data requirements for an approximation via Dynamic Mode Decomposition, a quantization approach was recently proposed in [Peitz & Klus, Automatica 106, 2019]. This way, control of nonlinear dynamical systems can be realized by means of switched systems techniques, using only a finite set of autonomous Koopman operator-based reduced models. These individual systems can be approximated very efficiently from data. The main idea is to transform a control system into a set of autonomous systems for which the optimal switching sequence has to be computed. In this article, we extend these results to continuous control inputs using relaxation. This way, we combine the advantages of the data efficiency of approximating a finite set of autonomous systems with continuous controls. We show that when using the Koopman generator, this relaxation --- realized by linear interpolation between two operators --- does not introduce any error for control affine systems. This allows us to control high-dimensional nonlinear systems using bilinear, low-dimensional surrogate models. The efficiency of the proposed approach is demonstrated using several examples with increasing complexity, from the Duffing oscillator to the chaotic fluidic pinball.

@article{Peitz_Otto_Rowley_2020, title={Data-Driven Model Predictive Control using Interpolated Koopman Generators}, volume={19}, DOI={10.1137/20M1325678}, number={3}, journal={SIAM Journal on Applied Dynamical Systems}, author={Peitz, Sebastian and Otto, Samuel E. and Rowley, Clarence W.}, year={2020}, pages={2162–2193} }

K. Bieker, S. Peitz, S.L. Brunton, J.N. Kutz, M. Dellnitz, Theoretical and Computational Fluid Dynamics (2020), 34, pp. 577–591

The control of complex systems is of critical importance in many branches of science, engineering, and industry, many of which are governed by nonlinear partial differential equations. Controlling an unsteady fluid flow is particularly important, as flow control is a key enabler for technologies in energy (e.g., wind, tidal, and combustion), transportation (e.g., planes, trains, and automobiles), security (e.g., tracking airborne contamination), and health (e.g., artificial hearts and artificial respiration). However, the high-dimensional, nonlinear, and multi-scale dynamics make real-time feedback control infeasible. Fortunately, these high- dimensional systems exhibit dominant, low-dimensional patterns of activity that can be exploited for effective control in the sense that knowledge of the entire state of a system is not required. Advances in machine learning have the potential to revolutionize flow control given its ability to extract principled, low-rank feature spaces characterizing such complex systems.We present a novel deep learning modelpredictive control framework that exploits low-rank features of the flow in order to achieve considerable improvements to control performance. Instead of predicting the entire fluid state, we use a recurrent neural network (RNN) to accurately predict the control relevant quantities of the system, which are then embedded into an MPC framework to construct a feedback loop. In order to lower the data requirements and to improve the prediction accuracy and thus the control performance, incoming sensor data are used to update the RNN online. The results are validated using varying fluid flow examples of increasing complexity.

@article{Bieker_Peitz_Brunton_Kutz_Dellnitz_2020, title={Deep model predictive flow control with limited sensor data and online learning}, volume={34}, DOI={10.1007/s00162-020-00520-4}, journal={Theoretical and Computational Fluid Dynamics}, author={Bieker, Katharina and Peitz, Sebastian and Brunton, Steven L. and Kutz, J. Nathan and Dellnitz, Michael}, year={2020}, pages={577–591} }

C.I. Hernández Castellanos, S. Ober-Blöbaum, S. Peitz, International Journal of Robust and Nonlinear Control (2020), 30(17), pp. 7593-7618

In real-world problems, uncertainties (e.g., errors in the measurement, precision errors) often lead to poor performance of numerical algorithms when not explicitly taken into account. This is also the case for control problems, where optimal solutions can degrade in quality or even become infeasible. Thus, there is the need to design methods that can handle uncertainty. In this work, we consider nonlinear multi-objective optimal control problems with uncertainty on the initial conditions, and in particular their incorporation into a feedback loop via model predictive control (MPC). In multi-objective optimal control, an optimal compromise between multiple conflicting criteria has to be found. For such problems, not much has been reported in terms of uncertainties. To address this problem class, we design an offline/online framework to compute an approximation of efficient control strategies. This approach is closely related to explicit MPC for nonlinear systems, where the potentially expensive optimization problem is solved in an offline phase in order to enable fast solutions in the online phase. In order to reduce the numerical cost of the offline phase, we exploit symmetries in the control problems. Furthermore, in order to ensure optimality of the solutions, we include an additional online optimization step, which is considerably cheaper than the original multi-objective optimization problem. We test our framework on a car maneuvering problem where safety and speed are the objectives. The multi-objective framework allows for online adaptations of the desired objective. Alternatively, an automatic scalarizing procedure yields very efficient feedback controls. Our results show that the method is capable of designing driving strategies that deal better with uncertainties in the initial conditions, which translates into potentially safer and faster driving strategies.

@article{Hernández Castellanos_Ober-Blöbaum_Peitz_2020, title={Explicit Multi-objective Model Predictive Control for Nonlinear Systems Under Uncertainty}, volume={30}, DOI={10.1002/rnc.5197}, number={17}, journal={International Journal of Robust and Nonlinear Control}, author={Hernández Castellanos, Carlos Ignacio and Ober-Blöbaum, Sina and Peitz, Sebastian}, year={2020}, pages={7593–7618} }

S. Peitz, S. Klus, in: Lecture Notes in Control and Information Sciences, Springer, 2020, pp. 257-282

In the development of model predictive controllers for PDE-constrained problems, the use of reduced order models is essential to enable real-time applicability. Besides local linearization approaches, proper orthogonal decomposition (POD) has been most widely used in the past in order to derive such models. Due to the huge advances concerning both theory as well as the numerical approximation, a very promising alternative based on the Koopman operator has recently emerged. In this chapter, we present two control strategies for model predictive control of nonlinear PDEs using data-efficient approximations of the Koopman operator. In the first one, the dynamic control system is replaced by a small number of autonomous systems with different yet constant inputs. The control problem is consequently transformed into a switching problem. In the second approach, a bilinear surrogate model is obtained via a convex combination of these autonomous systems. Using a recent convergence result for extended dynamic mode decomposition (EDMD), convergence of the reduced objective function can be shown. We study the properties of these two strategies with respect to solution quality, data requirements, and complexity of the resulting optimization problem using the 1-dimensional Burgers equation and the 2-dimensional Navier–Stokes equations as examples. Finally, an extension for online adaptivity is presented.

@inbook{Peitz_Klus_2020, place={Cham}, series={Lecture Notes in Control and Information Sciences}, title={Feedback Control of Nonlinear PDEs Using Data-Efficient Reduced Order Models Based on the Koopman Operator}, volume={484}, DOI={10.1007/978-3-030-35713-9_10}, booktitle={Lecture Notes in Control and Information Sciences}, publisher={Springer}, author={Peitz, Sebastian and Klus, Stefan}, year={2020}, pages={257–282}, collection={Lecture Notes in Control and Information Sciences} }

O. Schütze, O. Cuate, A. Martín, S. Peitz, M. Dellnitz, Engineering Optimization (2020), 52(5), pp. 832-855

Multi-objective optimization is an active field of research that has many applications. Owing to its success and because decision-making processes are becoming more and more complex, there is a recent trend for incorporating many objectives into such problems. The challenge with such problems, however, is that the dimensions of the solution sets—the so-called Pareto sets and fronts—grow with the number of objectives. It is thus no longer possible to compute or to approximate the entire solution set of a given problem that contains many (e.g. more than three) objectives. On the other hand, the computation of single solutions (e.g. via scalarization methods) leads to unsatisfying results in many cases, even if user preferences are incorporated. In this article, the Pareto Explorer tool is presented—a global/local exploration tool for the treatment of many-objective optimization problems (MaOPs). In the first step, a solution of the problem is computed via a global search algorithm that ideally already includes user preferences. In the second step, a local search along the Pareto set/front of the given MaOP is performed in user specified directions. For this, several continuation-like procedures are proposed that can incorporate preferences defined in decision, objective, or in weight space. The applicability and usefulness of Pareto Explorer is demonstrated on benchmark problems as well as on an application from industrial laundry design.

@article{Schütze_Cuate_Martín_Peitz_Dellnitz_2020, title={Pareto Explorer: a global/local exploration tool for many-objective optimization problems}, volume={52}, DOI={10.1080/0305215x.2019.1617286}, number={5}, journal={Engineering Optimization}, author={Schütze, Oliver and Cuate, Oliver and Martín, Adanay and Peitz, Sebastian and Dellnitz, Michael}, year={2020}, pages={832–855} }

K. Flaßkamp, S. Ober-Blöbaum, S. Peitz, in: Advances in Dynamics, Optimization and Computation, Springer, 2020

Many dynamical systems possess symmetries, e.g. rotational and translational invariances of mechanical systems. These can be beneficially exploited in the design of numerical optimal control methods. We present a model predictive control scheme which is based on a library of precomputed motion primitives. The primitives are equivalence classes w.r.t. the symmetry of the optimal control problems. Trim primitives as relative equilibria w.r.t. this symmetry, play a crucial role in the algorithm. The approach is illustrated using an academic mobile robot example.

@inbook{Flaßkamp_Ober-Blöbaum_Peitz_2020, place={Cham}, title={Symmetry in Optimal Control: A Multiobjective Model Predictive Control Approach}, DOI={10.1007/978-3-030-51264-4_9}, booktitle={Advances in Dynamics, Optimization and Computation}, publisher={Springer}, author={Flaßkamp, Kathrin and Ober-Blöbaum, Sina and Peitz, Sebastian}, editor={Junge, Oliver and Schütze, Oliver and Froyland, Gary and Ober-Blöbaum, Sina and Padberg-Gehle, KathrinEditors}, year={2020} }

## 2019

S. Hanke, S. Peitz, O. Wallscheid, J. Böcker, M. Dellnitz, in: 2019 IEEE International Symposium on Predictive Control of Electrical Drives and Power Electronics (PRECEDE), 2019

In comparison to classical control approaches in the field of electrical drives like the field-oriented control (FOC), model predictive control (MPC) approaches are able to provide a higher control performance. This refers to shorter settling times, lower overshoots, and a better decoupling of control variables in case of multi-variable controls. However, this can only be achieved if the used prediction model covers the actual behavior of the plant sufficiently well. In case of model deviations, the performance utilizing MPC remains below its potential. This results in effects like increased current ripple or steady state setpoint deviations. In order to achieve a high control performance, it is therefore necessary to adapt the model to the real plant behavior. When using an online system identification, a less accurate model is sufficient for commissioning of the drive system. In this paper, the combination of a finite-control-set MPC (FCS-MPC) with a system identification is proposed. The method does not require high-frequency signal injection, but uses the measured values already required for the FCS-MPC. An evaluation of the least squares-based identification on a laboratory test bench showed that the model accuracy and thus the control performance could be improved by an online update of the prediction models.

@inproceedings{Hanke_Peitz_Wallscheid_Böcker_Dellnitz_2019, title={Finite-Control-Set Model Predictive Control for a Permanent Magnet Synchronous Motor Application with Online Least Squares System Identification}, DOI={10.1109/precede.2019.8753313}, booktitle={2019 IEEE International Symposium on Predictive Control of Electrical Drives and Power Electronics (PRECEDE)}, author={Hanke, Soren and Peitz, Sebastian and Wallscheid, Oliver and Böcker, Joachim and Dellnitz, Michael}, year={2019} }

S. Peitz, S. Klus, Automatica (2019), 106, pp. 184-191

We present a new framework for optimal and feedback control of PDEs using Koopman operator-based reduced order models (K-ROMs). The Koopman operator is a linear but infinite-dimensional operator which describes the dynamics of observables. A numerical approximation of the Koopman operator therefore yields a linear system for the observation of an autonomous dynamical system. In our approach, by introducing a finite number of constant controls, the dynamic control system is transformed into a set of autonomous systems and the corresponding optimal control problem into a switching time optimization problem. This allows us to replace each of these systems by a K-ROM which can be solved orders of magnitude faster. By this approach, a nonlinear infinite-dimensional control problem is transformed into a low-dimensional linear problem. Using a recent convergence result for the numerical approximation via Extended Dynamic Mode Decomposition (EDMD), we show that the value of the K-ROM based objective function converges in measure to the value of the full objective function. To illustrate the results, we consider the 1D Burgers equation and the 2D Navier–Stokes equations. The numerical experiments show remarkable performance concerning both solution times and accuracy.

@article{Peitz_Klus_2019, title={Koopman operator-based model reduction for switched-system control of PDEs}, volume={106}, DOI={10.1016/j.automatica.2019.05.016}, journal={Automatica}, author={Peitz, Sebastian and Klus, Stefan}, year={2019}, pages={184–191} }

S. Peitz, S. Ober-Blöbaum, M. Dellnitz, Acta Applicandae Mathematicae (2019), 161(1), pp. 171–199

In a wide range of applications it is desirable to optimally control a dynamical system with respect to concurrent, potentially competing goals. This gives rise to a multiobjective optimal control problem where, instead of computing a single optimal solution, the set of optimal compromises, the so-called Pareto set, has to be approximated. When the problem under consideration is described by a partial differential equation (PDE), as is the case for fluid flow, the computational cost rapidly increases and makes its direct treatment infeasible. Reduced order modeling is a very popular method to reduce the computational cost, in particular in a multi query context such as uncertainty quantification, parameter estimation or optimization. In this article, we show how to combine reduced order modeling and multiobjective optimal control techniques in order to efficiently solve multiobjective optimal control problems constrained by PDEs. We consider a global, derivative free optimization method as well as a local, gradient-based approach for which the optimality system is derived in two different ways. The methods are compared with regard to the solution quality as well as the computational effort and they are illustrated using the example of the flow around a cylinder and a backward-facing-step channel flow.

@article{Peitz_Ober-Blöbaum_Dellnitz_2019, title={Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling}, volume={161}, DOI={10.1007/s10440-018-0209-7}, number={1}, journal={Acta Applicandae Mathematicae}, author={Peitz, Sebastian and Ober-Blöbaum, Sina and Dellnitz, Michael}, year={2019}, pages={171–199} }

B. Gebken, S. Peitz, M. Dellnitz, Journal of Global Optimization (2019), 73(4), pp. 891-913

In this article we show that the boundary of the Pareto critical set of an unconstrained multiobjective optimization problem (MOP) consists of Pareto critical points of subproblems where only a subset of the set of objective functions is taken into account. If the Pareto critical set is completely described by its boundary (e.g., if we have more objective functions than dimensions in decision space), then this can be used to efficiently solve the MOP by solving a number of MOPs with fewer objective functions. If this is not the case, the results can still give insight into the structure of the Pareto critical set.

@article{Gebken_Peitz_Dellnitz_2019, title={On the hierarchical structure of Pareto critical sets}, volume={73}, DOI={10.1007/s10898-019-00737-6}, number={4}, journal={Journal of Global Optimization}, author={Gebken, Bennet and Peitz, Sebastian and Dellnitz, Michael}, year={2019}, pages={891–913} }

S. Banholzer, B. Gebken, M. Dellnitz, S. Peitz, S. Volkwein, in: arXiv:1906.09075, 2019

Multiobjective optimization plays an increasingly important role in modern applications, where several objectives are often of equal importance. The task in multiobjective optimization and multiobjective optimal control is therefore to compute the set of optimal compromises (the Pareto set) between the conflicting objectives. Since the Pareto set generally consists of an infinite number of solutions, the computational effort can quickly become challenging which is particularly problematic when the objectives are costly to evaluate as is the case for models governed by partial differential equations (PDEs). To decrease the numerical effort to an affordable amount, surrogate models can be used to replace the expensive PDE evaluations. Existing multiobjective optimization methods using model reduction are limited either to low parameter dimensions or to few (ideally two) objectives. In this article, we present a combination of the reduced basis model reduction method with a continuation approach using inexact gradients. The resulting approach can handle an arbitrary number of objectives while yielding a significant reduction in computing time.

@article{Banholzer_Gebken_Dellnitz_Peitz_Volkwein_2019, title={ROM-based multiobjective optimization of elliptic PDEs via numerical continuation}, journal={arXiv:1906.09075}, author={Banholzer, Stefan and Gebken, Bennet and Dellnitz, Michael and Peitz, Sebastian and Volkwein, Stefan}, year={2019} }

## 2018

B. Gebken, S. Peitz, M. Dellnitz, in: Numerical and Evolutionary Optimization – NEO 2017, 2018

In this article we propose a descent method for equality and inequality constrained multiobjective optimization problems (MOPs) which generalizes the steepest descent method for unconstrained MOPs by Fliege and Svaiter to constrained problems by using two active set strategies. Under some regularity assumptions on the problem, we show that accumulation points of our descent method satisfy a necessary condition for local Pareto optimality. Finally, we show the typical behavior of our method in a numerical example.

@inproceedings{Gebken_Peitz_Dellnitz_2018, place={Cham}, title={A Descent Method for Equality and Inequality Constrained Multiobjective Optimization Problems}, DOI={10.1007/978-3-319-96104-0_2}, booktitle={Numerical and Evolutionary Optimization – NEO 2017}, author={Gebken, Bennet and Peitz, Sebastian and Dellnitz, Michael}, year={2018} }

S. Peitz, M. Dellnitz, Mathematical and Computational Applications (2018), 23(2)

Multiobjective optimization plays an increasingly important role in modern applications, where several criteria are often of equal importance. The task in multiobjective optimization and multiobjective optimal control is therefore to compute the set of optimal compromises (the Pareto set) between the conflicting objectives. The advances in algorithms and the increasing interest in Pareto-optimal solutions have led to a wide range of new applications related to optimal and feedback control, which results in new challenges such as expensive models or real-time applicability. Since the Pareto set generally consists of an infinite number of solutions, the computational effort can quickly become challenging, which is particularly problematic when the objectives are costly to evaluate or when a solution has to be presented very quickly. This article gives an overview of recent developments in accelerating multiobjective optimal control for complex problems where either PDE constraints are present or where a feedback behavior has to be achieved. In the first case, surrogate models yield significant speed-ups. Besides classical meta-modeling techniques for multiobjective optimization, a promising alternative for control problems is to introduce a surrogate model for the system dynamics. In the case of real-time requirements, various promising model predictive control approaches have been proposed, using either fast online solvers or offline-online decomposition. We also briefly comment on dimension reduction in many-objective optimization problems as another technique for reducing the numerical effort.

@article{Peitz_Dellnitz_2018, title={A Survey of Recent Trends in Multiobjective Optimal Control—Surrogate Models, Feedback Control and Objective Reduction}, volume={23}, DOI={10.3390/mca23020030}, number={2}, journal={Mathematical and Computational Applications}, author={Peitz, Sebastian and Dellnitz, Michael}, year={2018} }

S. Klus, S. Peitz, I. Schuster, in: arXiv:1805.10118, 2018

Kernel transfer operators, which can be regarded as approximations of transfer operators such as the Perron-Frobenius or Koopman operator in reproducing kernel Hilbert spaces, are defined in terms of covariance and cross-covariance operators and have been shown to be closely related to the conditional mean embedding framework developed by the machine learning community. The goal of this paper is to show how the dominant eigenfunctions of these operators in combination with gradient-based optimization techniques can be used to detect long-lived coherent patterns in high-dimensional time-series data. The results will be illustrated using video data and a fluid flow example.

@article{Klus_Peitz_Schuster_2018, title={Analyzing high-dimensional time-series data using kernel transfer operator eigenfunctions}, journal={arXiv:1805.10118}, author={Klus, Stefan and Peitz, Sebastian and Schuster, Ingmar}, year={2018} }

S. Peitz, in: arXiv:1801.06419, 2018

In a recent article, we presented a framework to control nonlinear partial differential equations (PDEs) by means of Koopman operator based reduced models and concepts from switched systems. The main idea was to transform a control system into a set of autonomous systems for which the optimal switching sequence has to be computed. These individual systems can be approximated very efficiently by reduced order models obtained from data, and one can guarantee equality of the full and the reduced objective function under certain assumptions. In this article, we extend these results to continuous control inputs using convex combinations of multiple Koopman operators corresponding to constant controls, which results in a bilinear control system. Although equality of the objectives can be carried over when the PDE depends linearly on the control, we show that this approach is also valid in other scenarios using several flow control examples of varying complexity.

@article{Peitz_2018, title={Controlling nonlinear PDEs using low-dimensional bilinear approximations obtained from data}, journal={arXiv:1801.06419}, author={Peitz, Sebastian}, year={2018} }

F. Kummert, A. Albers, C. Bremer, S. Büttner, M. Dellnitz, R. Dumitrescu, M. Gräler, V. Just, H. Mucha, S. Peitz, C. Röcker, A. Trächtler, C. Tschirner, S. Wang, J. Wittrowski, in: Ressourceneffiziente Selbstoptimierende Wäscherei – Ergebnisse des ReSerW-Projekts, Springer, 2018

@inbook{Kummert_Albers_Bremer_Büttner_Dellnitz_Dumitrescu_Gräler_Just_Mucha_Peitz_et al._2018, place={Paderborn}, title={Eingesetzte wissenschaftliche Methoden}, booktitle={Ressourceneffiziente Selbstoptimierende Wäscherei – Ergebnisse des ReSerW-Projekts}, publisher={Springer}, author={Kummert, Franz and Albers, Alexander and Bremer, Christian and Büttner, Sebastian and Dellnitz, Michael and Dumitrescu, Roman and Gräler, Manuel and Just, Viktor and Mucha, Henrik and Peitz, Sebastian and et al.}, editor={Trächtler, AnsgarEditor}, year={2018} }

S. Hanke, S. Peitz, O. Wallscheid, S. Klus, J. Böcker, M. Dellnitz, in: arXiv:1804.00854, 2018

Predictive control of power electronic systems always requires a suitable model of the plant. Using typical physics-based white box models, a trade-off between model complexity (i.e. accuracy) and computational burden has to be made. This is a challenging task with a lot of constraints, since the model order is directly linked to the number of system states. Even though white-box models show suitable performance in most cases, parasitic real-world effects often cannot be modeled satisfactorily with an expedient computational load. Hence, a Koopman operator-based model reduction technique is presented which directly links the control action to the system's outputs in a black-box fashion. The Koopman operator is a linear but infinite-dimensional operator describing the dynamics of observables of nonlinear autonomous dynamical systems which can be nicely applied to the switching principle of power electronic devices. Following this data-driven approach, the model order and the number of system states are decoupled which allows us to consider more complex systems. Extensive experimental tests with an automotive-type permanent magnet synchronous motor fed by an IGBT 2-level inverter prove the feasibility of the proposed modeling technique in a finite-set model predictive control application.

@article{Hanke_Peitz_Wallscheid_Klus_Böcker_Dellnitz_2018, title={Koopman Operator-Based Finite-Control-Set Model Predictive Control for Electrical Drives}, journal={arXiv:1804.00854}, author={Hanke, Sören and Peitz, Sebastian and Wallscheid, Oliver and Klus, Stefan and Böcker, Joachim and Dellnitz, Michael}, year={2018} }

D. Beermann, M. Dellnitz, S. Peitz, S. Volkwein, in: PAMM, 2018, pp. 51-54

A framework for set‐oriented multiobjective optimal control of partial differential equations using reduced order modeling has recently been developed [1]. Following concepts from localized reduced bases methods, error estimators for the reduced cost functionals are utilized to construct a library of locally valid reduced order models. This way, a superset of the Pareto set can efficiently be computed while maintaining a prescribed error bound. In this article, this algorithm is applied to a problem with non‐smooth objective functionals. Using an academic example, we show that the extension to non‐smooth problems can be realized in a straightforward manner. We then discuss the implications on the numerical results.

@inproceedings{Beermann_Dellnitz_Peitz_Volkwein_2018, title={POD-based multiobjective optimal control of PDEs with non-smooth objectives}, DOI={10.1002/pamm.201710015}, booktitle={PAMM}, author={Beermann, Dennis and Dellnitz, Michael and Peitz, Sebastian and Volkwein, Stefan}, year={2018}, pages={51–54} }

D. Beermann, M. Dellnitz, S. Peitz, S. Volkwein, in: Reduced-Order Modeling (ROM) for Simulation and Optimization, 2018, pp. 47-72

In this chapter, we combine a global, derivative-free subdivision algorithm for multiobjective optimization problems with a posteriori error estimates for reduced-order models based on Proper Orthogonal Decomposition in order to efficiently solve multiobjective optimization problems governed by partial differential equations. An error bound for a semilinear heat equation is developed in such a way that the errors in the conflicting objectives can be estimated individually. The resulting algorithm constructs a library of locally valid reduced-order models online using a Greedy (worst-first) search. Using this approach, the number of evaluations of the full-order model can be reduced by a factor of more than 1000.

@inbook{Beermann_Dellnitz_Peitz_Volkwein_2018, place={Cham}, title={Set-Oriented Multiobjective Optimal Control of PDEs Using Proper Orthogonal Decomposition}, DOI={10.1007/978-3-319-75319-5_3}, booktitle={Reduced-Order Modeling (ROM) for Simulation and Optimization}, author={Beermann, Dennis and Dellnitz, Michael and Peitz, Sebastian and Volkwein, Stefan}, year={2018}, pages={47–72} }

S. Klus, P. Gelß, S. Peitz, C. Schütte, Nonlinearity (2018), 31(7), pp. 3359-3380

Dynamic mode decomposition (DMD) is a recently developed tool for the analysis of the behavior of complex dynamical systems. In this paper, we will propose an extension of DMD that exploits low-rank tensor decompositions of potentially high-dimensional data sets to compute the corresponding DMD modes and eigenvalues. The goal is to reduce the computational complexity and also the amount of memory required to store the data in order to mitigate the curse of dimensionality. The efficiency of these tensor-based methods will be illustrated with the aid of several different fluid dynamics problems such as the von Kármán vortex street and the simulation of two merging vortices.

@article{Klus_Gelß_Peitz_Schütte_2018, title={Tensor-based dynamic mode decomposition}, volume={31}, DOI={10.1088/1361-6544/aabc8f}, number={7}, journal={Nonlinearity}, author={Klus, Stefan and Gelß, Patrick and Peitz, Sebastian and Schütte, Christof}, year={2018}, pages={3359–3380} }

## 2017

S. Peitz, 2017

Multiobjective optimization plays an increasingly important role in modern applications, where several criteria are often of equal importance. The task in multiobjective optimization and multiobjective optimal control is therefore to compute the set of optimal compromises (the Pareto set) between the conflicting objectives. Since – in contrast to the solution of a single objective optimization problem – the Pareto set generally consists of an infinite number of solutions, the computational effort can quickly become challenging. This is even more the case when many problems have to be solved, when the number of objectives is high, or when the objectives are costly to evaluate. Consequently, this thesis is devoted to the identification and exploitation of structure both in the Pareto set and the dynamics of the underlying model as well as to the development of efficient algorithms for solving problems with additional parameters, with a high number of objectives or with PDE-constraints. These three challenges are addressed in three respective parts. In the first part, predictor-corrector methods are extended to entire Pareto sets. When certain smoothness assumptions are satisfied, then the set of parameter dependent Pareto sets possesses additional structure, i.e. it is a manifold. The tangent space can be approximated numerically which yields a direction for the predictor step. In the corrector step, the predicted set converges to the Pareto set at a new parameter value. The resulting algorithm is applied to an example from autonomous driving. In the second part, the hierarchical structure of Pareto sets is investigated. When considering a subset of the objectives, the resulting solution is a subset of the Pareto set of the original problem. Under additional smoothness assumptions, the respective subsets are located on the boundary of the Pareto set of the full problem. This way, the “skeleton” of a Pareto set can be computed and due to the exponential increase in computing time with the number of objectives, the computations of these subsets are significantly faster which is demonstrated using an example from industrial laundries. In the third part, PDE-constrained multiobjective optimal control problems are addressed by reduced order modeling methods. Reduced order models exploit the structure in the system dynamics, for example by describing the dynamics of only the most energetic modes. The model reduction introduces an error in both the function values and their gradients, which has to be taken into account in the development of algorithms. Both scalarization and set-oriented approaches are coupled with reduced order modeling. Convergence results are presented and the numerical benefit is investigated. The algorithms are applied to semi-linear heat flow problems as well as to the Navier-Stokes equations.

@book{Peitz_2017, title={ Exploiting structure in multiobjective optimization and optimal control}, DOI={10.17619/UNIPB/1-176}, author={Peitz, Sebastian}, year={2017} }

S. Peitz, K. Schäfer, S. Ober-Blöbaum, J. Eckstein, U. Köhler, M. Dellnitz, IFAC-PapersOnLine (2017), 50(1), pp. 8674-8679

We present a new algorithm for model predictive control of non-linear systems with respect to multiple, conflicting objectives. The idea is to provide a possibility to change the objective in real-time, e.g. as a reaction to changes in the environment or the system state itself. The algorithm utilises elements from various well-established concepts, namely multiobjective optimal control, economic as well as explicit model predictive control and motion planning with motion primitives. In order to realise real-time applicability, we split the computation into an online and an offline phase and we utilise symmetries in the open-loop optimal control problem to reduce the number of multiobjective optimal control problems that need to be solved in the offline phase. The results are illustrated using the example of an electric vehicle where the longitudinal dynamics are controlled with respect to the concurrent objectives arrival time and energy consumption.

@article{Peitz_Schäfer_Ober-Blöbaum_Eckstein_Köhler_Dellnitz_2017, title={A Multiobjective MPC Approach for Autonomously Driven Electric Vehicles}, volume={50}, DOI={10.1016/j.ifacol.2017.08.1526}, number={1}, journal={IFAC-PapersOnLine}, author={Peitz, Sebastian and Schäfer, Kai and Ober-Blöbaum, Sina and Eckstein, Julian and Köhler, Ulrich and Dellnitz, Michael}, year={2017}, pages={8674–8679} }

S. Peitz, M. Dellnitz, in: NEO 2016, 2017, pp. 159-182

In this article we develop a gradient-based algorithm for the solution of multiobjective optimization problems with uncertainties. To this end, an additional condition is derived for the descent direction in order to account for inaccuracies in the gradients and then incorporated into a subdivision algorithm for the computation of global solutions to multiobjective optimization problems. Convergence to a superset of the Pareto set is proved and an upper bound for the maximal distance to the set of substationary points is given. Besides the applicability to problems with uncertainties, the algorithm is developed with the intention to use it in combination with model order reduction techniques in order to efficiently solve PDE-constrained multiobjective optimization problems.

@inproceedings{Peitz_Dellnitz_2017, place={Cham}, title={Gradient-Based Multiobjective Optimization with Uncertainties}, DOI={10.1007/978-3-319-64063-1_7}, booktitle={NEO 2016}, author={Peitz, Sebastian and Dellnitz, Michael}, year={2017}, pages={159–182} }

M. Dellnitz, J. Eckstein, K. Flaßkamp, P. Friedel, C. Horenkamp, U. Köhler, S. Ober-Blöbaum, S. Peitz, S. Tiemeyer, in: Progress in Industrial Mathematics at ECMI 2014 , Springer International Publishing, 2017, pp. 633-641

During the last years, alternative drive technologies, for example electrically powered vehicles (EV), have gained more and more attention, mainly caused by an increasing awareness of the impact of CO2 emissions on climate change and by the limitation of fossil fuels. However, these technologies currently come with new challenges due to limited lithium ion battery storage density and high battery costs which lead to a considerably reduced range in comparison to conventional internal combustion engine powered vehicles. For this reason, it is desirable to increase the vehicle range without enlarging the battery. When the route and the road slope are known in advance, it is possible to vary the vehicles velocity within certain limits in order to reduce the overall drivetrain energy consumption. This may either result in an increased range or, alternatively, in larger energy reserves for comfort functions such as air conditioning. In this presentation, we formulate the challenge of range extension as a multiobjective optimal control problem. We then apply different numerical methods to calculate the so-called Pareto set of optimal compromises for the drivetrain power profile with respect to the two concurrent objectives battery state of charge and mean velocity. In order to numerically solve the optimal control problem by means of a direct method, a time discretization of the drivetrain power profile is necessary. In combination with a vehicle dynamics simulation model, the optimal control problem is transformed into a high dimensional nonlinear optimization problem. For the approximation of the Pareto set, two different optimization algorithms implemented in the software package GAIO are used. The first one yields a global optimal solution by applying a set-oriented subdivision technique to parameter space. By construction, this technique is limited to coarse discretizations of the drivetrain power profile. In contrast, the second technique, which is based on an image space continuation method, is more suitable when the number of parameters is large while the number of objectives is less than five. We compare the solutions of the two algorithms and study the influence of different discretizations on the quality of the solutions. A MATLAB/Simulink model is used to describe the dynamics of an EV. It is based on a drivetrain efficiency map and considers vehicle properties such as rolling friction and air drag, as well as environmental conditions like slope and ambient temperature. The vehicle model takes into account the traction battery too, enabling an exact prediction of the batterys response to power requests of drivetrain and auxiliary loads, including state of charge.

@inproceedings{Dellnitz_Eckstein_Flaßkamp_Friedel_Horenkamp_Köhler_Ober-Blöbaum_Peitz_Tiemeyer_2017, place={Cham}, title={Multiobjective Optimal Control Methods for the Development of an Intelligent Cruise Control}, DOI={10.1007/978-3-319-23413-7_87}, booktitle={Progress in Industrial Mathematics at ECMI 2014 }, publisher={Springer International Publishing}, author={Dellnitz, Michael and Eckstein, Julian and Flaßkamp, Kathrin and Friedel, Patrick and Horenkamp, Christian and Köhler, Ulrich and Ober-Blöbaum, Sina and Peitz, Sebastian and Tiemeyer, Sebastian}, year={2017}, pages={633–641} }

## 2016

J. Eckstein, S. Peitz, K. Schäfer, P. Friedel, U. Köhler, M.H. Molo, S. Ober-Blöbaum, M. Dellnitz, in: Procedia Technology, 2016, pp. 465-472

In this contribution we compare two different approaches to the implementation of a Model Predictive Controller in an electric vehicle with respect to the quality of the solution and real-time applicability. The goal is to develop an intelligent cruise control in order to extend the vehicle range, i.e. to minimize energy consumption, by computing the optimal torque profile for a given track. On the one hand, a path-based linear model with strong simplifications regarding the vehicle dynamics is used. On the other hand, a nonlinear model is employed in which the dynamics of the mechanical and electrical subsystem are modeled.

@inproceedings{Eckstein_Peitz_Schäfer_Friedel_Köhler_Molo_Ober-Blöbaum_Dellnitz_2016, title={A Comparison of two Predictive Approaches to Control the Longitudinal Dynamics of Electric Vehicles}, DOI={10.1016/j.protcy.2016.08.059}, booktitle={Procedia Technology}, author={Eckstein, Julian and Peitz, Sebastian and Schäfer, Kai and Friedel, Patrick and Köhler, Ulrich and Molo, Mirko Hessel-von and Ober-Blöbaum, Sina and Dellnitz, Michael}, year={2016}, pages={465–472} }

S. Peitz, M. Gräler, C. Henke, M.H. Molo, M. Dellnitz, A. Trächtler, in: Procedia Technology, 2016, pp. 483-490

In a wide range of applications, it is desirable to optimally control a system with respect to concurrent, potentially competing goals. This gives rise to a multiobjective optimal control problem where, instead of computing a single optimal solution, the set of optimal compromises, the so-called Pareto set, has to be approximated. When it is not possible to compute the entire control trajectory in advance, for instance due to uncertainties or unforeseeable events, model predictive control methods can be applied to control the system during operation in real time. In this article, we present an algorithm for the solution of multiobjective model predictive control problems. In an offline scenario, it can be used to compute the entire set of optimal compromises whereas in a real time scenario, one optimal compromise is computed according to an operator's preference. The results are illustrated using the example of an industrial laundry. A logistics model of the laundry is developed and then utilized in the optimization routine. Results are presented for an offline as well as an online scenario.

@inproceedings{Peitz_Gräler_Henke_Molo_Dellnitz_Trächtler_2016, title={Multiobjective Model Predictive Control of an Industrial Laundry}, DOI={10.1016/j.protcy.2016.08.061}, booktitle={Procedia Technology}, author={Peitz, Sebastian and Gräler, Manuel and Henke, Christian and Molo, Mirko Hessel-von and Dellnitz, Michael and Trächtler, Ansgar}, year={2016}, pages={483–490} }

## 2015

S. Peitz, M. Dellnitz, in: PAMM, 2015, pp. 613-614

n this article an efficient numerical method to solve multiobjective optimization problems for fluid flow governed by the Navier Stokes equations is presented. In order to decrease the computational effort, a reduced order model is introduced using Proper Orthogonal Decomposition and a corresponding Galerkin Projection. A global, derivative free multiobjective optimization algorithm is applied to compute the Pareto set (i.e. the set of optimal compromises) for the concurrent objectives minimization of flow field fluctuations and control cost. The method is illustrated for a 2D flow around a cylinder at Re = 100.

@inproceedings{Peitz_Dellnitz_2015, title={Multiobjective Optimization of the Flow Around a Cylinder Using Model Order Reduction}, DOI={10.1002/pamm.201510296}, booktitle={PAMM}, author={Peitz, Sebastian and Dellnitz, Michael}, year={2015}, pages={613–614} }

## 2014

M. Dellnitz, J. Eckstein, K. Flaßkamp, P. Friedel, C. Horenkamp, U. Köhler, S. Ober-Blöbaum, S. Peitz, S. Tiemeyer, in: Procedia Technology, 2014, pp. 285-294

In this contribution, the range extension problem of electric vehicles is addressed. To this aim, an intelligent cruise control is developed based on the formulation of an optimal control problem. Solutions of this optimal control problem are energy efficient accelerator pedal position profiles. They can be computed numerically by a direct optimal control method using sequential quadratic programming. The approach is applied to two different driving scenarios. The results show that the energy efficiency is increased by using optimal control for both an artificial and a realistic scenario.

@inproceedings{Dellnitz_Eckstein_Flaßkamp_Friedel_Horenkamp_Köhler_Ober-Blöbaum_Peitz_Tiemeyer_2014, title={Development of an Intelligent Cruise Control Using Optimal Control Methods}, volume={15}, DOI={10.1016/j.protcy.2014.09.082}, booktitle={Procedia Technology}, author={Dellnitz, Michael and Eckstein, Julian and Flaßkamp, Kathrin and Friedel, Patrick and Horenkamp, Christian and Köhler, Ulrich and Ober-Blöbaum, Sina and Peitz, Sebastian and Tiemeyer, Sebastian}, year={2014}, pages={285–294} }