arXiv subjects

Karl Worthmann

Publications and source records attributed to Karl Worthmann.

105 records · Page 6Linked to original sources

arXiv2020

A Dissipativity Characterization of Velocity Turnpikes in Optimal Control Problems for Mechanical Systems

Turnpikes have recently gained significant research interest in optimal control, since they allow for pivotal insights into the structure of solutions to optimal control problems. So far, mainly steady state solutions which serve as optimal operation points, are studied. This is in contrast to time-varying turnpikes, which are in the focus of this paper. More concretely, we analyze symmetry-induced velocity turnpikes, i.e. controlled relative equilibria, called trim primitives, which are optimal operation points regarding the given cost criterion. We characterize velocity turnpikes by means of dissipativity inequalities. Moreover, we study the equivalence between optimal control problems and steady-state problems via the corresponding necessary optimality conditions. An academic example is given for illustration.

eess.SY↗

arXiv2020

Distributed Control Enforcing Group Sparsity in Smart Grids

In modern smart grids, charging of local energy storage devices is coordinated on a residential level to compensate the volatile aggregated power demand on the time interval of interest. However, this results in a perpetual usage of all batteries which reduces their lifetime. We enforce group sparsity by using an $\ell_{p,q}$-regularization on the control to counteract this phenomenon. This leads to a non-smooth convex optimization problem, for which we propose a tailored Alternating Direction Method of Multipliers algorithm. We elaborate further how to embed it in a Model Predictive Control framework. We show that the proposed scheme yields sparse control while achieving reasonable overall peak shaving by numerical simulations.

eess.SY↗

arXiv2019

Model Predictive Control, Cost Controllability, and Homogeneity *

We are concerned with the design of Model Predictive Control (MPC) schemes such that asymptotic stability of the resulting closed loop is guaranteed even if the linearization at the desired set point fails to be stabilizable. Therefore, we propose to construct the stage cost based on the homogeneous approximation and rigorously show that applying MPC yields an asymp-totically stable closed-loop behavior if the homogeneous approximation is asymptotically null controllable. To this end, we verify cost controllability-a condition relating the current state, the stage cost, and the growth of the value function w.r.t. time-for this class of systems in order to provide stability and performance guarantees for the proposed MPC scheme without stabilizing terminal costs or constraints.

math.OC↗

arXiv2019

Learning-based Funnel-MPC for output-constrained nonlinear systems

We exploit an adaptive control technique, namely funnel control, in order to establish both initial and recursive feasibility in Model Predictive Control (MPC) for output-constrained nonlinear systems. Moreover, we show that the resulting feedback controller outperforms the funnel controller both w.r.t. the required sampling rate for a zero-order-hold implementation and required control action. We further propose a combination of funnel control and MPC, exploiting the performance guarantees of the model-free funnel controller during a learning phase and the advantages of the model-based MPC scheme thereafter.

math.OC↗

arXiv2019

Surrogate Models in Bidirectional Optimization of Coupled Microgrids

The energy transition entails a rapid uptake of renewable energy sources. Besides physical changes within the grid infrastructure, energy storage devices and their smart operation are key measures to master the resulting challenges like, e.g., a highly fluctuating power generation. For the latter, optimization based control has demonstrated its potential on a microgrid level. However, if a network of coupled microgrids is considered, iterative optimization schemes including several communication rounds are typically used. Here, we propose to replace the optimization on the microgrid level by using surrogate models either derived from radial basis functions or neural networks to avoid this iterative procedure. We prove well-posedness of our approach and demonstrate its efficiency by numerical simulations based on real data provided by an Australian grid operator.

math.OC↗

arXiv2019

Towards multiobjective optimization and control of smart grids

The rapid uptake of renewable energy sources in the electricity grid leads to a demand in load shaping and flexibility. Energy storage devices such as batteries are a key element to provide solutions to these tasks. However, typically a trade-off between the performance related goal of load shaping and the objective of having flexibility in store for auxiliary services, which is for example linked to robustness and resilience of the grid, can be observed. We propose to make use of the concept of Pareto optimality in order to resolve this issue in a multiobjective framework. In particular, we analyse the Pareto frontier and quantify the trade-off between the non-aligned objectives to properly balance them.

math.OC↗

arXiv2019

Towards Velocity Turnpikes in Optimal Control of Mechanical Systems

The paper proposes first steps towards the formalization and characterization of time-varying turnpikes in optimal control of mechanical systems. We propose the concepts of velocity steady states, which can be considered as partial steady states, and hyperbolic velocity turnpike properties for analysis and control. We show for a specific example that, for all finite horizons, both the (essential part of the) optimal solution and the orbit of the time-varying turnpike correspond to (optimal) trim solutions. Hereby, the present paper appears to be the first to combine the concepts of trim primitives and time-varying turnpike properties.

math.OC↗

arXiv2019

Symmetry and Motion Primitives in Model Predictive Control

