SearcharxivSearch

arXiv subjects

Adnane Saoud

Publications and source records attributed to Adnane Saoud.

At least 19 recordsLinked to original sources

Safe Deep Reinforcement Learning for Energy-Efficient HVAC Control in Multi-Zone Residential Buildings

HVAC systems represent a major share of building energy consumption. Traditional control strategies are limited in coordinating energy-comfort tradeoffs across multiple zones simultaneously. Reinforcement learning (RL) offers adaptive, data-driven control that optimizes performance over time. However, deploying learned neural network controllers in safety-critical building systems remains challenging due to lack of formal safety guarantees. We propose a safety-certified deep RL framework for multi-zone residential HVAC control. Proximal Policy Optimization (PPO) and Soft Actor-Critic (SAC) agents are trained in an EnergyPlus/Sinergym simulation to minimize energy consumption while maintaining thermal comfort. Post-training safety certification is performed on the PPO policy using Lipschitz-based forward invariance analysis, building on existing tools for the computation of Lipschitz constants for neural networks, to guarantee constraint satisfaction. Both agents are evaluated over an annual simulation cycle in an eight-zone variable refrigerant flow (VRF) testbed. The PPO agent achieves 67\% comfort violation reduction compared to rule-based control, while the SAC agent achieves 27.6\% energy savings. The PPO policy satisfies formal safety certification with a margin of $2.003^\circ$C. These results demonstrate the feasibility of combining reinforcement learning with post-training safety verification for multi-zone building control.

eess.SY

Complete Abstractions of Monotone Control Systems: From Model-based to Data-Driven Systems

In this paper, we introduce the approximate strong upper alternating simulation (ASUAS), a new behavioral relation for transition systems. Building on this relation, we construct upper- and lower-sparse abstractions for monotone systems that together form a complete abstraction pair: any controller synthesized for the upper-sparse abstraction can be refined into a controller for the original system, and the absence of a controller for the lower-sparse abstraction implies the absence of a controller for the original system. A key feature of our approach is the ability to provably tune the conservativeness gap between the two abstractions by tuning the space-discretization parameter. We further extend these results, beyond the model-based setting, to data-driven systems, where the abstraction is constructed directly from finite sampled data, without requiring an explicit system model. The theoretical results are illustrated through simulations.

eess.SY

How Much Spatial Control Is Enough? Subdomain Optimal Control of Reaction-Diffusion Systems in Synthetic Developmental Biology

Reaction-diffusion systems can produce spatial patterns such as stripes and spots through diffusion-driven instability. Steering these patterns from one configuration to another can be formulated as an optimal control problem. When the control acts on the entire spatial domain, existence and optimality conditions are well understood. Yet in practice, the control can only act on a part of the domain. Taking the Nodal--Lefty reaction--diffusion system as a case study, we consider the setting where the control is restricted to a subdomain. We derive an explicit upper bound on the optimality loss, defined as the difference between the subdomain optimal cost and the full-domain optimal cost. From this bound, we obtain an explicit formula for the minimum size of the control region needed to reach a target pattern with prescribed accuracy. We also consider the case where the control is distributed over several disjoint regions instead of a single one, with the same total area, and prove that the distributed configuration gives a tighter bound under natural conditions on the spatial structure of the target. Numerical illustrations confirm the theoretical results and show that a control region covering roughly forty percent of the domain is sufficient to drive the system from stripes to spots with high accuracy.

math.OC

Specification-aware Robustness Margins for Symbolic Controllers

We address the problem of robust controller synthesis for a class of linear temporal logic (LTL) specifications over families of perturbed systems using symbolic control techniques. Given a dynamical system, a specification, and a symbolic controller synthesized using the fixed-point algorithm of the specification, the objective is to find the maximal perturbation we can apply to the system while the system continues to satisfy the same specification under the same controller. We first provide general results, by demonstrating that controllers synthesized based on the symbolic model can be refined back to a perturbed version of the concrete system while preserving their correctness. Focusing on four fundamental temporal logic specifications, namely safety, reachability, persistence, and recurrence, we introduce a general measure of the maximal robustness margin. Then, for each class of specifications, we derive a customized version of the measure and establish the corresponding theoretical guarantees. Importantly, the robustness margin depends explicitly on the sequence of sets generated during the fixed-point computation, allowing for specification-dependent and less conservative bounds compared to generic abstraction-based approaches. The theoretical developments are illustrated on two examples, demonstrating the practical applicability and effectiveness of the proposed approach.

eess.SY

