arXiv subjects

W. P. M. H. Heemels

Publications and source records attributed to W. P. M. H. Heemels.

At least 55 records · Page 3Linked to original sources

arXiv2025

Rhythmic neuromorphic control of a pendulum: A hybrid systems analysis

Neuromorphic engineering is an emerging research domain that aims to realize important implementation advantages that brain-inspired technologies can offer over classical digital technologies, including energy efficiency, adaptability, and robustness. For the field of systems and control, neuromorphic controllers could potentially bring many benefits, but their advancement is hampered by lack of systematic analysis and design tools. In this paper, the objective is to show that hybrid systems methods can aid in filling this gap. We do this by formally analyzing rhythmic neuromorphic control of a pendulum system, which was recently proposed as a prototypical setup. The neuromorphic controller generates spikes, which we model as a Dirac delta pulse, whenever the pendulum angular position crosses its resting position, with the goal of inducing a stable limit cycle. This leads to modeling the closed-loop system as a hybrid dynamical system, which in between spikes evolves in open loop and where the jumps correspond to the spiking control actions. Exploiting the hybrid system model, we formally prove the existence, uniqueness, and a stability property of the hybrid limit cycle for the closed-loop system. Numerical simulations illustrate our approach. We finally elaborate on a possible spiking adaptation mechanism on the pulse amplitude to generate a hybrid limit cycle of a desired maximal angular amplitude.

eess.SY↗

arXiv2025

Leveraging Non-Steady-State Frequency-Domain Data in Willems' Fundamental Lemma

Willems' fundamental lemma enables data-driven analysis and control by characterizing an unknown system's behavior directly in terms of measured data. In this work, we extend a recent frequency-domain variant of this result--previously limited to steady-state data--to incorporate non-steady-state data including transient phenomena. This approach eliminates the need to wait for transients to decay during data collection, significantly reducing the experiment duration. Unlike existing frequency-domain system identification methods, our approach integrates transient data without preprocessing, making it well-suited for direct data-driven analysis and control. We demonstrate its effectiveness by isolating transients in the collected data and performing FRF evaluation at arbitrary frequencies in a numerical case study including noise.

eess.SY↗

arXiv2025

Distributed Design of Ultra Large-Scale Control Systems: Progress, Challenges, and Prospects

The transition from large centralized complex control systems to distributed configurations that rely on a network of a very large number of interconnected simpler subsystems is ongoing and inevitable in many applications. It is attributed to the quest for resilience, flexibility, and scalability in a multitude of engineering fields with far-reaching societal impact. Although many design methods for distributed and decentralized control systems are available, most of them rely on a centralized design procedure requiring some form of global information of the whole system. Clearly, beyond a certain scale of the network, these centralized design procedures for distributed controllers are no longer feasible and we refer to the corresponding systems as ultra large-scale systems (ULSS). For these ULSS, design algorithms are needed that are distributed themselves among the subsystems and are subject to stringent requirements regarding communication, computation, and memory usage of each subsystem. In this paper, a set of requirements is provided that assures a feasible real-time implementation of all phases of a control solution on an ultra large scale. State-of-the-art approaches are reviewed in the light of these requirements and the challenges hampering the development of befitting control algorithms are pinpointed. Comparing the challenges with the current progress leads to the identification and motivation of promising research directions.

eess.SY↗

arXiv2025

Stabilization of singularly perturbed networked control systems over a single channel

This paper studies the emulation-based stabilization of nonlinear networked control systems with two time scales. We address the challenge of using a single communication channel for transmitting both fast and slow variables between the plant and the controller. A novel dual clock mechanism is proposed to schedule transmissions for this purpose. The system is modeled as a hybrid singularly perturbed dynamical system, and singular perturbation analysis is employed to determine individual maximum allowable transmission intervals for both fast and slow variables, ensuring semi-global practical asymptotic stability. Enhanced stability guarantees are also provided under stronger assumptions. The efficacy of the proposed method is illustrated through a numerical example.

math.OC↗

arXiv2024

High-Performance Model Predictive Control for Quadcopters with Formal Stability Guarantees

