Searcharxiv⌕ Search

arXiv subjects

Matthias A. Müller

Publications and source records attributed to Matthias A. Müller.

At least 73 records · Page 4Linked to original sources

Linearly discounted economic MPC without terminal conditions for periodic optimal operation

In this work, we study economic model predictive control (MPC) in situations where the optimal operating behavior is periodic. In such a setting, the performance of a standard economic MPC scheme without terminal conditions can generally be far from optimal even with arbitrarily long prediction horizons. Whereas there are modified economic MPC schemes that guarantee optimal performance, all of them are based on prior knowledge of the optimal period length or of the optimal periodic orbit itself. In contrast to these approaches, we propose to achieve optimality by multiplying the stage cost by a linear discount factor. This modification is not only easy to implement but also independent of any system- or cost-specific properties, making the scheme robust against online changes therein. Under standard dissipativity and controllability assumptions, we can prove that the resulting linearly discounted economic MPC without terminal conditions achieves optimal asymptotic average performance up to an error that vanishes with growing prediction horizons. Moreover, we can guarantee practical asymptotic stability of the optimal periodic orbit under the additional technical assumption that dissipativity holds with a continuous storage function. We complement these qualitative guarantees with a quantitative analysis of the transient and asymptotic average performance of the linearly discounted MPC scheme in a numerical simulation study.

eess.SY↗

A moving horizon state and parameter estimation scheme with guaranteed robust convergence

We propose a moving horizon estimation scheme for joint state and parameter estimation for nonlinear uncertain discrete-time systems. We establish robust exponential convergence of the combined estimation error subject to process disturbances and measurement noise. We employ a joint incremental input/output-to-state stability ($δ$-IOSS) Lyapunov function to characterize nonlinear detectability for the states and (constant) parameters of the system. Sufficient conditions for the construction of a joint $δ$-IOSS Lyapunov function are provided for a special class of nonlinear systems using a persistence of excitation condition. The theoretical results are illustrated by a numerical example.

eess.SY↗

Motion Planning using Reactive Circular Fields: A 2D Analysis of Collision Avoidance and Goal Convergence

Recently, many reactive trajectory planning approaches were suggested in the literature because of their inherent immediate adaption in the ever more demanding cluttered and unpredictable environments of robotic systems. However, typically those approaches are only locally reactive without considering global path planning and no guarantees for simultaneous collision avoidance and goal convergence can be given. In this paper, we study a recently developed circular field (CF)-based motion planner that combines local reactive control with global trajectory generation by adapting an artificial magnetic field such that multiple trajectories around obstacles can be evaluated. In particular, we provide a mathematically rigorous analysis of this planner in a planar environment to ensure safe motion of the controlled robot. Contrary to existing results, the derived collision avoidance analysis covers the entire CF motion planning algorithm including attractive forces for goal convergence and is not limited to a specific choice of the rotation field, i.e., our guarantees are not limited to a specific potentially suboptimal trajectory. Our Lyapunov-type collision avoidance analysis is based on the definition of an (equivalent) two-dimensional auxiliary system, which enables us to provide tight, if and only if conditions for the case of a collision with point obstacles. Furthermore, we show how this analysis naturally extends to multiple obstacles and we specify sufficient conditions for goal convergence. Finally, we provide a challenging simulation scenario with multiple non-convex point cloud obstacles and demonstrate collision avoidance and goal convergence.

cs.RO↗

Data-driven distributed MPC of dynamically coupled linear systems

In this paper, we present a data-driven distributed model predictive control (MPC) scheme to stabilise the origin of dynamically coupled discrete-time linear systems subject to decoupled input constraints. The local optimisation problems solved by the subsystems rely on a distributed adaptation of the Fundamental Lemma by Willems et al., allowing to parametrise system trajectories using only measured input-output data without explicit model knowledge. For the local predictions, the subsystems rely on communicated assumed trajectories of neighbours. Each subsystem guarantees a small deviation from these trajectories via a consistency constraint. We provide a theoretical analysis of the resulting non-iterative distributed MPC scheme, including proofs of recursive feasibility and (practical) stability. Finally, the approach is successfully applied to a numerical example.

eess.SY↗

Informed Circular Fields for Global Reactive Obstacle Avoidance of Robotic Manipulators

In this paper a global reactive motion planning framework for robotic manipulators in complex dynamic environments is presented. In particular, the circular field predictions (CFP) planner from Becker et al. (2021) is extended to ensure obstacle avoidance of the whole structure of a robotic manipulator. Towards this end, a motion planning framework is developed that leverages global information about promising avoidance directions from arbitrary configuration space motion planners, resulting in improved global trajectories while reactively avoiding dynamic obstacles and decreasing the required computational power. The resulting motion planning framework is tested in multiple simulations with complex and dynamic obstacles and demonstrates great potential compared to existing motion planning approaches.