Symmetries, e.g. rotational and translational invariances for the class of mechanical systems, allow to characterize solution trajectories of nonlinear dynamical systems. Thus, the restriction to symmetry-induced dynamics, e.g. by using the concept of motion primitives, may be considered as a quantization of the system. Symmetry exploitation is well-established in both motion planning and control. However, the linkage between the respective techniques to optimal control is not yet fully explored. In this manuscript, we want to lay the foundation for the usage of symmetries in Model Predictive Control (MPC). To this end, we investigate a mobile robot example in detail where our contribution is twofold: Firstly, we establish asymptotic stability of a desired set point w.r.t. the MPC closed loop, which is also demonstrated numerically by using motion primitives applied to the parallel parking scenario. Secondly, if the optimization criterion is not consistent with the symmetry action, we provide guidelines to rigorously derive stability guarantees based on symmetry exploitation.

math.OC↗

arXiv2018

Optimal control of differential-algebraic equations from an ordinary differential equation perspective

We study the Optimal Control Problem (OCP) for regular linear differential-algebraic systems (DAEs). To this end, we introduce the input index, which allows, on the one hand, to characterize the space of consistent initial values in terms of a Kalman-like matrix and, on the other hand, the necessary smoothness properties of the control. The latter is essential to make the problem accessible from a numerical point of view. Moreover, we derive an augmented system as the key to analyze the OCP with tools well-known from optimal control of ordinary differential equations. The new concepts of the input index and the augmented system provide easily checkable sufficient conditions which ensure that the stage costs are consistent with the differential-algebraic system.

math.OC↗

arXiv2014

Stability and Performance Guarantees for MPC Algorithms without Terminal Constraints

A typical bottleneck of model predictive control algorithms is the computational burden in order to compute the receding horizon feedback law which is predominantly determined by the length of the prediction horizon. Based on a relaxed Lyapunov inequality we present techniques which allow us to show stability and suboptimality estimates for a reduced prediction horizon. In particular, the known structural properties of suboptimality estimates based on a controllability condition are used to cut the gap between theoretic stability results and numerical observations.

math.OC↗

arXiv2014

Predictive Control Algorithms: Stability despite Shortened Optimization Horizons

The stability analysis of model predictive control schemes without terminal constraints and/or costs has attracted considerable attention during the last years. We pursue a recently proposed approach which can be used to determine a suitable optimization horizon length for nonlinear control systems governed by ordinary differential equations. In this context, we firstly show how the essential growth assumption involved in this methodology can be derived and demonstrate this technique by means of a numerical example. Secondly, inspired by corresponding results, we develop an algorithm which allows to reduce the required optimization horizon length while maintaining asymptotic stability or a desired performance bound. Last, this basic algorithm is further elaborated in order to enhance its robustness properties.

math.OC↗

arXiv2012

Ensuring Stability in Networked Systems with Nonlinear MPC for Continuous Time Systems

For networked systems, the control law is typically subject to network flaws such as delays and packet dropouts. Hence, the time in between updates of the control law varies unexpectedly. Here, we present a stability theorem for nonlinear model predictive control with varying control horizon in a continuous time setting without stabilizing terminal constraints or costs. It turns out that stability can be concluded under the same conditions as for a (short) fixed control horizon.

math.OC↗

arXiv2012

Analysis of Unconstrained Nonlinear MPC Schemes with Time Varying Control Horizons

For nonlinear discrete time systems satisfying a controllability condition, we present a stability condition for model predictive control without stabilizing terminal constraints or costs. The condition is given in terms of an analytical formula which can be employed in order to determine a prediction horizon length for which asymptotic stability or a performance guarantee is ensured. Based on this formula a sensitivity analysis with respect to the prediction and the possibly time varying control horizon is carried out.

math.OC↗

arXiv2011

Reducing the Prediction Horizon in NMPC: An Algorithm Based Approach

In order to guarantee stability, known results for MPC without additional terminal costs or endpoint constraints often require rather large prediction horizons. Still, stable behavior of closed loop solutions can often be observed even for shorter horizons. Here, we make use of the recent observation that stability can be guaranteed for smaller prediction horizons via Lyapunov arguments if more than only the first control is implemented. Since such a procedure may be harmful in terms of robustness, we derive conditions which allow to increase the rate at which state measurements are used for feedback while maintaining stability and desired performance specifications. Our main contribution consists in developing two algorithms based on the deduced conditions and a corresponding stability theorem which ensures asymptotic stability for the MPC closed loop for significantly shorter prediction horizons.

math.OC↗

arXiv2010

Analysis of unconstrained nonlinear MPC schemes with time varying control horizon

For discrete time nonlinear systems satisfying an exponential or finite time controllability assumption, we present an analytical formula for a suboptimality estimate for model predictive control schemes without stabilizing terminal constraints. Based on our formula, we perform a detailed analysis of the impact of the optimization horizon and the possibly time varying control horizon on stability and performance of the closed loop.

math.OC↗