In this paper, we present a novel cascade control structure with formal guarantees of uniform almost global asymptotic stability for the state tracking error dynamics of a quadcopter. The proposed approach features a model predictive control strategy for the outer loop, explicitly accounting for the non-zero total thrust constraint. The outer-loop controller generates an acceleration reference, which is then converted into attitude, angular velocity and acceleration references, subsequently tracked by a nonlinear inner-loop controller. The proposed cascade control strategy is validated through numerical case studies, underlying high-fidelity models, demonstrating its ability to track fast trajectories with small error.

eess.SY↗

arXiv2024

Constraint-adaptive MPC for large-scale systems: Satisfying state constraints without imposing them

Model Predictive Control (MPC) is a successful control methodology, which is applied to increasingly complex systems. However, real-time feasibility of MPC can be challenging for complex systems, certainly when an (extremely) large number of constraints have to be adhered to. For such scenarios with a large number of state constraints, this paper proposes two novel MPC schemes for general nonlinear systems, which we call constraint-adaptive MPC. These novel schemes dynamically select at each time step a (varying) set of constraints that are included in the on-line optimization problem. Carefully selecting the included constraints can significantly reduce, as we will demonstrate, the computational complexity with often only a slight impact on the closed-loop performance. Although not all (state) constraints are imposed in the on-line optimization, the schemes still guarantee recursive feasibility and constraint satisfaction. A numerical case study illustrates the proposed MPC schemes and demonstrates the achieved computation time improvements exceeding two orders of magnitude without loss of performance.

eess.SY↗

arXiv2024

Constraint Removal for MPC with Performance Preservation and a Hyperthermia Cancer Treatment Case Study

Model predictive control (MPC) is an optimization-based control strategy with broad industrial adoption. Unfortunately, the required computation time to solve the receding-horizon MPC optimization problem can become prohibitively large for many applications with a large number of state constraints. This large number of state constraints can, for instance, originate from spatially discretizing a partial differential equation of which the solution has to satisfy constraints over the full spatial domain. This is particularly the case in MPC for RF-based hyperthermia cancer treatments, which forms a strong motivation for this study. To address this problem, we propose a novel constraint-adaptive MPC framework for linear discrete-time systems. In this framework, we select at each time-step a subset of the state constraints that are included in the optimization problem, thereby reducing the online computational burden. Critically, our framework guarantees the same closed-loop performance, recursive feasibility, and constraint satisfaction properties as the original (non-reduced) MPC scheme. We achieve this result by efficiently exploiting reachable set computations and the MPC cost function. We will demonstrate our novel method using a hyperthermia cancer treatment case study showing a two-orders of magnitude improvement in computation time, with identical closed-loop performance as the original (non-reduced) MPC scheme.

eess.SY↗

arXiv2024

Accelerating soft-constrained MPC for linear systems through online constraint removal

Optimization-based controllers, such as Model Predictive Control (MPC), have attracted significant research interest due to their intuitive concept, constraint handling capabilities, and natural application to multi-input multi-output systems. However, the computational complexity of solving a receding horizon problem at each time step remains a challenge for the deployment of MPC. This is particularly the case for systems constrained by many inequalities. Recently, we introduced the concept of constraint-adaptive MPC (ca-MPC) to address this challenge for linear systems with hard constraints. In ca-MPC, at each time step, a subset of the constraints is removed from the optimization problem, thereby accelerating the optimization procedure, while resulting in identical closed-loop behavior. The present paper extends this framework to soft-constrained MPC by detecting and removing constraints based on sub-optimal predicted input sequences, which is rather easy for soft-constrained MPC due to the receding horizon principle and the inclusion of slack variables. We will translate these new ideas explicitly to an offset-free output tracking problem. The effectiveness of these ideas is demonstrated on a two-dimensional thermal transport model, showing a three order of magnitude improvement in online computational time of the MPC scheme.

eess.SY↗

arXiv2024

Approximate Kalman filtering for large-scale systems with an application to hyperthermia cancer treatments

