arXiv subjects

Stefan Wildhagen

Publications and source records attributed to Stefan Wildhagen.

13 recordsLinked to original sources

arXiv2022

Self-triggered MPC robust to bounded packet loss via a min-max approach: extended version

Networked Control Systems typically come with a limited communication bandwidth and thus require special care when designing the underlying control and triggering law. A method that allows to consider hard constraints on the communication traffic as well as on states and inputs is self-triggered model predictive control (MPC). In this scheme, the optimal length of the sampling interval is determined proactively using predictions of the system behavior. However, previous formulations of self-triggered MPC have neglected the widespread phenomenon of packet loss, such that these approaches might fail in practice. In this paper, we present a novel self-triggered MPC scheme which is robust to bounded packet loss by virtue of a min-max optimization problem. We prove recursive feasibility, constraint satisfaction and convergence to the origin for any possible packet loss realization consistent with the boundedness constraint, and demonstrate the advantages of the proposed scheme in a numerical example.

eess.SY↗

arXiv2022

Data-driven analysis and controller design for discrete-time systems under aperiodic sampling

This article is concerned with data-driven analysis of discrete-time systems under aperiodic sampling, and in particular with a data-driven estimation of the maximum sampling interval (MSI). The MSI is relevant for analysis of and controller design for cyber-physical, embedded and networked systems, since it gives a limit on the time span between sampling instants such that stability is guaranteed. We propose tools to compute the MSI for a given controller and to design a controller with a preferably large MSI, both directly from a finite-length, noise-corrupted state-input trajectory of the system. We follow two distinct approaches for stability analysis, one taking a robust control perspective and the other a switched systems perspective on the aperiodically sampled system. In a numerical example and a subsequent discussion, we demonstrate the efficacy of our developed tools and compare the two approaches.

eess.SY↗

arXiv2022

Rollout event-triggered control: reconciling event- and time-triggered control

Event-triggered control (ETC) and time-triggered control (TTC), the classical concepts to determine the transmission instants for networked control systems, each come with drawbacks: It is difficult to tune ETC such that a certain bandwidth is respected, whereas TTC cannot adapt the sampling interval to the current state of the control system. In this article, we provide an overview over rollout ETC, a method aimed at reconciling the advantages of ETC and TTC. We unite two variants of rollout ETC under a common framework and present conditions for convergence and compliance with a predefined bandwidth limit. Furthermore, we demonstrate that rollout ETC satisfies a performance bound and that it allows for a very flexible transmission scheduling similar to classical ETC. The mentioned beneficial properties are illustrated through extensive numerical simulations.

eess.SY↗

arXiv2022

Uncertainties and output feedback in rollout event-triggered control

The fact that event-triggered control (ETC) often exhibits an improved performance-communication tradeoff over time-triggered control renders it especially useful for Networked Control Systems (NCSs). However, it has proven difficult to characterize the traffic produced by ETC a priori. Rollout ETC addresses this issue by using a triggering and control law that is implicitly defined by the solution to an optimal control problem (OCP), instead of an explicit one as in classical ETC. This allows to directly incorporate predefined constraints on the transmission traffic as well as on states and inputs. In this article, we examine the practically relevant case when output instead of state measurements are available, and measurements as well as the LTI plant are subject to uncertainties. To address these challenges, we adapt methods from robust tube-based model predictive control and propose three different strategies to implement an error feedback in an NCSs setup, the applicability of which depends on the capabilities of the actuator. We establish recursive feasibility, robust constraint satisfaction and convergence. Finally, we illustrate our results in a numerical example.

eess.SY↗

arXiv2022

Multi-party computation enables secure polynomial control based solely on secret-sharing