cs.RO↗

Model predictive control for the prescription of antithyroid agents

Although hyperthyroidism is a common disease, the pharmaceutical therapy is based on a trial-and-error approach. We extend a mathematical model of the pituitary-thyroid feedback loop such that the intake of one antithyroid agent, namely methimazole (MMI), can be considered and use a model predictive control (MPC) scheme to determine suitable dosages.

eess.SY↗

On an integral variant of incremental input/output-to-state stability and its use as a notion of nonlinear detectability

We propose a time-discounted integral variant of incremental input/output-to-state stability (i-iIOSS) together with an equivalent Lyapunov function characterization. Continuity of the i-iIOSS Lyapunov function is ensured if the system satisfies a certain continuity assumption involving the Osgood condition. We show that the proposed i-iIOSS notion is a necessary condition for the existence of a robustly globally asymptotically stable observer mapping in a time-discounted ``$L^2$-to-$L^\infty$'' sense. In combination, our results provide a general framework for a Lyapunov-based robust stability analysis of observers for continuous-time systems, which in particular is crucial for the use of optimization-based state estimators (such as moving horizon estimation).

eess.SY↗

On the design of persistently exciting inputs for data-driven control of linear and nonlinear systems

In the context of data-driven control, persistence of excitation (PE) of an input sequence is defined in terms of a rank condition on the Hankel matrix of the input data. For nonlinear systems, recent results employed rank conditions involving collected input and state/output data, for which no guidelines are available on how to satisfy them a priori. In this paper, we first show that a set of discrete impulses is guaranteed to be persistently exciting for any controllable LTI system. Based on this result, for certain classes of nonlinear systems, we guarantee persistence of excitation of sequences of basis functions a priori, by design of the physical input only.

math.OC↗

Online convex optimization for constrained control of linear systems using a reference governor

In this work, we propose a control scheme for linear systems subject to pointwise in time state and input constraints that aims to minimize time-varying and a priori unknown cost functions. The proposed controller is based on online convex optimization and a reference governor. In particular, we apply online gradient descent to track the time-varying and a priori unknown optimal steady state of the system. Moreover, we use a $λ$-contractive set to enforce constraint satisfaction and a sufficient convergence rate of the closed-loop system to the optimal steady state. We prove that the proposed scheme is recursively feasible, ensures that the state and input constraints are satisfied at all times, and achieves a dynamic regret that is linearly bounded by the variation of the cost functions. The algorithm's performance and constraint satisfaction is illustrated by means of a simulation example.

eess.SY↗

On the relation between dynamic regret and closed-loop stability

In this work, we study the relations between bounded dynamic regret and the classical notion of asymptotic stability for the case of a priori unknown and time-varying cost functions. In particular, we show that bounded dynamic regret implies asymptotic stability of the optimal steady state for a constant cost function. For the case of an asymptotically stable closed loop, we first derive a necessary condition for achieving bounded dynamic regret. Then, given some additional assumptions on the system and the cost functions, we also provide a sufficient condition ensuring bounded dynamic regret. Our results are illustrated by examples.

math.OC↗

Robust Stability of Gaussian Process Based Moving Horizon Estimation

In this paper, we introduce a Gaussian process based moving horizon estimation (MHE) framework. The scheme is based on offline collected data and offline hyperparameter optimization. In particular, compared to standard MHE schemes, we replace the mathematical model of the system by the posterior mean of the Gaussian process. To account for the uncertainty of the learned model, we exploit the posterior variance of the learned Gaussian process in the weighting matrices of the cost function of the proposed MHE scheme. We prove practical robust exponential stability of the resulting estimator using a recently proposed Lyapunov-based proof technique. Finally, the performance of the Gaussian process based MHE scheme is illustrated via a nonlinear system.

eess.SY↗

A Lyapunov function for robust stability of moving horizon estimation