Accurate state estimates are required for increasingly complex systems, to enable, for example, feedback control. However, available state estimation schemes are not necessarily real-time feasible for certain large-scale systems. Therefore, we develop in this paper, a real-time feasible state-estimation scheme for a class of large-scale systems that approximates the steady state Kalman filter. In particular, we focus on systems where the state-vector is the result of discretizing the spatial domain, as typically seen in Partial Differential Equations. In such cases, the correlation between states in the state-vector often have an intuitive interpretation on the spatial domain, which can be exploited to obtain a significant reduction in computational complexity, while still providing accurate state estimates. We illustrate these strengths of our method through a hyperthermia cancer treatment case study. The results of the case study show significant improvements in the computation time, while simultaneously obtaining good state estimates, when compared to Ensemble Kalman filters and Kalman filters using reduced-order models.

eess.SY↗

arXiv2024

Cooperative nonlinear distributed model predictive control with dissimilar control horizons

In this paper, we introduce a nonlinear distributed model predictive control (DMPC) algorithm, which allows for dissimilar and time-varying control horizons among agents, thereby addressing a common limitation in current DMPC schemes. We consider cooperative agents with varying computational capabilities and operational objectives, each willing to manage varying numbers of optimization variables at each time step. Recursive feasibility and a non-increasing evolution of the optimal cost are proven for the proposed algorithm. Through numerical simulations on systems with three agents, we show that our approach effectively approximates the performance of traditional DMPC, while reducing the number of variables to be optimized. This advancement paves the way for a more decentralized yet coordinated control strategy in various applications, including power systems and traffic management.

eess.SY↗

arXiv2024

Optimization-based Verification of Discrete-time Control Barrier Functions: A Branch-and-Bound Approach

Discrete-time Control Barrier Functions (DTCBFs) form a powerful control theoretic tool to guarantee safety and synthesize safe controllers for discrete-time dynamical systems. In this paper, we provide an optimization-based algorithm, inspired by the $α$BB algorithm, for the verification of a candidate DTCBF, i.e., either verifying a given candidate function as a valid DTCBF or falsifying it by providing a counterexample for a general nonlinear discrete-time system with input constraints. This method is applicable whether a corresponding control policy is known or unknown. We apply our method to a numerical case study to illustrate its efficacy.

math.OC↗

arXiv2024

Analysis of a Simple Neuromorphic Controller for Linear Systems: A Hybrid Systems Perspective

In this paper we analyze a neuromorphic controller, inspired by the leaky integrate-and-fire neuronal model, in closed-loop with a single-input single-output linear time-invariant system. The controller consists of two neuron-like variables and generates a spiking control input whenever one of these variables reaches a threshold. The control input is different from zero only at the spiking instants and, hence, between two spiking times the system evolves in open-loop. Exploiting the hybrid nature of the integrate-and-fire neuronal dynamics, we present a hybrid modeling framework to design and analyze this new controller. In the particular case of single-state linear time-invariant plants, we prove a practical stability property for the closed-loop system, we ensure the existence of a strictly positive dwell-time between spikes, and we relate these properties to the parameters in the neurons. The results are illustrated in a numerical example.

eess.SY↗

arXiv2024

Filtering in Projection-based Integrators for Improved Phase Characteristics

Projection-based integrators are effectively employed in high-precision systems with growing industrial success. By utilizing a projection operator, the resulting projection-based integrator keeps its input-output pair within a designated sector set, leading to unique freedom in control design that can be directly translated into performance benefits. This paper aims to enhance projection-based integrators by incorporating well-crafted linear filters into its structure, resulting in a new class of projected integrators that includes the earlier ones, such as the hybrid-integrator gain systems (with and without pre-filtering) as special cases. The extra design freedom in the form of two filters in the input paths to the projection operator and the internal dynamics allows the controller to break away from the inherent limitations of the linear control design. The enhanced performance properties of the proposed structure are formally demonstrated through a (quasi-linear) describing function analysis, the absence of the gain-loss problem, and numerical case studies showcasing improved time-domain properties. The describing function analysis is supported by rigorously showing incremental properties of the new filtered projection-based integrators thereby guaranteeing that the computed steady-state responses are unique and asymptotically stable.

eess.SY↗

arXiv2024

Continuous Approximations of Projected Dynamical Systems via Control Barrier Functions

