arXiv subjects

Ahmed Aboudonia

Publications and source records attributed to Ahmed Aboudonia.

17 recordsLinked to original sources

arXiv2026

A Robust Task-Level Control Architecture for Learned Dynamical Systems

Dynamical system (DS)-based learning from demonstration (LfD) is a powerful tool for generating motion plans in the operation ('task') space of robotic systems. However, realizing generated motion plans is often compromised by a "task-execution mismatch", where unmodeled dynamics, persistent disturbances, and system latency cause the robot's task-space state to diverge from the desired state. We propose a novel task-level robust control architecture, L1-augmented Dynamical Systems (L1-DS), that explicitly handles the task-execution mismatch in tracking a nominal motion plan generated by any DS-based LfD scheme. Our framework augments any DS-based LfD model with a nominal stabilizing controller and an L1 adaptive controller. Furthermore, we introduce a windowed Dynamic Time Warping (DTW)-based target selector, which enables the nominal stabilizing controller to handle temporal misalignment for improved phase-consistent tracking. We demonstrate the efficacy of our architecture on the LASA and IROS handwriting datasets.

cs.RO↗

arXiv2026

Distributionally Robust and Safe Imitation Learning

Imitation learning (IL) has achieved remarkable success in complex decision-making tasks. However, its performance is highly sensitive to distribution shifts, which can pose significant safety risks. We propose a distributionally robust and safe IL framework that explicitly addresses both policy-induced and uncertainty-induced distribution shifts. Our approach develops a unified framework leveraging Taylor Series Imitation Learning (TaSIL) to mitigate policy-induced shifts and distributionally robust adaptive control to handle uncertainty-induced shifts. This architecture enables the formulation of an IL problem that optimizes performance under distributional uncertainty while systematically accounting for safety constraints. We demonstrate the effectiveness of the proposed approach on an unmanned aerial vehicle (UAV) case study where the UAV performs a task in an uncertain environment while avoiding unsafe regions.

cs.LG↗

arXiv2026

Dissipativity-Based Data-Driven Decentralized Control of Interconnected Systems

We propose data-driven decentralized control algorithms for stabilizing interconnected discrete-time linear time-invariant systems. We first derive a data-driven condition to synthesize a local controller that ensures the dissipativity of the local subsystems. Then, we propose data-driven decentralized stability conditions for the global system based on the dissipativity of each local system. Since both conditions take the form of linear matrix inequalities and are based on dissipativity theory, this yields a unified pipeline, resulting in a data-driven decentralized control algorithm. As a special case, we also consider stabilizing systems interconnected through diffusive coupling and propose a control algorithm. We validate the effectiveness and the scalability of the proposed control algorithms in numerical examples in the context of microgrids.

eess.SY↗

arXiv2026

Distributed Predictive Control Barrier Functions: Towards Scalable Safety Certification in Modular Multi-Agent Systems

We consider safety-critical multi-agent systems with distributed control architectures and potentially varying network topologies. While learning-based distributed control enables scalability and high performance, a lack of formal safety guarantees in the face of unforeseen disturbances and unsafe network topology changes may lead to system failure. To address this challenge, we introduce structured control barrier functions (s-CBFs) as a multi-agent safety framework. The s-CBFs are augmented to a distributed predictive control barrier function (D-PCBF), a predictive, optimization-based safety layer that uses model predictions to guarantee recoverable safety at all times. The proposed approach enables a permissive yet formal plug-and-play protocol, allowing agents to join or leave the network while ensuring safety recovery if a change in network topology requires temporarily unsafe behavior. We validate the formulation through simulations and real-time experiments of a miniature race-car platoon.

eess.SY↗

arXiv2025

Distributionally Robust Imitation Learning: Layered Control Architecture for Certifiable Autonomy

