arXiv subjects

Bart Besselink

Publications and source records attributed to Bart Besselink.

34 records · Page 2Linked to original sources

arXiv2022

Modular Model Reduction of Interconnected Systems: A Robust Performance Analysis Perspective

Many complex engineering systems consist of multiple subsystems that are developed by different teams of engineers. To analyse, simulate and control such complex systems, accurate yet computationally efficient models are required. Modular model reduction, in which the subsystem models are reduced individually, is a practical and an efficient method to obtain accurate reduced-order models of such complex systems. However, when subsystems are reduced individually, without taking their interconnections into account, the effect on stability and accuracy of the resulting reduced-order interconnected system is difficult to predict. In this work, a mathematical relation between the accuracy of reduced-order linear-time invariant subsystem models and (stability and accuracy of) resulting reduced-order interconnected linear time-invariant model is introduced. This result can subsequently be used in two ways. Firstly, it can be used to translate accuracy characteristics of the reduced-order subsystem models directly to accuracy properties of the interconnected reduced-order model. Secondly, it can also be used to translate specifications on the interconnected system model accuracy to accuracy requirements on subsystem models that can be used for fit-for-purpose reduction of the subsystem models. These applications of the proposed analysis framework for modular model reduction are demonstrated on an illustrative structural dynamics example.

eess.SY↗

arXiv2022

From data to reduced-order models via moment matching

A new method for data-driven interpolatory model reduction is presented in this paper. Using the so-called data informativity perspective, we define a framework that enables the computation of moments at given (possibly complex) interpolation points based on time-domain input-output data only, without explicitly identifying the high-order system. Instead, by characterizing the set of all systems explaining the data, necessary and sufficient conditions are provided under which all systems in this set share the same moment at a given interpolation point. Moreover, these conditions allow for explicitly computing these moments. Reduced-order models are then derived by employing a variation of the classical rational interpolation method. The condition to enforce moment matching model reduction with prescribed poles is also discussed as a means to obtain stable reduced-order models. An example of an electrical circuit illustrates this framework.

eess.SY↗

arXiv2022

From data to reduced-order models via generalized balanced truncation

This paper proposes a data-driven model reduction approach on the basis of noisy data. Firstly, the concept of data reduction is introduced. In particular, we show that the set of reduced-order models obtained by applying a Petrov-Galerkin projection to all systems explaining the data characterized in a large-dimensional quadratic matrix inequality (QMI) can again be characterized in a lower-dimensional QMI. Next, we develop a data-driven generalized balanced truncation method that relies on two steps. First, we provide necessary and sufficient conditions such that systems explaining the data have common generalized Gramians. Second, these common generalized Gramians are used to construct projection matrices that allow to characterize a class of reduced-order models via generalized balanced truncation in terms of a lower-dimensional QMI by applying the data reductionconcept. Additionally, we present alternative procedures to compute a priori and a posteriori upper bounds with respect to the true system generating the data. Finally, the proposed techniques are illustrated by means of application to an example of a system of a cart with a double-pendulum.

math.OC↗

arXiv2021

Verifying Contracts for Perturbed Control Systems using Linear Programming

Verifying specifications for large-scale control systems is of utmost importance, but can be hard in practice as most formal verification methods can not handle high-dimensional dynamics. Contract theory has been proposed as a modular alternative to formal verification in which specifications are defined by assumptions on the inputs to a component and guarantees on its outputs. In this paper, we present linear-programming-based tools for verifying contracts for control systems. We first consider the problem of verifying contracts defined by time-invariant inequalities for unperturbed systems. We use $k$-induction to show that contract verification can be achieved by considering a collection of implications between inequalities, which are then recast as linear programs. We then move our attention to perturbed systems. We present a comparison-based framework, verifying that a perturbed system satisfies a contract by checking that the corresponding unperturbed system satisfies a robustified (and $ε$-approximated) contract. In both cases, we present explicit algorithms for contract verification, proving their correctness and analyzing their complexity. We also demonstrate the verification process for two case studies, one considering a two-vehicle autonomous driving scenario, and one considering formation control of a multi-agent system.

eess.SY↗

arXiv2021

Assume/Guarantee Contracts for Dynamical Systems: Theory and Computational Tools