Projected Dynamical Systems (PDSs) form a class of discontinuous constrained dynamical systems, and have been used widely to solve optimization problems and variational inequalities. Recently, they have also gained significant attention for control purposes, such as high-performance integrators, saturated control and feedback optimization. In this work, we establish that locally Lipschitz continuous dynamics, involving Control Barrier Functions (CBFs), namely CBF-based dynamics, approximate PDSs. Specifically, we prove that trajectories of CBF-based dynamics uniformly converge to trajectories of PDSs, as a CBF-parameter approaches infinity. Towards this, we also prove that CBF-based dynamics are perturbations of PDSs, with quantitative bounds on the perturbation. Our results pave the way to implement discontinuous PDS-based controllers in a continuous fashion, employing CBFs. We demonstrate this on numerical examples on feedback optimization and synchronverter control. Moreover, our results can be employed to numerically simulate PDSs, overcoming disadvantages of existing discretization schemes, such as computing projections to possibly non-convex sets. Finally, this bridge between CBFs and PDSs may yield other potential benefits, including novel insights on stability.

math.OC↗

arXiv2024

Frequency-Domain Data-Driven Predictive Control

In this paper, we propose a data-driven predictive control scheme based on measured frequency-domain data of the plant. This novel scheme complements the well-known data-driven predictive control (DeePC) approach based on time series data. To develop this new frequency-domain data-driven predictive control (FreePC) scheme, we introduce a novel version of Willems' fundamental lemma based on frequency-domain data. By exploiting frequency-domain data, we allow recent direct data-driven (predictive) control methodologies to benefit from the available expertise and techniques for non-parametric frequency-domain identification in academia and industry. We prove that, under appropriate conditions, the new FreePC scheme is equivalent to the corresponding DeePC scheme. The strengths of FreePC are demonstrated in a numerical case study.

eess.SY↗

arXiv2024

A Unified Non-Strict Finsler Lemma

In this paper, we present a unified general non-strict Finsler lemma. This result is general in the sense that it does not impose any restrictions on the involved matrices and, thereby, it encompasses all existing non-strict versions of Finsler's lemma that do impose such restrictions. To further illustrate its usefulness, we showcase applications of the non-strict Finsler's lemma in deriving a structured solution to a special case of the non-strict projection lemma, and we use the unified non-strict Finsler's lemma to prove a more general version of the matrix Finsler's lemma.

math.OC↗

arXiv2024

The Non-Strict Projection Lemma

The projection lemma (often also referred to as the elimination lemma) is one of the most powerful and useful tools in the context of linear matrix inequalities for system analysis and control. In its traditional formulation, the projection lemma only applies to strict inequalities, however, in many applications we naturally encounter non-strict inequalities. As such, we present, in this note, a non-strict projection lemma that generalizes both its original strict formulation as well as an earlier non-strict version. We demonstrate several applications of our result in robust linear-matrix-inequality-based marginal stability analysis and stabilization, a matrix S-lemma, which is useful in (direct) data-driven control applications, and matrix dilation.

math.OC↗

arXiv2024

Fair Artificial Currency Incentives in Repeated Weighted Congestion Games: Equity vs. Equality

When users access shared resources in a selfish manner, the resulting societal cost and perceived users' cost is often higher than what would result from a centrally coordinated optimal allocation. While several contributions in mechanism design manage to steer the aggregate users choices to the desired optimum by using monetary tolls, such approaches bear the inherent drawback of discriminating against users with a lower income. More recently, incentive schemes based on artificial currencies have been studied with the goal of achieving a system-optimal resource allocation that is also fair. In this resource-sharing context, this paper focuses on repeated weighted congestion game with two resources, where users contribute to the congestion to different extents that are captured by individual weights. First, we address the broad concept of fairness by providing a rigorous mathematical characterization of the distinct societal metrics of equity and equality, i.e., the concepts of providing equal outcomes and equal opportunities, respectively. Second, we devise weight-dependent and time-invariant optimal pricing policies to maximize equity and equality, and prove convergence of the aggregate user choices to the system-optimum. In our framework it is always possible to achieve system-optimal allocations with perfect equity, while the maximum equality that can be reached may not be perfect, which is also shown via numerical simulations.

cs.GT↗