We provide a novel robust stability analysis for moving horizon estimation (MHE) using a Lyapunov function. Additionally, we introduce linear matrix inequalities (LMIs) to verify the necessary incremental input/output-to-state stability ($δ$-IOSS) detectability condition. We consider an MHE formulation with time-discounted quadratic objective for nonlinear systems admitting an exponential $δ$-IOSS Lyapunov function. We show that with a suitable parameterization of the MHE objective, the $δ$-IOSS Lyapunov function serves as an $M$-step Lyapunov function for MHE. Provided that the estimation horizon is chosen large enough, this directly implies exponential stability of MHE. The stability analysis is also applicable to full information estimation, where the restriction to exponential $δ$-IOSS can be relaxed. Moreover, we provide simple LMI conditions to systematically derive $δ$-IOSS Lyapunov functions, which allows us to easily verify $δ$-IOSS for a large class of nonlinear detectable systems. This is useful in the context of MHE in general, since most of the existing nonlinear (robust) stability results for MHE depend on the system being $δ$-IOSS (detectable). In combination, we thus provide a framework for designing MHE schemes with guaranteed robust exponential stability. The applicability of the proposed methods is demonstrated with a nonlinear chemical reactor process and a 12-state quadrotor model.

eess.SY↗

Sample-based observability of linear discrete-time systems

In this work, sample-based observability of linear discrete-time systems is studied. That is, we consider the case where the system output measurements are not available at every time instance. It is shown that some discrete-time systems exhibit particular behaviors that lead to pathological sampling. Depending on the characteristics of the system, different sampling schemes are developed that allow the system state to be reconstructed.

eess.SY↗

Distributed Model Predictive Control for Periodic Cooperation of Multi-Agent Systems

We consider multi-agent systems with heterogeneous, nonlinear agents subject to individual constraints that want to achieve a periodic, dynamic cooperative control goal which can be characterised by a set and a suitable cost. We propose a sequential distributed model predictive control (MPC) scheme in which agents sequentially solve an individual optimisation problem to track an artificial periodic output trajectory. The optimisation problems are coupled through these artificial periodic output trajectories, which are communicated and penalised using the cost that characterises the cooperative goal. The agents communicate only their artificial trajectories and only once per time step. We show that under suitable assumptions, the agents can incrementally move their artificial output trajectories towards the cooperative goal, and, hence, their closed-loop output trajectories asymptotically achieve it. We illustrate the scheme with a simulation example.

eess.SY↗

An Efficient Off-Policy Reinforcement Learning Algorithm for the Continuous-Time LQR Problem

In this paper, an off-policy reinforcement learning algorithm is designed to solve the continuous-time LQR problem using only input-state data measured from the system. Different from other algorithms in the literature, we propose the use of a specific persistently exciting input as the exploration signal during the data collection step. We then show that, using this persistently excited data, the solution of the matrix equation in our algorithm is guaranteed to exist and to be unique at every iteration. Convergence of the algorithm to the optimal control input is also proven. Moreover, we formulate the policy evaluation step as the solution of a Sylvester-transpose equation, which increases the efficiency of its solution. Finally, a method to determine a stabilizing policy to initialize the algorithm using only measured data is proposed.

eess.SY↗

On a Continuous-Time Version of Willems' Lemma

In this paper, a method to represent every input-output trajectory of a continuous-time linear system in terms of previously collected data is presented. This corresponds to a continuous-time version of the well-known Willems' lemma. The result is obtained by sampling the continuous signals at regular intervals, and constructing Hankel-like structures that closely resemble their discrete-time counterparts. Then, it is shown how to use measured persistently excited data to design a time-varying vector of parameters that allows the generation of arbitrary piecewise differentiable trajectories. A class of input signals that satisfies the conditions for persistence of excitation is also provided.

eess.SY↗

Efficient Off-Policy Q-Learning for Data-Based Discrete-Time LQR Problems

This paper introduces and analyzes an improved Q-learning algorithm for discrete-time linear time-invariant systems. The proposed method does not require any knowledge of the system dynamics, and it enjoys significant efficiency advantages over other data-based optimal control methods in the literature. This algorithm can be fully executed off-line, as it does not require to apply the current estimate of the optimal input to the system as in on-policy algorithms. It is shown that a persistently exciting input, defined from an easily tested matrix rank condition, guarantees the convergence of the algorithm. A data-based method is proposed to design the initial stabilizing feedback gain that the algorithm requires. Robustness of the algorithm in the presence of noisy measurements is analyzed. We compare the proposed algorithm in simulation to different direct and indirect data-based control design methods.

eess.SY↗

Practical exponential stability of a robust data-driven nonlinear predictive control scheme

We provide theoretical guarantees for recursive feasibility and practical exponential stability of the closed-loop system of a feedback linearizable nonlinear system when controlled by a robust data-driven nonlinear predictive control scheme. This technical report serves as a supplementary material to our recent paper "Data-driven Nonlinear Predictive Control for Feedback Linearizable Systems". The arguments shown in this report follow similar steps to those for the LTI case, since feedback linearizable systems are linear in transformed coordinates. However, the proof was suitably adapted to match the nonlinear setting under consideration, and the differences are emphasized throughout the proof.

math.OC↗