Searcharxiv⌕ Search

arXiv subjects

Kostas Margellos

Publications and source records attributed to Kostas Margellos.

At least 19 recordsLinked to original sources

Stability Certification for Approximate Nonlinear Model Predictive Control

Neural-network approximations of nonlinear model predictive control can reduce online computational costs, but ensuring constraint satisfaction and closed-loop stability remains challenging. We propose a framework in which convex optimisation is used to restore feasibility under suitable local assumptions, while bounds on the corrected controller's cost suboptimality provide sufficient conditions for practical closed-loop stability. To assess these conditions over a compact set of initial states, we investigate a branch-and-bound approach based on convex relaxations of the nonlinear dynamics, with probabilistic guarantees established through scenario optimisation. The proposed approach represents a step towards combining the computational efficiency of approximate nonlinear model predictive control with systematic methods for restoring feasibility and assessing stability.

math.OC↗

Transport, Entropy, and the Cost of Dependence: Maximum Conditional Entropy under Transport Constraints

Maximum-entropy inference under Wasserstein constraints can be computationally challenging due to the underlying optimization over transport couplings. We investigate a tractable alternative based on maximizing conditional entropy under an average transport constraint. On Euclidean spaces, this formulation admits an explicit generalized-Gaussian additive-noise solution, providing a feasible approximation to the Wasserstein-constrained problem without solving an optimal transport problem. We establish quantitative bounds on the resulting optimality gap by showing that the two formulations admit a common feasible-marginal representation, with their discrepancy characterized by the mutual information retained between the nominal and perturbed variables. For discretely supported nominal distributions, we further obtain an exact decomposition of the gap into a marginal-entropy gain and a weighted Jensen-Shannon divergence.

math.OC↗

Model Predictive Control with Multiple Constraint Horizons

We propose a Model Predictive Control (MPC) formulation for nonlinear systems without terminal penalty or dedicated stabilizing terminal set, in which state constraints are enforced heterogeneously along the prediction horizon. In this setting a control-invariant set certifies near-term safety, while a less restrictive set constrains later predictions. This structure is motivated by safety-critical formulations, such as Control Barrier Function (CBF) based MPC, collision avoidance, and robotic receding-horizon planning, where near-term predictions must be certified safe and later predictions can be re-certified in future updates. We develop a value-function-difference analysis separating the effects of constraint-set selection and prediction-horizon length on closed-loop performance bounds, yielding implicit suboptimality certificates. Assuming cost-controllability, we further propose an upper-bound certificate which accounts explicitly for distinct constraint sets, their associated decay rates, and horizons. We also provide a lower-bound certificate for the closed-loop cost beyond the finite-horizon open-loop cost, which, for the admissible parameter range, is not weaker than the standard finite-horizon bound. Simulations on linear and nonlinear safety-critical systems demonstrate the proposed certificates \textit{a priori} and \textit{a posteriori}.

eess.SY↗

On the suboptimality of stochastic MPC with varying constraint horizon

Enforcing stochastic state constraints over the full prediction horizon in Model Predictive Control (MPC) can be computationally demanding. Here we study stochastic MPC without terminal ingredients in which chance constraints are enforced only over a shorter constraint horizon. Using stochastic relaxed dynamic programming, we derive an explicit upper bound on the average expected closed-loop cost that depends on both prediction and constraint horizons. For linear quadratic problems with affine chance constraints and bounded uniform disturbances, we provide a deterministic reformulation via coordinate transformation and constraint tightening. Simulations illustrate the trade-off between computational effort and performance.

math.OC↗

A Prototyping Framework for Distributed Control of Multi-Robot Systems

This paper presents a prototyping framework for distributed control of multi-robot systems, aimed at bridging theory and practical testing of distributed optimization algorithms. Using the Single Program, Multiple Data (SPMD) paradigm, the framework emulates distributed control on a single computer, with each core running the same algorithm using local states and neighbour-to-neighbour communication. We demonstrate the framework on a four-quadrotor position-swapping task using a non-cooperative game-theoretic distributed algorithm. Computational time and trajectory data are compared across the supported dynamics levels: a point-mass model, a high-fidelity quadrotor model, and an experimental hardware testbed using Crazyflie quadcopters. The results show that the framework provides a low-cost and accessible approach for validating distributed algorithms.

