{"title":"Polytopic and Interval Observers for Uncertain Linear Time-Varying Systems via Non-Square Transformation","authors":"Tarun Pati;Sze Zheng Yong","doi":"10.1109/LCSYS.2026.3706914","DOIUrl":"https://doi.org/10.1109/LCSYS.2026.3706914","url":null,"abstract":"This letter presents polytopic and interval observers for uncertain linear time-varying (LTV) continuous-time (CT) and discrete-time (DT) systems subject to bounded disturbances and measurement noise. Our approach guarantees state enclosure (i.e., correctness property) and input-to-state stability (ISS) of the resulting polytopic and interval set estimates. Importantly, it applies to detectable LTV systems, through a possibly non-square (lifted) time-varying coordinate transformation and mixed-monotone embedding systems that do not require extra positivity/cooperative constraints. This allows feasible observer synthesis even in cases where earlier methods fail. The effectiveness of the proposed approach is illustrated through several LTV examples.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"10 ","pages":"2005-2010"},"PeriodicalIF":1.9,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148626443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance Analysis of an Anomaly Detection Method Based on Distributed Spatial Filtering","authors":"Shinsaku Izumi;Kazuhiro Watanabe","doi":"10.1109/LCSYS.2026.3712361","DOIUrl":"https://doi.org/10.1109/LCSYS.2026.3712361","url":null,"abstract":"This letter analyzes the performance of an anomaly detection method based on distributed spatial filtering, i.e., the spatial filtering of signals over networks in a distributed manner. Assuming that the signal value of each node is corrupted by noise, we evaluate the success probability of the anomaly detection. By focusing on the effects of the noise on the signal values and using appropriate approximations, we derive an approximate expression for the success probability as a function of the threshold to detect the anomaly. Moreover, we present a design method for the threshold to maximize the approximate success probability.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"10 ","pages":"2143-2148"},"PeriodicalIF":1.9,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11605079","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148748136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ASIA: An Autonomous System Identification Agent","authors":"Dario Piga;Marco Forgione","doi":"10.1109/LCSYS.2026.3717047","DOIUrl":"https://doi.org/10.1109/LCSYS.2026.3717047","url":null,"abstract":"Over the years, research in system identification has provided a rich set of methods for learning dynamical models, together with well-established theoretical guarantees. In practice, however, the choice of model class, training algorithm, and hyperparameter tuning is still largely left to empirical trial-and-error, requiring substantial expert time and domain experience. Motivated by recent advances in agentic artificial intelligence, we present ASIA, a framework that delegates this iterative search to a large language model acting as an autonomous coding agent. Building on existing agentic platforms, ASIA closes the loop between hypothesis, implementation, and evaluation without human intervention, requiring only a plain-English description of the identification problem. We conduct an empirical study of ASIA on two system identification benchmarks and analyse the agent’s search behaviour, the architectures and training strategies it discovers, and the quality of the resulting models. We also discuss the potential of the approach and its current limitations, including implicit test leakage, reduced methodological transparency, reproducibility concerns, and sensitivity to the prompt.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"10 ","pages":"2251-2256"},"PeriodicalIF":1.9,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148836319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Stackelberg Framework for Product Upgrade Strategies With Forward-Looking Consumers","authors":"Mingda Yue;Yuhu Wu;Xun Shen;Junsong Wang","doi":"10.1109/LCSYS.2026.3707175","DOIUrl":"https://doi.org/10.1109/LCSYS.2026.3707175","url":null,"abstract":"We examine the optimal pricing and launch timing decisions of a monopolistic firm that introduces upgraded products and offers trade-in programs over a two-period planning horizon. Consumers are forward-looking and form rational expectations regarding future prices and trade-in subsidies. The strategic interaction is modeled as a Stackelberg game in which the firm acts as the leader and a continuum of heterogeneous consumers as followers. Assuming that consumer valuations follow a uniform distribution, we derive closed-form expressions for the optimal launch time and pricing of both product generations. Using model reduction analysis, we characterize the optimal trade-in price and identify five distinct trade-in intensity regions through numerical analysis. Our findings provide a theoretical foundation for coordinating product upgrades and trade-in incentives in dynamic market environments.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"10 ","pages":"1369-1374"},"PeriodicalIF":1.9,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148483647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Distributed Adaptive Control for Constrained Nash Equilibrium Seeking With Delays","authors":"Dimitra Kalyva;Haris E. Psillakis","doi":"10.1109/LCSYS.2026.3702912","DOIUrl":"https://doi.org/10.1109/LCSYS.2026.3702912","url":null,"abstract":"This letter addresses distributed Nash equilibrium (NE) seeking for a class of nonlinear Euler-Lagrange multi-agent systems subject to separable coupling constraints and constant communication delays. Each agent aims to regulate its output to the NE of a virtual static game while exchanging delayed information and operating under unknown dynamics and bounded disturbances. To this end, we introduce a set of delay-aware error variables embedding the gradients of the local cost and constraint functions. A distributed adaptive control law, combined with primal-dual projected dynamics, is designed to drive these errors to zero despite communication delays. Sufficient conditions on the controller gains and the delay magnitude are derived to guarantee asymptotic convergence to the unique NE. The effectiveness of the proposed framework is illustrated through simulations involving a network of nonholonomic mobile robots.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"10 ","pages":"835-840"},"PeriodicalIF":1.9,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148485328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On Type Deception in Linear-Quadratic Differential Games","authors":"Jesse Milzman;Dipankar Maity","doi":"10.1109/LCSYS.2026.3704518","DOIUrl":"https://doi.org/10.1109/LCSYS.2026.3704518","url":null,"abstract":"We consider two-player linear-quadratic differential games of incomplete information, in which one player has a private type initially unknown to the other. The typed player has incentive to conceal their type, while the uninformed player has the potential to infer it during play. Any ex-ante equilibrium in this setting will decompose into a deceptive, pooling phase, and a complete-information, revelatory phase. We demonstrate how to solve both phases via nested Riccati equations. Candidate equilibria are then found by maximizing the game value over a scalar revelation time, for which we provide a gradient in the case of time-homogeneous system matrices. We conclude by demonstrating our framework in a pursuit-evasion game with time-varying control advantages, finding interior optimal revelation times that confirm deception has quantifiable ex-ante value.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"10 ","pages":"895-900"},"PeriodicalIF":1.9,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148485548","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"GUARDIAN: Safety Filtering for Systems With Perception Models Under Adversarial Attack","authors":"Nicholas Rober;Alex Rose;Jonathan P. How","doi":"10.1109/LCSYS.2026.3694504","DOIUrl":"https://doi.org/10.1109/LCSYS.2026.3694504","url":null,"abstract":"Safety filtering is an effective method for enforcing constraints in safety-critical systems, but existing methods typically assume perfect state information. This limitation is especially problematic for systems that rely on neural network (NN)-based state estimators, which can be highly sensitive to noise and adversarial input perturbations. We address these problems by introducing GUARDIAN: Guaranteed Uncertainty-Aware Reachability Defense against Adversarial INterference, a safety filtering framework that provides formal safety guarantees for systems with NN-based state estimators. At runtime, GUARDIAN uses neural network verification tools to provide guaranteed bounds on the system’s state estimate given possible perturbations to its observation. It then uses a modified Hamilton-Jacobi reachability formulation to construct a safety filter that adjusts the nominal control input based on the verified state bounds and safety constraints. The result is an uncertainty-aware filter that ensures safety despite the use of an NN estimator with noisy, possibly adversarial, observations. Theoretical and numerical results show how GUARDIAN effectively defends systems against adversarial attacks that would otherwise cause violation of safety constraints.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"10 ","pages":"385-390"},"PeriodicalIF":1.9,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148485600","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Maral Mordad;Kian Behzad;Debojyoti Biswas;Noah J. Cowan;Milad Siami
{"title":"Bio-Inspired Event-Based Visual Servoing for Ground Robots","authors":"Maral Mordad;Kian Behzad;Debojyoti Biswas;Noah J. Cowan;Milad Siami","doi":"10.1109/LCSYS.2026.3703887","DOIUrl":"https://doi.org/10.1109/LCSYS.2026.3703887","url":null,"abstract":"Biological sensory systems are inherently adaptive, filtering out constant stimuli and prioritizing relative changes, likely enhancing computational and metabolic efficiency. Inspired by active sensing behaviors across a wide range of animals, this paper introduces a principled 1D event-based visual servoing framework for ground robots operating in structured environments. Utilizing a Dynamic Vision Sensor (DVS), we demonstrate that by applying a fixed spatial kernel to the asynchronous event stream generated from structured logarithmic intensity-change patterns, the resulting net event flux analytically isolates specific combinations of kinematic states. We establish a generalized theoretical bound for this event rate estimator and show that linear and quadratic spatial profiles isolate the robot’s velocity and position-velocity product, respectively. Leveraging these properties, we employ a multi-pattern stimulus to directly synthesize a nonlinear state feedback term entirely without traditional state estimation. To overcome the inescapable loss of linear observability at equilibrium inherent in event sensing, we propose a bio-inspired active sensing limit-cycle controller. Experimental validation on a 1/10-scale autonomous ground vehicle confirms the efficacy, extreme low-latency, and computational efficiency of the proposed direct-sensing approach.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"10 ","pages":"889-894"},"PeriodicalIF":1.9,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148485672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Verifiable Error Bounds for Physics-Informed Neural Network Solutions of Lyapunov and Hamilton–Jacobi–Bellman Equations","authors":"Jun Liu","doi":"10.1109/LCSYS.2026.3696322","DOIUrl":"https://doi.org/10.1109/LCSYS.2026.3696322","url":null,"abstract":"Many core problems in nonlinear systems analysis and control can be recast as solving partial differential equations (PDEs) such as Lyapunov and Hamilton–Jacobi–Bellman (HJB) equations. Physics-informed neural networks (PINNs) have emerged as a promising mesh-free approach for approximating their solutions, but in most existing works there is no rigorous guarantee that a small PDE residual implies a small solution error. This letter develops verifiable error bounds for approximate solutions of Lyapunov and HJB equations, with particular emphasis on PINN-based approximations. For both the Lyapunov and HJB PDEs, we show that a verifiable residual bound yields relative error bounds with respect to the true solutions as well as computable <italic>a posteriori</i> estimates in terms of the approximate solutions. For the HJB equation, this also yields certified upper and lower bounds on the optimal value function on compact sublevel sets and quantifies the optimality gap of the induced feedback policy. We further show that one-sided residual bounds already imply that the approximation is a valid Lyapunov or control Lyapunov function. We illustrate the results with numerical examples.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"10 ","pages":"403-408"},"PeriodicalIF":1.9,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148485775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Risk-Aware Rulebooks for Multi-Objective Trajectory Evaluation Under Uncertainty","authors":"Tichakorn Wongpiromsarn","doi":"10.1109/LCSYS.2026.3696351","DOIUrl":"https://doi.org/10.1109/LCSYS.2026.3696351","url":null,"abstract":"We present a risk-aware formalism for evaluating system trajectories in the presence of uncertain interactions between the system and its environment. The proposed formalism supports reasoning under uncertainty and systematically handles complex relationships among requirements and objectives, including hierarchical priorities and non-comparability. Rather than treating the environment as exogenous noise, we explicitly model how each system trajectory influences the environment and evaluate trajectories under the resulting distribution of environment responses. We prove that the formalism induces a preorder on the set of system trajectories, ensuring consistency and preventing cyclic preferences. Finally, we illustrate the approach with an autonomous driving example that demonstrates how the formalism enhances explainability by clarifying the rationale behind trajectory selection.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"10 ","pages":"397-402"},"PeriodicalIF":1.9,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148485778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}