Certified Reachable Sets for Nonlinear Reaction--Diffusion Systems

Reachability analysis for dynamical systems seeks to compute a set containing all reachable states at a given time. Compared to ordinary differential equations (ODEs), the analysis of nonlinear reaction--diffusion PDEs with parametric uncertainties remains largely underexplored, due to the infinite-dimensional state space and the variety of solutions under different parameters. We address this through a three-step procedure: 1) Finite Element Methods (FEM)s to discretise the space and generate a finite-dimensional FEM-based model, 2) Proper Orthogonal Decomposition (POD) to build a Reduced-Order Model (ROM), and 3) set-based reachability-analysis methods applied to the ROM. We propose a framework that enables us to derive explicit upper bounds on the approximation errors introduced at each stage of the pipeline. In particular, we quantify the discrepancy between trajectories of the original PDE and those of the FEM-based discretization, as well as the error between the FEM-based model and the reduced-order model. Importantly, these bounds are shown to hold uniformly over the considered set of parameters. By combining these error estimates, we obtain an over-approximation of the reachable set of the original PDE. The approach is illustrated on the Allen--Cahn equation and a logistic growth PDE.

math.NA

S-GBT: Smooth Growth Bound Tensor for Certified Robustness Against Word Substitution Attacks in NLP

Despite recent progress in Natural Language Processing (NLP), models remain vulnerable to word substitution attacks. Most existing defenses focus on first order sensitivity and measure how much the output changes when the input is slightly perturbed. However, they ignore how this sensitivity evolves, which is described by curvature. When gradients vary sharply, models can still fail. This paper introduces the Smooth Growth Bound Tensor (S-GBT), a second order method that bounds the Hessian element-wise, for which we provide formal theoretical proofs on the resulting robustness bounds. A regularization term is added during training to minimize these bounds. This yields tighter certified robustness against word substitution attacks. The change in the output under word substitution is bounded by both a linear term and a quadratic term. S-GBT is derived for two architectures: Long Short-Term Memory (LSTM) and Convolutional Neural Networks (CNN). The method is integrated directly into the training objective. Its effectiveness is evaluated on multiple benchmark datasets. The results show that combining first and second order regularization improves certified robust accuracy by up to 23.4% compared to prior methods, while clean accuracy remains competitive. These findings indicate that controlling both the gradient and its variation is a promising direction for building more robust models.

cs.CL

A Trajectory-Based Approach to Controlled Invariance and Recursively Feasible MPC

In this paper, we revisit the computation of controlled invariant sets for linear discrete-time systems through a trajectory-based viewpoint. We begin by introducing the notion of convex feasible points, which provides a new characterization of controlled invariance using finitely long state trajectories. We further show that combining this notion with the classical backward fixed-point algorithm allows for the computation of the maximal controlled invariant set. Building on these results, we propose a model predictive control (MPC) scheme that guarantees recursive feasibility without relying on precomputed terminal sets. Finally, we formulate the search for convex feasible points as an optimization problem, yielding a practical computational method for constructing controlled invariant sets. The effectiveness of the approach is illustrated through numerical examples.

math.OC

Safety by Invariance, Liveness through Refinement: Heterogeneous Contract Framework for Co-Design of Layered Control

Real-world control systems must achieve long-horizon objectives (liveness) while respecting continuous-time safety constraints, a combination that motivates hierarchical layered control architectures (LCAs). Existing LCA research, however, lacks (i) a uniform specification language across discrete planning and continuous execution, (ii) formal guarantees that specifications are preserved when interconnecting subsystems at heterogeneous time scales, and (iii) compositional separation between layers, owing to reliance on naive input-filtering laws. This paper addresses all three gaps by importing the safety--liveness decomposition into a heterogeneous assume--guarantee framework: \emph{safety is enforced by invariance} at the continuous-time layer, while \emph{liveness is achieved through refinement} at the discrete-time layer, with inter-layer coordination formalized via vertical refinement and timing-compatibility conditions. We instantiate this contract with a novel LCA combining an MPC planner, an input-to-state stabilizing (ISS) low-level controller, and a reference-governor bridge, and validate it on a Hybrid Energy Storage System (HESS) comprising a battery and a supercapacitor.

eess.SY

$H^2$ Stabilization of the $2$-D and $3$-D Heat Equation via Modal Decomposition