Modern engineering systems include many components of different types and functions. Verifying that these systems satisfy given specifications can be an arduous task, as most formal verification methods are limited to systems of moderate size. Recently, contract theory has been proposed as a modular framework for defining specifications. In this paper, we present a contract theory for discrete-time dynamical control systems relying on assume/guarantee contracts, which prescribe assumptions on the input of the system and guarantees on the output. We then focus on contracts defined by linear constraints, and develop efficient computational tools for verification of satisfaction and refinement based on linear programming. We exemplify these tools in a simulation example, proving a certain safety specification for a two-vehicle autonomous driving setting.

eess.SY↗

arXiv2021

Verifying Compositional Refinement of Assume/Guarantee Contracts using Linear Programming

Verifying specifications for large-scale modern engineering systems can be a time-consuming task, as most formal verification methods are limited to systems of modest size. Recently, contract-based design and verification has been proposed as a modular framework for specifications, and linear-programming-based techniques have been presented for verifying that a given system satisfies a given contract. In this paper, we extend this assume/guarantee framework by presenting necessary and sufficient conditions for a collection of contracts on individual components to refine a contract on the composed system. These conditions can be verified by solving linear programs, whose number grows linearly with the number of specifications defined by the contracts. We exemplify the tools developed using a case study considering safety in a car-following scenario, where noise and time-varying delay are considered.

eess.SY↗

arXiv2020

Scalable robustness of interconnected systems subject to structural changes

This paper studies the robustness of large-scale interconnected systems with respect to external disturbances, focussing on their scalability properties. Specifically, a notion of scalability is introduced that asks for these robustness properties to remain unchanged under a structural change of the system, such as the addition/removal of a subsystem or a change in the interconnection structure. Both necessary and sufficient conditions, in terms of the interconnection structure and edge weights, are given under which elementary structural changes are scalable. The results are illustrated through a simple example.

math.OC↗

arXiv2020

Informativity for data-driven model reduction through interpolation

A method for data-driven interpolatory model reduction is presented in this extended abstract. This framework enables the computation of the transfer function values at given interpolation points based on time-domain input-output data only, without explicitly identifying the high-order system. Instead, by characterizing the set of all systems explaining the data, necessary and sufficient conditions are given under which all systems in this set share the same transfer function value at a given interpolation point. After following this so-called data informativity perspective, reduced-order models can be obtained by classical interpolation techniques. An example of an electrical circuit illustrates this framework.

eess.SY↗

arXiv2019

Contracts as specifications for dynamical systems in driving variable form

This paper introduces assume/guarantee contracts on continuous-time control systems, hereby extending contract theories for discrete systems to certain new model classes and specifications. Contracts are regarded as formal characterizations of control specifications, providing an alternative to specifications in terms of dissipativity properties or set-invariance. The framework has the potential to capture a richer class of specifications more suitable for complex engineering systems. The proposed contracts are supported by results that enable the verification of contract implementation and the comparison of contracts. These results are illustrated by an example of a vehicle following system.

eess.SY↗

arXiv2019

Balanced Truncation of Networked Linear Passive Systems

This paper studies model order reduction of multi-agent systems consisting of identical linear passive subsystems, where the interconnection topology is characterized by an undirected weighted graph. Balanced truncation based on a pair of specifically selected generalized Gramians is implemented on the asymptotically stable part of the full-order network model, which leads to a reduced-order system preserving the passivity of each subsystem. Moreover, it is proven that there exists a coordinate transformation to convert the resulting reduced-order model to a state-space model of Laplacian dynamics. Thus, the proposed method simultaneously reduces the complexity of the network structure and individual agent dynamics, and it preserves the passivity of the subsystems and the synchronization of the network. Moreover, it allows for the a priori computation of a bound on the approximation error. Finally, the feasibility of the method is demonstrated by an example.

math.OC↗

arXiv2017

Finite-time Consensus Protocols for Multi-dimensional Multi-agent Systems

Two finite-time consensus protocols are proposed for multi-dimensional multi-agent systems, using direction-preserving and component-wise signum controls respectively. Filippov solutions and non-smooth analysis techniques are adopted to handle discontinuities. Sufficient and necessary conditions are provided to guarantee finite-time convergence and boundedness of the solutions. It turns out that the number of agents which have continuous control law plays an essential role for finite-time convergence. In addition it is shown that the unit balls introduced by $\ell_p$ and $\ell_{\infty}$ norms are invariant for these two protocols respectively.