Imitation learning (IL) enables autonomous behavior by learning from expert demonstrations. While more sample-efficient than comparative alternatives like reinforcement learning, IL is sensitive to compounding errors induced by distribution shifts. There are two significant sources of distribution shifts when using IL-based feedback laws on systems: distribution shifts caused by policy error and distribution shifts due to exogenous disturbances and endogenous model errors due to lack of learning. Our previously developed approaches, Taylor Series Imitation Learning (TaSIL) and $\mathcal{L}_1$ -Distributionally Robust Adaptive Control (\ellonedrac), address the challenge of distribution shifts in complementary ways. While TaSIL offers robustness against policy error-induced distribution shifts, \ellonedrac offers robustness against distribution shifts due to aleatoric and epistemic uncertainties. To enable certifiable IL for learned and/or uncertain dynamical systems, we formulate \textit{Distributionally Robust Imitation Policy (DRIP)} architecture, a Layered Control Architecture (LCA) that integrates TaSIL and~\ellonedrac. By judiciously designing individual layer-centric input and output requirements, we show how we can guarantee certificates for the entire control pipeline. Our solution paves the path for designing fully certifiable autonomy pipelines, by integrating learning-based components, such as perception, with certifiable model-based decision-making through the proposed LCA approach.

eess.SY↗

arXiv2025

A Data-driven Predictive Control Architecture for Train Thermal Energy Management

We aim to improve the energy efficiency of train climate control architectures, with a focus on a specific class of regional trains operating throughout Switzerland, especially in Zurich and Geneva. Heating, Ventilation, and Air Conditioning (HVAC) systems represent the second largest energy consumer in these trains after traction. The current architecture comprises a high-level rule-based controller and a low-level tracking controller. To improve train energy efficiency, we propose adding a middle data-driven predictive control layer aimed at minimizing HVAC energy consumption while maintaining passenger comfort. The scheme incorporates a multistep prediction model developed using real-world data collected from a limited number of train coaches. To validate the effectiveness of the proposed architecture, we conduct multiple experiments on a separate set of train coaches; our results suggest energy savings between 10% and 35% with respect to the current architecture.

eess.SY↗

arXiv2025

Plug and Play Distributed Control of Clustered Energy Hub Networks

The transition to renewable energy is driving the rise of distributed multi-energy systems, in which individual energy hubs and prosumers (e.g., homes, industrial campuses) generate, store, and trade energy. Economic Model Predictive Control (MPC) schemes are widely used to optimize operation of energy hubs by efficiently dispatching resources and minimizing costs while ensuring operational constraints are met. Peer-to-peer (P2P) energy trading among hubs enhances network efficiency and reduces costs but also increases computational and privacy challenges, especially as the network scales. Additionally, current distributed control techniques require global recomputation whenever the network topology changes, limiting scalability. To address these challenges, we propose a clustering-based P2P trading framework that enables plug-and-play operation, allowing energy hubs to seamlessly join or leave without requiring network-wide controller updates. The impact is restricted to the hubs within the affected cluster. The energy trading problem is formulated as a bi-level bargaining game, where inter-cluster trading commitments are determined at the cluster level, while energy dispatch and cost-sharing among hubs within a cluster are refined at the hub level. Both levels are solved in a distributed manner using ADMM, ensuring computational feasibility and privacy preservation. Moreover, we develop plug-and-play procedures to handle dynamic topology changes at both the hub and cluster levels, minimizing disruptions across the network. Simulation results demonstrate that the proposed bi-level framework reduces operational costs, and enables scalable energy management under plug-and-play operation.

eess.SY↗

arXiv2024

Interconnection of (Q,S,R)-Dissipative Systems in Discrete Time

Discrete-time systems cannot be passive unless there is a direct feedthrough from the input to the output. For passivity-based control to be exploited nevertheless, some authors introduce virtual outputs, while others rely on continuous-time passivity and then apply discretization techniques that preserve passivity in discrete time. Here we argue that quadratic supply rates incorporate and extend the effect of virtual outputs, allowing one to exploit dissipativity properties directly in discrete time. We derive decentralized (Q,S,R)-dissipativity conditions for a set of nonlinear systems interconnected with arbitrary topology, so that the overall network is guaranteed to be stable. For linear systems, we develop dissipative control conditions that are linear in the supply rate matrices. To demonstrate the validity of our methods, we provide numerical examples in the context of islanded microgrids.

math.OC↗

arXiv2024

Adaptive Learning-based Model Predictive Control for Uncertain Interconnected Systems: A Set Membership Identification Approach