Encrypted control systems allow to evaluate feedback laws on external servers without revealing private information about state and input data, the control law, or the plant. While there are a number of encrypted control schemes available for linear feedback laws, only few results exist for the evaluation of more general control laws. Recently, an approach to encrypted polynomial control was presented, relying on two-party secret sharing and an inter-server communication protocol using homomorphic encryption. As homomorphic encryptions are much more computationally demanding than secret sharing, they make up for a tremendous amount of the overall computational demand of this scheme. For this reason, in this paper, we demonstrate that multi-party computation enables secure polynomial control based solely on secret sharing. We introduce a novel secure three-party control scheme based on three-party computation. Further, we propose a novel $n$-party control scheme to securely evaluate polynomial feedback laws of arbitrary degree without inter-server communication. The latter property makes it easier to realize the necessary requirement regarding non-collusion of the servers, with which perfect security can be guaranteed. Simulations suggest that the presented control schemes are many times less computationally demanding than the two-party scheme mentioned above.

eess.SY↗

arXiv2021

Improved stability conditions for systems under aperiodic sampling: model- and data-based analysis

Discrete-time systems under aperiodic sampling may serve as a modeling abstraction for a multitude of problems arising in cyber-physical and networked control systems. Recently, model- and data-based stability conditions for such systems were obtained by rewriting them as an interconnection of a linear time-invariant system and a delay operator, and subsequently, performing a robust stability analysis using a known bound on the gain of this operator. In this paper, we refine this approach: First, we show that the delay operator is input-feedforward passive and second, we compute its gain exactly. Based on these findings, we derive improved stability conditions both in case of full model knowledge and in case only data are available. In the latter, we require only a finite-length and potentially noisy state-input trajectory of the unknown system. In two examples, we illustrate the reduced conservativeness of the proposed stability conditions over existing ones.

eess.SY↗

arXiv2021

Data-driven analysis and control of continuous-time systems under aperiodic sampling

We investigate stability analysis and controller design of unknown continuous-time systems under state-feedback with aperiodic sampling, using only noisy data but no model knowledge. We first derive a novel data-dependent parametrization of all linear time-invariant continuous-time systems which are consistent with the measured data and the assumed noise bound. Based on this parametrization and by combining tools from robust control theory and the time-delay approach to sampled-data control, we compute lower bounds on the maximum sampling interval (MSI) for closed-loop stability under a given state-feedback gain, and beyond that, we design controllers which exhibit a possibly large MSI. Our methods guarantee the stability properties robustly for all systems consistent with the measured data. As a technical contribution, the proposed approach embeds existing methods for sampled-data control into a general robust control framework, which can be directly extended to model-based robust controller design for uncertain time-delay systems under general uncertainty descriptions.

math.OC↗

arXiv2020

Rollout scheduling and control for disturbed systems via tube MPC: extended version

Rollout control is an MPC-based control method, in which a controller is periodically activated to schedule the transmission of sensor or actuator data. Therein, a preassigned traffic specification acts as a constraint on the scheduled transmissions, ensuring that they are triggered at an admissible rate for the underlying communication network. In this paper, we extend the theory of rollout control by considering bounded disturbances on the controlled plant in the presence of state and input constraints. We use methods from tube MPC, where the error between the nominal (undisturbed) system, used as a prediction model, and the real system is kept in a robust control invariant set. This approach requires satisfaction of a \emph{maximum} inter-transmission interval in closed loop, a guarantee that is not straightforward to obtain in rollout control. Our main contribution is to introduce a novel tube MPC scheme adapted for rollout control, which contains an additional constraint on the predicted transmission schedule. We show that by virtue of this schedule constraint, the inter-transmission interval is bounded in closed loop. We also establish recursive feasibility of this novel MPC scheme and show convergence of the system.

eess.SY↗

arXiv2020

A Resource-Aware Approach to Self-Triggered Model Predictive Control: Extended Version

In this paper, we consider a self-triggered formulation of model predictive control. In this variant, the controller decides at the current sampling instant itself when the next sample should be taken and the optimization problem be solved anew. We incorporate a pointwise-in-time resource constraint into the optimization problem, whose exact form can be chosen by the user. Thereby, the proposed scheme is made resource-aware with respect to a universal resource, which may pertain in practice for instance to communication, computation, energy or financial resources. We show that by virtue of the pointwise-in-time constraints, also a transient and an asymptotic average constraint on the resource usage are guaranteed. Furthermore, we derive conditions on the resource under which the proposed scheme achieves recursive feasibility and convergence. Finally, we demonstrate our theoretical results in a numerical example.