cs.RO↗

Efficient Quantification of Time-Series Prediction Error: Optimal Selection Conformal Prediction

Designing effective score functions in Conformal Prediction (CP) for time-series data remains challenging due to conservativeness and/or computational inefficiency. We propose Optimal Selection Conformal Prediction (OSCP), which parameterizes the score function via offset terms. To determine these parameters, we formulate a mixed-integer linear program (MILP) that minimizes an empirical proxy of the region size. We further reformulate this optimization problem into a smaller form (fewer constraints) to improve computational efficiency. We provide theoretical guarantees on both validity and CP-efficiency of OSCP. Numerical experiments demonstrate that OSCP reduces uncertainty-set size and has much lower computational requirements compared to the state-of-the-art method.

math.OC↗

Finite sample learning of moving targets

We consider a moving target that we seek to learn from samples. Our results extend randomized techniques developed in control and optimization for a constant target to the case where the target is changing. We derive a novel bound on the number of samples that are required to construct a probably approximately correct (PAC) estimate of the target. Furthermore, when the moving target is a convex polytope, we provide a constructive method of generating the PAC estimate using a mixed integer linear program (MILP). The proposed method is demonstrated on an application to autonomous emergency braking.

math.OC↗

Data-Driven Performance Guarantees for Parametric Optimization Problems

We propose a data-driven method to establish probabilistic performance guarantees for parametric optimization problems solved via iterative algorithms. Our approach addresses two key challenges: providing convergence guarantees to characterize the worst-case number of iterations required to achieve a predefined tolerance, and upper bounding a performance metric after a fixed number of iterations. These guarantees are particularly useful for online optimization problems with limited computational time, where existing performance guarantees are often unavailable or unduly conservative. We formulate the convergence analysis problem as a scenario optimization program based on a finite set of sampled parameter instances. Leveraging tools from scenario optimization theory enables us to derive probabilistic guarantees on the number of iterations needed to meet a given tolerance level. Using recent advancements in scenario optimization, we further introduce a relaxation approach to trade the number of iterations against the risk of violating convergence criteria thresholds. Additionally, we analyze the trade-off between solution accuracy and time efficiency for fixed-iteration optimization problems by casting them into scenario optimization programs. Numerical simulations demonstrate the efficacy of our approach in providing reliable probabilistic convergence guarantees and evaluating the trade-off between solution accuracy and computational cost.

math.OC↗

Data-Driven Certificate Synthesis

We investigate the problem of verifying different properties of discrete time dynamical systems, namely, reachability, safety and reach-while-avoid. To achieve this, we adopt a data driven perspective and, using past system trajectories as data, we aim at learning a specific function termed certificate for each property we wish to verify. We seek to minimize a loss function, designed to encompass conditions on the certificate to be learned that encode the satisfaction of the associated property. Besides learning a certificate, we quantify probabilistically its generalization properties, namely, how likely it is for a certificate to be valid (and hence for the associated property to be satisfied) when it comes to a new system trajectory not included in the training data set. We view this problem under the realm of probably approximately correct (PAC) learning under the notion of compression, and use recent advancements of the so-called scenario approach to obtain scalable generalization bounds on the learned certificates. To achieve this, we design a novel algorithm that minimizes the loss function and hence constructs a certificate, and at the same time determines a quantity termed compression, which is instrumental in obtaining meaningful probabilistic guarantees. This process is novel per se and provides a constructive mechanism for compression set calculation, thus opening the road for its use to more general non-convex optimization problems. We verify the efficacy of our methodology on several numerical case studies, and compare it (both theoretically and numerically) with closely related results on data-driven property verification.

eess.SY↗

Continuous-time Data-driven Barrier Certificate Synthesis