Boundary controllers have been recently proposed in the literature, via modal decomposition, to achieve $H^1$ stabilization of linear parabolic equations in two and three dimensions. In one dimension ($1$-D), $H^1$ exponential stability is known to imply boundedness and asymptotic convergence of the state to zero in the sense of the max norm. However, in two ($2$-D) and three dimensions ($3$-D), this implication does not systematically hold. In this paper, focusing on the full-state feedback case, our objective is to prove that the modal-decomposition based controller in \cite{Munteanu2017IJC} guarantees, not only $H^1$ exponential stability, but also $H^2$ exponential stability. This implies, in particular, boundedness and asymptotic convergence of the state to zero in the sense of the max norm. Our approach consists in rewriting the Laplacian of the state, required in the $H^2$ norm, as a linear combination of the state and its time derivative. The $L^2$ norm of the state being bounded by the $H^1$ norm, we only analyze the $L^2$ norm of the time derivative of the state.

math.OC

Temporal Logic Resilience for Continuous-time Systems

In this paper, we present a novel framework for quantifying a lower bound on resilience in continuous-time (non)linear systems subject to external disturbances while ensuring satisfaction of signal temporal logic specifications. Unlike robustness, which evaluates how well a system satisfies a specification under a given disturbance, resilience measures the maximum disturbance a system can tolerate from a given initial state while maintaining specification satisfaction. We first derive bounds on the perturbed trajectories and then use them to formulate a computational method based on scenario optimization to efficiently compute the maximum admissible disturbance. We validate our approach through case studies, including dc motor, temperature regulation, a nonlinear numerical example, and a vehicle collision avoidance case.

eess.SY

Resilient and Effort-Optimal Controller Synthesis under Temporal Logic Specifications

In this paper, we consider the notions of effort and resilience of a dynamical control system defined by the maximum disturbance the system can withstand while satisfying given finite temporal logic specifications. Given a dynamical system and a specification, the objective is to synthesize the controller such that the system satisfies the specification while maximizing its resilience, taking into account input constraints. In addition, we introduce a new metric, called the effort metric, which characterizes the minimal input bound necessary to satisfy a given specification for a perturbed system. The problem for both metrics is formulated as a robust optimization program where the objective is to compute the maximum resilience for the system with input constraints or the minimal effort while simultaneously synthesizing the corresponding controller parameters. Moreover, we study the trade-off between resilience and effort, where we seek to maximize resilience and minimize the control effort. For linear systems and linear controllers, exact solutions are provided for the class of time-varying polytopic specifications for the closed-loop and open-loop systems. For the case of nonlinear systems, nonlinear controllers, and more general specifications, we leverage tools from the scenario optimization approach, offering a probabilistic guarantee of the solution as well as computational feasibility. Different case studies are presented to illustrate the theoretical results.

eess.SY

An optimal-control framework for reaction diffusion systems with application to synthetic developmental biology

Reaction-diffusion systems offer a powerful framework for understanding self-organized patterns in biological systems, yet controlling these patterns remains a significant challenge. As a consequence, we present a rigorous framework of optimal control for a class of coupled reaction-diffusion systems. The couplings are justified by the shared regulatory mechanisms encountered in synthetic biology. Furthermore, we introduce inputs and polynomial input-gain functions to guarantee well-posedness of the control system while maintaining biological relevance. As a result, we formulate an optimal control problem and derive necessary optimality conditions. We demonstrate our framework on an instance of such equations modeling the Nodal-Lefty interactions in mammalian cells. Numerical simulations showcase the effectiveness in directing pattern towards diverse targeted ones.

math.OC

Robust Hybrid Finite-Time Parameter Estimation Without Persistence of Excitation

In this paper, we consider the problem of estimating parameters of a linear regression model. Using a hybrid systems framework, a hybrid algorithm is proposed allowing the estimate to converge to the exact value of the unknown parameters in predetermined finite time. Interestingly, we show that for the case of constant parameters, the convergence property of the hybrid algorithm holds while only requiring the regressor to be exciting on a given interval. For the case of piecewise constant parameters, the classical persistency of excitation condition is required to guarantee the convergence. Robustness of the proposed algorithm with respect to measurements noise is analysed. Finally, illustrative examples are provided showing the merits of the proposed approach in terms of scalability and the applicability for the general class of time-varying unknown parameters

eess.SY

Nagumo-Type Characterization of Forward Invariance for Constrained Systems

