Search arXivSearch

arXiv · 2609.14192

Resilient Extremum Seeking Control for Cyber-Physical Systems Under Denial-of-Service Attacks

Abstract

Extremum seeking control (ESC) relies on deliberately injected excitation to extract optimization information from measured outputs, making its networked implementation particularly vulnerable to denial-of-service (DoS) attacks. This paper develops a resilient discrete-time ESC architecture for cyber-physical systems subject to DoS attacks. By holding the most recently successfully transmitted signals during DoS intervals, the proposed mechanism yields averaged error dynamics with an exponentially contracting mode under successful communication and a neutral mode under attack. For deterministic DoS attacks, practical exponential convergence to the extremum is established under an average bound on the attack duration, with an explicit convergence rate depending on the fraction of time under attack. For probabilistic DoS attacks, almost-sure and in-probability convergence properties are established via stochastic averaging, with the attack success probability explicitly entering the convergence rate. A key finding is that a seemingly natural zero-input strategy can fundamentally compromise ESC: attacks synchronized with the dither generate an $\mathcal{O}(1/a)$ bias in the averaged dynamics, where $a$ is the dither amplitude, and can displace the equilibrium from the true optimizer. Thus, under the proposed hold-based architecture, increasingly severe DoS attacks primarily slow the optimization process rather than destroy its stability, provided that communication is not permanently blocked. Numerical simulations illustrate the theoretical guarantees and the failure mechanism induced by dither-synchronized attacks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Filipe da Silva Bastos Teixeira, Pedro Henrique Silva Coutinho, Tiago Roux Oliveira, Miroslav Krstic. 2026-09-12. Resilient Extremum Seeking Control for Cyber-Physical Systems Under Denial-of-Service Attacks. https://arxiv.org/abs/2609.14192

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Subpath-Based Column Generation for Electric Vehicle Routing Problems

Motivated by widespread electrification targets, this paper studies an Electric Vehicle Routing Problem with Time Windows and Nonlinear Charging (EVRPTWNL) that jointly optimizes routing-scheduling decisions and charging decisions given vehicle capacities, time windows and battery capacities. We develop a column generation scheme with a subpath-based label-setting algorithm that decomposes the pricing problem into two phases: (i) generating subpaths between charging stations, and (ii) combining subpaths into paths while optimizing charging decisions in between. We formalize a domination framework to establish the convergence and exactness of the algorithm, and prove that the methodology can solve a range of EVRP variants (e.g., with vehicle capacities, time windows, and nonlinear charging) and relaxation-tightening strategies (e.g., ng-relaxations and subset-row cuts). Computational results show improvements over path-based benchmarks in both computational time and solution quality, especially when time windows become wider, when vehicles can perform multiple tasks on a single charge and when vehicles still need to recharge several times across the planning horizon. Ultimately, the methodology can scale to otherwise intractable instances with up to 100 customers, thereby enhancing fleet management capabilities across electrified logistics areas.

math.OC

Polynomial Scaling is Possible For Neural Operator Approximations of Structured Families of BSDEs

Neural operator (NO) architectures learn nonlinear maps between infinite-dimensional function spaces and are widely used to accelerate simulation and enable data-driven model discovery. While universality results ensure expressivity, they do not address \emph{complexity}: for broad operator classes described only through regularity (e.g.\ uniform continuity or $C^r$-regularity), information-theoretic lower bounds imply that minimax-optimal NO approximation rates scale \emph{exponentially} in the reciprocal accuracy $1/\varepsilon$. This has shifted the focus of NO theory toward identifying additional problem-specific structure, beyond regularity, under which suitably tailored NO architectures can leverage to unlock polynomial scaling in $1/\varepsilon$. We exhibit the first polynomial-scaling regime for NO approximations of solution operators in stochastic analysis; by identifying structured families of \emph{non-Markovian} BSDEs with randomized terminal condition parameterized by the Sobolev-regular terminal condition and by Sobolev-regular additive nonlinear perturbations of the generator. We prove that their solution operator can be approximated (uniformly over the family) by a tailored NO whose number of trainable parameters grows \emph{polynomially} in $1/\varepsilon$. We unlock this polynomial scaling regime by \emph{informing the NO's inductive bias} by factoring out the singular part of the associated semilinear elliptic PDE Green's function and by incorporating the Doléans--Dade exponential of the BSDE's common non-Markovian factor into the NO's decoding layers. As a byproduct, we extend polynomial-scaling guarantees from families of linear elliptic PDEs on regular domains to the semilinear setting.

math.OC

The Competive Spectral Radius of Families of Nonexpansive Mappings

We consider a new class of repeated zero-sum games in which the payoff is the escape rate of a switched dynamical system, where at every stage, the transition is given by a nonexpansive operator depending on the actions of both players. This generalizes to the two-player (and non-linear) case the notion of joint spectral radius of a family of matrices. We show that the value of this game does exist, and we characterize it in terms of an infinite dimensional non-linear eigenproblem. This provides a two-player analogue of Mañe's lemma from ergodic control. This also extends to the two-player case results of Kohlberg and Neyman (1981), Karlsson (2001), and Vigeral and the second author (2012), concerning the asymptotic behavior of nonexpansive mappings. We discuss two special cases of this game: order preserving and positively homogeneous self-maps of a cone equipped with Funk's and Thompson's metrics, and translations of a finite dimensional normed space.

math.OC