We consider the problem of verifying safety for continuous-time dynamical systems. Developing upon recent advancements in data-driven verification, we use only a finite number of sampled trajectories to learn a barrier certificate, namely a function which verifies safety. We train a safety-informed neural network to act as this certificate, with an appropriately designed loss function to encompass the safety conditions. In addition, we provide probabilistic generalisation guarantees from discrete samples of continuous trajectories, to unseen continuous ones. Numerical investigations demonstrate the efficacy of our approach and contrast it with related results in the literature.

eess.SY↗

Predictive Control Barrier Functions: Bridging model predictive control and control barrier functions

In this paper, we establish a connection between model predictive control (MPC) techniques and Control Barrier Functions (CBFs). Recognizing the similarity between CBFs and Control Lyapunov Functions (CLFs), we propose a MPC formulation that ensures invariance and safety without relying on explicit stability conditions. The value function of our proposed MPC is a CBF, which we refer to as the Predictive Control Barrier Function (PCBF), similar to traditional MPC formulations which encode stability by having value functions as CLFs. Our formulation is simpler than previous PCBF approaches and is based on weaker assumptions while proving a similar theorem that guarantees safety recovery. Notably, our MPC formulation does not require the value function to be strictly decreasing to ensure convergence to a safe invariant set. Numerical examples demonstrate the effectiveness of our approach in guaranteeing safety and constructing non-conservative CBFs.

math.OC↗

Distributed equilibrium seeking in aggregative games: linear convergence under singular perturbations lens