We propose a novel adaptive learning-based model predictive control (MPC) scheme for interconnected systems which can be decomposed into several smaller dynamically coupled subsystems with uncertain coupling. The proposed scheme is mainly divided into two main online phases; a learning phase and an adaptation phase. Set membership identification is used in the learning phase to learn an uncertainty set that contains the coupling strength using online data. In the adaptation phase, rigid tube-based robust MPC is used to compute the optimal predicted states and inputs. Besides computing the optimal trajectories, the MPC ingredients are adapted in the adaptation phase taking the learnt uncertainty set into account. These MPC ingredients include the prestabilizing controller, the rigid tube, the tightened constraints and the terminal ingredients. The recursive feasibility of the proposed scheme as well as the stability of the corresponding closed-loop system are discussed. The developed scheme is compared in simulations to existing schemes including robust, adaptive and learning-based MPC.

eess.SY↗

arXiv2024

A distributed framework for linear adaptive MPC

Adaptive model predictive control (MPC) robustly ensures safety while reducing uncertainty during operation. In this paper, a distributed version is proposed to deal with network systems featuring multiple agents and limited communication. To solve the problem in a distributed manner, structure is imposed on the control design ingredients without sacrificing performance. Decentralized and distributed adaptation schemes that allow for a reduction of the uncertainty online compatibly with the network topology are also proposed. The algorithm ensures robust constraint satisfaction, recursive feasibility and finite gain $\ell_2$ stability, and yields lower closed-loop cost compared to robust distributed MPC in simulations.

eess.SY↗

arXiv2022

Reconfigurable Plug-and-play Distributed Model Predictive Control for Reference Tracking

A plug-and-play model predictive control (PnP MPC) scheme is proposed for varying-topology networks to track piecewise constant references. The proposed scheme allows subsystems to occasionally join and leave the network while preserving asymptotic stability and recursive feasibility and comprises two main phases. In the redesign phase, passivity-based control is used to ensure that asymptotic stability of the network is preserved. In the transition phase, reconfigurable terminal ingredients are used to ensure that the distributed MPC problem is initially feasible after the PnP operation. The efficacy of the proposed scheme is evaluated by applying it to a network of mass-spring-damper systems and comparing it to a benchmark scheme. It is found that the novel redesign phase results in faster PnP operations, whereas the novel transition phase increases flexibility by accepting more requests.

eess.SY↗

arXiv2022

Online Computation of Terminal Ingredients in Distributed Model Predictive Control for Reference Tracking

A distributed model predictive control scheme is developed for tracking piecewise constant references where the terminal set is reconfigured online, whereas the terminal controller is computed offline. Unlike many standard existing schemes, this scheme yields large feasible regions without performing offline centralized computations. Although the resulting optimal control problem (OCP) is a semidefinite program (SDP), an SDP scalability method based on diagonal dominance is used to approximate the derived SDP by a second-order cone program. The OCPs of the proposed scheme and its approximation are amenable to distributed optimization. Both schemes are evaluated using a power network example and compared to a scheme where the terminal controller is reconfigured online as well. It is found that fixing the terminal controller results in better performance, noticeable reduction in computational cost and similar feasible region compared to the case in which this controller is reconfigured online.

eess.SY↗

arXiv2022

Physics-informed linear regression is competitive with two Machine Learning methods in residential building MPC

Because physics-based building models are difficult to obtain as each building is individual, there is an increasing interest in generating models suitable for building MPC directly from measurement data. Machine learning methods have been widely applied to this problem and validated mostly in simulation; there are, however, few studies on a direct comparison of different models or validation in real buildings to be found in the literature. Methods that are indeed validated in application often lead to computationally complex non-convex optimization problems. Here we compare physics-informed Autoregressive-Moving-Average with Exogenous Inputs (ARMAX) models to Machine Learning models based on Random Forests and Input Convex Neural Networks and the resulting convex MPC schemes in experiments on a practical building application with the goal of minimizing energy consumption while maintaining occupant comfort, and in a numerical case study. We demonstrate that Predictive Control in general leads to savings between 26% and 49% of heating and cooling energy, compared to the building's baseline hysteresis controller. Moreover, we show that all model types lead to satisfactory control performance in terms of constraint satisfaction and energy reduction. However, we also see that the physics-informed ARMAX models have a lower computational burden, and a superior sample efficiency compared to the Machine Learning based models. Moreover, even if abundant training data is available, the ARMAX models have a significantly lower prediction error than the Machine Learning models, which indicates that the encoded physics-based prior of the former cannot independently be found by the latter.

