{"title":"Optimal Balancing of Tropical Discrete-Event Systems Through Feedback Control","authors":"C. A. Maia","doi":"10.1109/LCSYS.2025.3586634","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3586634","url":null,"abstract":"Dynamical Tropical systems are described by means of Tropical Algebra (for instance, Min- or Max-plus ones), which is a kind of idempotent semifield. For such systems, we are interested in the study of general algebraic properties ensuring optimal balancing through feedback control. By balancing, we mean that all events, or transitions, occur at the same rate, meaning that there is no sub-product accumulation inside the system. In this context, after formulating the problem for Tropical Semifields, the first result is the development, thanks to Residuation Theory, of the expression of the maximum feedback matrix expressed in terms of a vector parameter, ensuring that the closed-loop matrix has a desired eigenvalue. Under the assumption of controllability and boundedness of the controllability matrix, we develop a method to properly choose this maximum feedback matrix. In order to illustrate the method, we present a solution for the problem of balancing two unconnected networks by means of feedback control.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"9 ","pages":"1742-1747"},"PeriodicalIF":2.4,"publicationDate":"2025-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144663716","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}
Pol Baldomà-Mitjans;Andreu Cecilia;Giacomo Casadei;Daniele Astolfi;Vicenç Puig
{"title":"A Masking Protocol for Nonlinear and Incrementally Passive Average Consensus Algorithms","authors":"Pol Baldomà-Mitjans;Andreu Cecilia;Giacomo Casadei;Daniele Astolfi;Vicenç Puig","doi":"10.1109/LCSYS.2025.3585996","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3585996","url":null,"abstract":"This letter introduces a masking protocol to enhance the security of a consensus protocol for nonlinear multi-agent systems. The proposed approach involves adding a masking signal to each agent’s output and applying a de-masking filter at the receiving agent. We establish sufficient conditions to ensure that the proposed security protocol preserves output consensus. Furthermore, numerical simulations demonstrate its effectiveness in preventing eavesdropping and false data injection attacks.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"9 ","pages":"1928-1933"},"PeriodicalIF":2.0,"publicationDate":"2025-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144725234","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":"Transient Performance of MPC for Tracking Without Terminal Constraints","authors":"Nadine Ehmann;Matthias Köhler;Frank Allgöwer","doi":"10.1109/LCSYS.2025.3585945","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3585945","url":null,"abstract":"Model predictive control (MPC) for tracking is a recently introduced approach, which extends standard MPC formulations by incorporating an artificial reference as an additional optimization variable, in order to track external and potentially time-varying references. In this letter, we analyze the performance of such an MPC for tracking scheme without a terminal cost and terminal constraints. We derive a transient performance estimate, i.e., a bound on the closed-loop performance over an arbitrary time interval, yielding insights on how to select the scheme’s parameters for performance. Furthermore, we show that in the asymptotic case, where the prediction horizon and observed time interval tend to infinity, the closed-loop solution of MPC for tracking recovers the infinite horizon optimal solution.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"9 ","pages":"2049-2054"},"PeriodicalIF":2.0,"publicationDate":"2025-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144831777","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":"All Data-Driven LQR Algorithms Require at Least as Much Interval Data as System Identification","authors":"Christopher Song;Jun Liu","doi":"10.1109/LCSYS.2025.3586080","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3586080","url":null,"abstract":"We show that algorithms for solving continuous-time infinite-horizon LQR problems using input and state data on intervals require at least as much data as system identification. Using this result, we show that the map from interval data to the optimal gain defined by these algorithms is continuous. We then obtain a convergence criterion that allows us to approximate the optimal gain by using sampled data in place of interval data. In doing so, we uncover a connection with the theory of numerical integration. We corroborate our theoretical results with some numerical experiments, which show how judicious selection of sample points can significantly improve the accuracy of the approximation.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"9 ","pages":"1778-1783"},"PeriodicalIF":2.4,"publicationDate":"2025-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144680904","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}
Jonah J. Glunt;Joshua A. Robbins;Jacob A. Siefert;Daniel Silvestre;Herschel C. Pangborn
{"title":"Sharp Hybrid Zonotopes: Set Operations and the Reformulation-Linearization Technique","authors":"Jonah J. Glunt;Joshua A. Robbins;Jacob A. Siefert;Daniel Silvestre;Herschel C. Pangborn","doi":"10.1109/LCSYS.2025.3585953","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3585953","url":null,"abstract":"Mixed integer set representations, and specifically hybrid zonotopes, have enabled new techniques for reachability and verification of nonlinear and hybrid systems. Mixed-integer sets which have the property that their convex relaxation is equal to their convex hull are said to be sharp. This property allows the convex hull to be computed with minimal overhead, and is known to be important for improving the convergence rates of mixed-integer optimization algorithms that rely on convex relaxations. This letter examines methods for formulating sharp hybrid zonotopes and provides sharpness-preserving methods for performing several key set operations. This letter then shows how the reformulation-linearization technique can be applied to create a sharp realization of a hybrid zonotope that is initially not sharp. A numerical example applies this technique to find the convex hull of a level set of a feedforward ReLU neural network.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"9 ","pages":"1802-1807"},"PeriodicalIF":2.4,"publicationDate":"2025-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144671220","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":"Event-Triggered Predefined-Time Distributed Optimization for Second-Order Multiagent Systems via Sliding Mode","authors":"Tao Jiang;Yan Yan;Shuanghe Yu;Ge Guo;Yi Liu","doi":"10.1109/LCSYS.2025.3585954","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3585954","url":null,"abstract":"In this letter, the predefined-time distributed robust optimization is studied for disturbed second-order multiagent systems under the event-triggering mechanism. To this end, a sliding mode-based hierarchical control scheme is presented. In the first part, a local reference output signal with predefined-time convergence is generated by the proposed time-varying functions (TVFs)-based event-triggered local-minimization-free zero-gradient-sum (LMFZGS) algorithm and evolves to the global cost function’s minimizer. In the second part, a TVFs-based predefined-time sliding mode tracking controller is designed to drive the agents’ outputs to track the local reference output, regardless of lumped disturbances. By this scheme, all agents’ outputs can reach the global minimizer, characterized by predefined-time convergence, with only the virtual output signal required to be shared among agents. Simulation results demonstrate the effectiveness of our scheme.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"9 ","pages":"1904-1909"},"PeriodicalIF":2.0,"publicationDate":"2025-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144725192","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":"Control Synthesis in Partially Observable Environments for Complex Perception-Related Objectives","authors":"Zetong Xuan;Yu Wang","doi":"10.1109/LCSYS.2025.3585819","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3585819","url":null,"abstract":"Perception-related tasks often arise in autonomous systems operating under partial observability. This letter studies the problem of synthesizing optimal policies for complex perception-related objectives in environments modeled by partially observable Markov decision processes. To formally specify such objectives, we introduce co-safe linear inequality temporal logic (sc-iLTL), which can define complex tasks that are formed by the logical concatenation of atomic propositions as linear inequalities on the belief space of the POMDPs. Our solution to the control synthesis problem is to transform the sc-iLTL objectives into reachability objectives by constructing the product of the belief MDP and a deterministic finite automaton built from the sc-iLTL objective. To overcome the scalability challenge due to the product, we introduce a Monte Carlo Tree Search (MCTS) method that converges in probability to the optimal policy. Finally, a drone-probing case study demonstrates the applicability of our method.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"9 ","pages":"1724-1729"},"PeriodicalIF":2.4,"publicationDate":"2025-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144663713","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":"Data-Driven Optimization-Based Cost and Optimal Control Inference","authors":"Jiacheng Wu;Wenqian Xue;Frank L. Lewis;Bosen Lian","doi":"10.1109/LCSYS.2025.3584907","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3584907","url":null,"abstract":"This letter develops a novel optimization-based inverse reinforcement learning (RL) control algorithm that infers the minimal cost from observed demonstrations via optimization-based policy evaluation and update. The core idea is the simultaneous evaluation of the value function matrix and cost weight during policy evaluation under a given control policy, which simplifies the algorithmic structure and reduces the iterations required for convergence. Based on this idea, we first develop a model-based algorithm with detailed implementation steps, and analyze the monotonicity and convergence properties of the cost weight. Then, based on Willems’ lemma, we develop a data-driven algorithm to learn an equivalent weight matrix from persistently excited (PE) data. We also prove the convergence of the data-driven algorithm and show that the converged results learned from PE data are unbiased. Finally, simulations on a power system are carried out to demonstrate the effectiveness of the proposed inverse RL algorithm.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"9 ","pages":"1700-1705"},"PeriodicalIF":2.4,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144646447","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}
Jonas Mair;Lukas Schwenkel;Matthias A. Müller;Frank Allgöwer
{"title":"The Cesàro Value Iteration","authors":"Jonas Mair;Lukas Schwenkel;Matthias A. Müller;Frank Allgöwer","doi":"10.1109/LCSYS.2025.3584792","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3584792","url":null,"abstract":"In this letter, we consider undiscouted infinite-horizon optimal control for deterministic systems with an uncountable state and input space. We specifically address the case when the classic value iteration does not converge. For such systems, we use the Cesàro mean to define the infinite-horizon optimal control problem and the corresponding infinite-horizon value function. Moreover, for this value function, we introduce the Cesàro value iteration and prove its convergence for the special case of systems with periodic optimal operating behavior. For this instance, we also show that the Cesàro value function recovers the undiscounted infinite-horizon optimal cost, if the latter is well-defined.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"9 ","pages":"1934-1939"},"PeriodicalIF":2.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144725310","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}