We present a fully-distributed algorithm for Nash equilibrium seeking in aggregative games over networks. The proposed scheme endows each agent with a gradient-based scheme equipped with a tracking mechanism to locally reconstruct the aggregative variable, which is not available to the agents. We show that our method falls into the framework of singularly perturbed systems, as it involves the interconnection between a fast subsystem - the global information reconstruction dynamics - with a slow one concerning the optimization of the local strategies. This perspective plays a key role in analyzing the scheme with a constant stepsize, and in proving its linear convergence to the Nash equilibrium in strongly monotone games with local constraints. By exploiting the flexibility of our aggregative variable definition (not necessarily the arithmetic average of the agents' strategy), we show the efficacy of our algorithm on a realistic voltage support case study for the smart grid.

eess.SY↗

Bridging conformal prediction and scenario optimization

Conformal prediction and scenario optimization constitute two important classes of statistical learning frameworks to certify decisions made using data. They have found numerous applications in control theory, machine learning and robotics. Despite intense research in both areas, and apparently similar results, a clear connection between these two frameworks has not been established. By focusing on the so-called vanilla conformal prediction, we show rigorously how to choose appropriate score functions and set predictor map to recover well-known bounds on the probability of constraint violation associated with scenario programs. We also show how to treat ranking of nonconformity scores as a one-dimensional scenario program with discarded constraints, and use such connection to recover vanilla conformal prediction guarantees on the validity of the set predictor. We also capitalize on the main developments of the scenario approach, and show how we could analyze calibration conditional conformal prediction under this lens. Our results establish a theoretical bridge between conformal prediction and scenario optimization.

cs.LG↗

Constraint Horizon in Model Predictive Control

In this work, we propose a Model Predictive Control (MPC) formulation incorporating two distinct horizons: a prediction horizon and a constraint horizon. This approach enables a deeper understanding of how constraints influence key system properties such as suboptimality, without compromising recursive feasibility and constraint satisfaction. In this direction, our contributions are twofold. First, we provide a framework to estimate closed-loop optimality as a function of the number of enforced constraints. This is a generalization of existing results by considering partial constraint enforcement over the prediction horizon. Second, when adopting this general framework under the lens of safety-critical applications, our method improves conventional Control Barrier Function (CBF) based approaches. It mitigates myopic behaviour in Quadratic Programming (QP)-CBF schemes, and resolves compatibility issues between Control Lyapunov Function (CLF) and CBF constraints via the prediction horizon used in the optimization. We show the efficacy of the method via numerical simulations for a safety critical application.

eess.SY↗

Distributed Safe Control Design and Probabilistic Safety Verification for Multi-Agent Systems

We propose distributed iterative algorithms for safe control design and safety verification for networked multi-agent systems. These algorithms rely on distributing a control barrier function (CBF) related quadratic programming (QP) problem assuming the existence of CBFs. The proposed distributed algorithm addresses infeasibility issues of existing schemes via a cooperation mechanism between agents. The resulting control input is guaranteed to be optimal, and satisfies CBF constraints of all agents. Furthermore, a truncated algorithm is proposed to facilitate computational implementation. The performance of the truncated algorithm is evaluated using a distributed safety verification algorithm. The algorithm quantifies safety for multi-agent systems probabilistically by means of CBFs. Both upper and lower bounds on the probability of safety are obtained using the so called scenario approach. Both the scenario sampling and safety verification procedures are fully distributed. The efficacy of our algorithms is demonstrated by an example on multi-robot collision avoidance.

eess.SY↗

Probabilistically safe controllers based on control barrier functions and scenario model predictive control

Control barrier functions (CBFs) offer an efficient framework for designing real-time safe controllers. However, CBF-based controllers can be short-sighted, resulting in poor performance, a behaviour which is aggravated in uncertain conditions. This motivated research on safety filters based on model predictive control (MPC) and its stochastic variant. MPC deals with safety constraints in a direct manner, however, its computational demands grow with the prediction horizon length. We propose a safety formulation that solves a finite horizon optimization problem at each time instance like MPC, but rather than explicitly imposing constraints along the prediction horizon, we enforce probabilistic safety constraints by means of CBFs only at the first step of the horizon. The probabilistic CBF constraints are transformed in a finite number of deterministic CBF constraints via the scenario based methodology. Capitalizing on results on scenario based MPC, we provide distribution-free, \emph{a priori} guarantees on the system's closed loop expected safety violation frequency. We demonstrate our results through a case study on unmanned aerial vehicle collision-free position swapping, and provide a numerical comparison with recent stochastic CBF formulations.

eess.SY↗

Safe and Stable Filter Design Using a Relaxed Compatibitlity Control Barrier -- Lyapunov Condition

In this paper, we propose a quadratic programming-based filter for safe and stable controller design, via a Control Barrier Function (CBF) and a Control Lyapunov Function (CLF). Our method guarantees safety and local asymptotic stability without the need for an asymptotically stabilizing control law. Feasibility of the proposed program is ensured under a mild regularity condition, termed relaxed compatibility between the CLF and CBF. The resulting optimal control law is guaranteed to be locally Lipschitz continuous. We also analyze the closed-loop behaviour by characterizing the equilibrium points, and verifying that there are no equilibrium points in the interior of the control invariant set except at the origin. For a polynomial system and a semi-algebraic safe set, we provide a sum-of-squares program to design a relaxed compatible pair of CLF and CBF. The proposed approach is compared with other methods in the literature using numerical examples, exhibits superior filter performance and guarantees safety and local stability.

eess.SY↗

Learning Robust Policies for Uncertain Parametric Markov Decision Processes

Synthesising verifiably correct controllers for dynamical systems is crucial for safety-critical problems. To achieve this, it is important to account for uncertainty in a robust manner, while at the same time it is often of interest to avoid being overly conservative with the view of achieving a better cost. We propose a method for verifiably safe policy synthesis for a class of finite state models, under the presence of structural uncertainty. In particular, we consider uncertain parametric Markov decision processes (upMDPs), a special class of Markov decision processes, with parameterised transition functions, where such parameters are drawn from a (potentially) unknown distribution. Our framework leverages recent advancements in the so-called scenario approach theory, where we represent the uncertainty by means of scenarios, and provide guarantees on synthesised policies satisfying probabilistic computation tree logic (PCTL) formulae. We consider several common benchmarks/problems and compare our work to recent developments for verifying upMDPs.

eess.SY↗