cs.LG↗

arXiv2021

Distributed Model Predictive Control with Reconfigurable Terminal Ingredients for Reference Tracking

Various efforts have been devoted to developing stabilizing distributed Model Predictive Control (MPC) schemes for tracking piecewise constant references. In these schemes, terminal sets are usually computed offline and used in the MPC online phase to guarantee recursive feasibility and asymptotic stability. Maximal invariant terminal sets do not necessarily respect the distributed structure of the network, hindering the distributed implementation of the controller. On the other hand, ellipsoidal terminal sets respect the distributed structure, but may lead to conservative schemes. In this paper, a novel distributed MPC scheme is proposed for reference tracking of networked dynamical systems where the terminal ingredients are reconfigured online depending on the closed-loop states to alleviate the aforementioned issues. The resulting non-convex infinite-dimensional problem is approximated using a quadratic program. The proposed scheme is tested in simulation where the proposed MPC problem is solved using distributed optimization.

eess.SY↗

arXiv2021

Passivity-based Decentralized Control for Discrete-time Large-scale Systems

Passivity theory has recently contributed to developing decentralized control schemes for large-scale systems. Many decentralized passivity-based control schemes are designed in continuous-time. It is well-known, however, that the passivity properties of continuous-time systems may be lost under discretization. In this work, we present a novel stabilizing decentralized control scheme by ensuring passivity for discrete-time systems directly and thus avoiding the issue of passivity preservation. The controller is synthesized by locally solving a semidefinite program offline for each subsystem in a decentralized fashion. This program comprises local conditions ensuring that the corresponding subsystem is locally passive. Passivity is ensured with respect to a local virtual output which is different from the local actual output. The program also comprises local conditions ensuring that the local passivity of all subsystems implies the asymptotic stability of the whole system. The performance of the proposed controller is evaluated on a case study in DC microgrids.

eess.SY↗

arXiv2020

Input Convex Neural Networks for Building MPC

Model Predictive Control in buildings can significantly reduce their energy consumption. The cost and effort necessary for creating and maintaining first principle models for buildings make data-driven modelling an attractive alternative in this domain. In MPC the models form the basis for an optimization problem whose solution provides the control signals to be applied to the system. The fact that this optimization problem has to be solved repeatedly in real-time implies restrictions on the learning architectures that can be used. Here, we adapt Input Convex Neural Networks that are generally only convex for one-step predictions, for use in building MPC. We introduce additional constraints to their structure and weights to achieve a convex input-output relationship for multistep ahead predictions. We assess the consequences of the additional constraints for the model accuracy and test the models in a real-life MPC experiment in an apartment in Switzerland. In two five-day cooling experiments, MPC with Input Convex Neural Networks is able to keep room temperatures within comfort constraints while minimizing cooling energy consumption.

eess.SY↗

arXiv2020

Distributed Model Predictive Control with Asymmetric Adaptive Terminal Sets for the Regulation of Large-scale Systems

In this paper, a novel distributed model predictive control (MPC) scheme with asymmetric adaptive terminal sets is developed for the regulation of large-scale systems with a distributed structure. Similar to typical MPC schemes, a structured Lyapunov matrix and a distributed terminal controller, respecting the distributed structure of the system, are computed offline. However, in this scheme, a distributed positively invariant terminal set is computed online and updated at each time instant taking into consideration the current state of the system. In particular, we consider ellipsoidal terminal sets as they are easy to compute for large-scale systems. The size and the center of these terminal sets, together with the predicted state and input trajectories, are considered as decision variables in the online phase. Determining the terminal set center online is found to be useful specifically in the presence of asymmetric constraints. Finally, a relaxation of the resulting online optimal control problem is provided. The efficacy of the proposed scheme is illustrated in simulation by comparing it to a recent distributed MPC scheme with adaptive terminal sets.

eess.SY↗