eess.SY↗

arXiv2020

Saving Tokens in Rollout Control with Token Bucket Specification

We consider a communication network over which transmissions must fulfill the so-called token bucket traffic specification, with a rollout (i.e., predictive) controller that both schedules transmissions and computes the corresponding control values. In the token bucket specification, a transmission is allowed if the current level of tokens is above a certain threshold. Recently, it has been shown that having a full bucket at the time of a set point change significantly improves the control performance as compared to when the bucket level is low. In this work, we develop mechanisms that guarantee that the bucket fills up after the controlled plant has converged to a set point. To do this, we consider two different setups. First, we consider that all transmissions over the network must fulfill the token bucket specification and show convergence to the upper sector of the bucket by adding a slight terminal cost on the bucket level. Afterwards, we consider a modified network which additionally features a direct link over which transmissions need not fulfill the token bucket specification. In this setup, we prove convergence of the bucket level exactly to the upper rim. These mechanisms enable a similar level of flexibility as event-triggered control: In converged state, little communication is used while in precarious operating conditions, a burst of transmissions is possible. Other than event-triggered approaches, the proposed methods allow to specify the network traffic beforehand by means of the token bucket. Lastly, we validate the proposed approaches in a numerical example.

eess.SY↗

arXiv2020

Scheduling and control over networks using MPC with time-varying terminal ingredients: extended version

Rollout approaches are an effective tool to address the problem of co-designing the transmission schedule and the corresponding input values, when the controller is connected to the plant via a resource-constrained communication network. These approaches typically employ an MPC, activated at multiples of the period length of a base transmission schedule. Using multi-step invariant terminal regions and a prediction horizon longer than the base period, stability can be ensured. This strategy, however, suffers from intrinsic shortcomings, such as a high computational complexity and low robustness. We aim to resolve these drawbacks by proposing an MPC with periodically time-varying terminal region and cost for the rollout setup, where the controller is activated at each time instant and features an arbitrary but fixed prediction horizon. We consider in more detail two specific setups from the literature on Networked Control Systems, namely the token bucket network and actuator scheduling. For both setups, we provide conditions for which convergence under application of the time-varying MPC can be guaranteed. In two numerical examples, we demonstrate the benefits of the proposed method.

eess.SY↗

arXiv2019

Economic MPC using a Cyclic Horizon with Application to Networked Control Systems

In this paper, we analyze an economic model predictive control scheme with terminal region and cost, where the system is optimally operated in a certain subset of the state space. The predictive controller operates with a cyclic horizon, which means that starting from an initial length, the horizon is reduced by one at each time step before it is restored to its maximum length again after one cycle. We give performance guarantees for the closed loop, and under a suitable dissipativity condition, establish convergence to the optimal subset. Moreover, we present conditions under which asymptotic stability of the optimal subset can be guaranteed. The results are illustrated in a practical example from the context of Networked Control Systems, which initially motivated the development of the theory presented in this paper.

eess.SY↗

arXiv2018

Characterizing the learning dynamics in extremum seeking

We consider perturbation-based extremum seeking, which recovers an approximate gradient of an analytically unknown objective function through measurements. Using classical needle variation analysis, we are able to explicitly quantify the recovered gradient in the scalar case. We reveal that it corresponds to an averaged gradient of the objective function, even for very general extremum seeking systems. From this, we create a recursion which represents the learning dynamics along the recovered gradient. These results give rise to the interpretation that extremum seeking actually optimizes a function other than the original one. From this insight, a new perspective on global optimization of functions with local extrema emerges: because the gradient is averaged over a certain time period, local extrema might be evened out in the learning dynamics. Moreover, a multidimensional extension of the scalar results is given.

eess.SY↗