This paper proposes a Nagumo-type invariance condition for differential inclusions defined on closed constraint sets. More specifically, given a closed set to render forward invariant, the proposed condition restricts the system's dynamics, assumed to be locally Lipschitz, on the boundary of the set restricted to the interior of the constraint set. In particular, when the boundary of the set is entirely within the interior of the constraint set, the proposed condition reduces to the well-known Nagumo condition, known to be necessary and sufficient for forward invariance in this case. This being said, the proposed condition is only necessary in the general setting. As a result, we provide a set of additional assumptions relating the constrained system to the set to render forward invariant, and restricting to the geometry at the intersection between the two sets, so that the equivalence holds. The importance of the proposed assumptions is illustrated via examples.

math.OC

Computation of Feasible Assume-Guarantee Contracts: A Resilience-based Approach

We propose a resilience-based framework for computing feasible assume-guarantee contracts that ensure the satisfaction of temporal specifications in interconnected discrete-time systems. Interconnection effects are modeled as structured disturbances. We use a resilience metric, the maximum disturbance under which local specifications hold, to refine assumptions and guarantees across subsystems iteratively. We first demonstrate correctness and monotone refinement of guarantees for two subsystems. Then, we extend our approach to general networks of L subsystems using weighted combinations of interconnection effects. We instantiate the framework on linear systems by meeting finite-horizon safety, exact-time reachability, and finite-horizon reachability specifications, and on nonlinear systems by fulfilling general finite-horizon specifications. Our approach is demonstrated through numerical linear examples and a nonlinear DC microgrid case study, showcasing the impact of our framework on verifying temporal logic specifications with compositional reasoning.

eess.SY

Just Few States are Enough: Randomized Sparse Feedback for Stability of Dynamical Systems

While classical control theory assumes that the controller has access to measurements of the entire state (or output) at every time instant, this paper investigates a setting where the feedback controller can only access a randomly selected subset of the state vector at each time step. Due to the random sparsification that selects only a subset of the state components at each step, we analyze the stability of the closed-loop system in terms of Asymptotic Mean-Square Stability (AMSS), which ensures that the system state converges to zero in the mean-square sense. We consider the problem of designing both a feedback gain matrix and a measurement sparsification strategy that minimizes the number of state components required for feedback, while ensuring AMSS of the closed-loop system. Interestingly, (1) we provide conditions on the dynamics of the system under which it is possible to find a sparsification strategy, and (2) we propose a Linear Matrix Inequality (LMI) based algorithm that jointly computes a stabilizing gain matrix, and a randomized sparsification strategy that minimizes the expected number of measured state coordinates while preserving the AMSS. Our approach is then extended to the case where the sparsification probabilities vary across the state components. Based on these theoretical findings, we propose an algorithmic procedure to compute the vector of sparsification parameters, along with the corresponding feedback gain matrix. To the best of our knowledge, this is the first study to investigate the stability properties of control systems that rely solely on randomly selected state measurements. Numerical simulations demonstrate that, in some settings, the system achieves comparable performance to full-state feedback while requiring measurements from only $0.3\%$ of the state coordinates.

eess.SY

Turing Patterns in a Morphogenetic Model with Single Regulatory Function

Confirming Turing's theory of morphogens in developmental processes is challenging, and synthetic biology has opened new avenues for testing Turing's predictions. Synthetic mammalian pattern formation has been recently achieved through a reaction-diffusion system based on the short-range activator (Nodal) and the long-range inhibitor (Lefty) topology, where a single function regulates both morphogens. In this paper, we investigate the emergence of Turing patterns in the synthetic Nodal-Lefty system. First, we prove the existence of a global solution and derive conditions for Turing instability through linear stability analysis. Subsequently, we examine the behavior of the system near the bifurcation threshold, employing weakly nonlinear analysis, and using multiple time scales, we derive the amplitude equations for supercritical and subcritical cases. The results demonstrate the ability of the system to support various patterns, with the subcritical Turing instability playing a crucial role in the formation of dissipative structures observed experimentally.

nlin.PS

Maximally Resilient Controllers under Temporal Logic Specifications

In this paper, we consider the notion of resilience of a dynamical system, defined by the maximum disturbance a controlled dynamical system can withstand while satisfying given temporal logic specifications. Given a dynamical system and a specification, the objective is to synthesize the controller such that the closed-loop system satisfies this specification while maximizing its resilience. The problem is formulated as a robust optimization program where the objective is to compute the maximum resilience while simultaneously synthesizing the corresponding controller parameters. For linear systems and linear controllers, exact solutions are provided for the class of time-varying polytopic specifications. For the case of nonlinear systems, nonlinear controllers and more general specifications, we leverage tools from the scenario optimization approach, offering a probabilistic guarantee of the solution as well as computational feasibility. Different case studies are presented to illustrate the theoretical results.

eess.SY