math.OC↗

arXiv2017

String stability and a delay-based spacing policy for vehicle platoons subject to disturbances

A novel delay-based spacing policy for the control of vehicle platoons is introduced together with a notion of disturbance string stability. The delay-based spacing policy specifies the desired inter-vehicular distance between vehicles and guarantees that all vehicles track the same spatially varying reference velocity profile, as is for example required for heavy-duty vehicles driving over hilly terrain. Disturbance string stability is a notion of string stability of vehicle platoons subject to external disturbances on all vehicles that guarantees that perturbations do not grow unbounded as they propagate through the platoon. Specifically, a control design approach in the spatial domain is presented that achieves tracking of the desired spacing policy and guarantees disturbance string stability with respect to a spatially varying reference velocity. The results are illustrated by means of simulations.

eess.SY↗

arXiv2016

Stability Analysis of Monotone Systems via Max-separable Lyapunov Functions

We analyze stability properties of monotone nonlinear systems via max-separable Lyapunov functions, motivated by the following observations: first, recent results have shown that asymptotic stability of a monotone nonlinear system implies the existence of a max-separable Lyapunov function on a compact set; second, for monotone linear systems, asymptotic stability implies the stronger properties of D-stability and insensitivity to time-delays. This paper establishes that for monotone nonlinear systems, equivalence holds between asymptotic stability, the existence of a max-separable Lyapunov function, D-stability, and insensitivity to bounded and unbounded time-varying delays. In particular, a new and general notion of D-stability for monotone nonlinear systems is discussed and a set of necessary and sufficient conditions for delay-independent stability are derived. Examples show how the results extend the state-of-the-art.

eess.SY↗

arXiv2015

Weak Resilience of Networked Control Systems

In this paper, we propose a method to establish a networked control system that maintains its stability in the presence of certain undesirable incidents on local controllers. We call such networked control systems weakly resilient. We first derive a necessary and sufficient condition for the weak resilience of networked systems. Networked systems do not generally satisfy this condition. Therefore, we provide a method for designing a compensator which ensures the weak resilience of the compensated system. Finally, we illustrate the efficiency of the proposed method by a power system example based on the IEEE 14-bus test system.

eess.SY↗

arXiv2015

Cooperative look-ahead control for fuel-efficient and safe heavy-duty vehicle platooning

The operation of groups of heavy-duty vehicles (HDVs) at a small inter-vehicular distance (known as platoon) allows to lower the overall aerodynamic drag and, therefore, to reduce fuel consumption and greenhouse gas emissions. However, due to the large mass and limited engine power of HDVs, slopes have a significant impact on the feasible and optimal speed profiles that each vehicle can and should follow. Therefore maintaining a short inter-vehicular distance as required by platooning without coordination between vehicles can often result in inefficient or even unfeasible trajectories. In this paper we propose a two-layer control architecture for HDV platooning aimed to safely and fuel-efficiently coordinate the vehicles in the platoon. Here, the layers are responsible for the inclusion of preview information on road topography and the real-time control of the vehicles, respectively. Within this architecture, dynamic programming is used to compute the fuel-optimal speed profile for the entire platoon and a distributed model predictive control framework is developed for the real-time control of the vehicles. The effectiveness of the proposed controller is analyzed by means of simulations of several realistic scenarios that suggest a possible fuel saving of up to 12% for the follower vehicles compared to the use of standard platoon controllers.

eess.SY↗

arXiv2014

Model reduction of networked passive systems through clustering

In this paper, a model reduction procedure for a network of interconnected identical passive subsystems is presented. Here, rather than performing model reduction on the subsystems, adjacent subsystems are clustered, leading to a reduced-order networked system that allows for a convenient physical interpretation. The identification of the subsystems to be clustered is performed through controllability and observability analysis of an associated edge system and it is shown that the property of synchronization (i.e., the convergence of trajectories of the subsystems to each other) is preserved during reduction. The results are illustrated by means of an example.

eess.SY↗