Pub Date : 2025-12-19DOI: 10.1016/j.automatica.2025.112795
Alexander Yu. Pogromsky , Alexey S. Matveev
This paper addresses the problem of robust remote state estimation for uncertain nonlinear discrete-time systems when sensor data are transmitted through a digital communication channel of finite bit-rate capacity. The goal is to determine the minimal channel rate required to guarantee a prescribed estimation accuracy in the presence of bounded model uncertainty. We derive an explicit, tractable lower bound on the channel bit rate that ensures this accuracy for any admissible uncertainty level. The bound highlights the fundamental role of the accuracy-to-uncertainty ratio in remote estimation. The analysis relies on a quadratic dissipation inequality describing system uncertainty within the framework of incremental input-to-state stability, leading to a constructive Lyapunov-based characterization. The proposed conditions admit a closed-form analytical expression for a class of systems, including the uncertain Lozi map, which serves as an illustrative example.
{"title":"Remote robust state estimation for nonlinear systems","authors":"Alexander Yu. Pogromsky , Alexey S. Matveev","doi":"10.1016/j.automatica.2025.112795","DOIUrl":"10.1016/j.automatica.2025.112795","url":null,"abstract":"<div><div>This paper addresses the problem of robust remote state estimation for uncertain nonlinear discrete-time systems when sensor data are transmitted through a digital communication channel of finite bit-rate capacity. The goal is to determine the minimal channel rate required to guarantee a prescribed estimation accuracy in the presence of bounded model uncertainty. We derive an explicit, tractable lower bound on the channel bit rate that ensures this accuracy for any admissible uncertainty level. The bound highlights the fundamental role of the accuracy-to-uncertainty ratio in remote estimation. The analysis relies on a quadratic dissipation inequality describing system uncertainty within the framework of incremental input-to-state stability, leading to a constructive Lyapunov-based characterization. The proposed conditions admit a closed-form analytical expression for a class of systems, including the uncertain Lozi map, which serves as an illustrative example.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112795"},"PeriodicalIF":5.9,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145784445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
On-orbit useful lifetime is a critical metric for spacecraft missions, for which we propose a maximum-system-reliability control allocation scheme for spacecraft with redundant actuators. The dynamic reliability model for the redundant actuator system is formulated, incorporating an online parameter estimation method initialized with offline estimates. On this basis, we define a control allocation optimization problem that maximizes the one-step system reliability prediction. To enable efficient online computation, a recursive optimization algorithm is introduced. Theoretical analysis proves that the proposed approach can extend the useful lifetime of the redundant actuator system with any failure mode. A comparative example of spacecraft attitude stabilization validates the feasibility, generality, and superiority of the proposed method.
{"title":"Maximum-system-reliability control allocation for spacecraft with redundant actuators","authors":"Jianchun Zhang , Xiang Yu , Jianzhong Qiao , Lei Guo","doi":"10.1016/j.automatica.2025.112779","DOIUrl":"10.1016/j.automatica.2025.112779","url":null,"abstract":"<div><div>On-orbit useful lifetime is a critical metric for spacecraft missions, for which we propose a maximum-system-reliability control allocation scheme for spacecraft with redundant actuators. The dynamic reliability model for the redundant actuator system is formulated, incorporating an online parameter estimation method initialized with offline estimates. On this basis, we define a control allocation optimization problem that maximizes the one-step system reliability prediction. To enable efficient online computation, a recursive optimization algorithm is introduced. Theoretical analysis proves that the proposed approach can extend the useful lifetime of the redundant actuator system with any failure mode. A comparative example of spacecraft attitude stabilization validates the feasibility, generality, and superiority of the proposed method.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112779"},"PeriodicalIF":5.9,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145799110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-19DOI: 10.1016/j.automatica.2025.112772
Juntao Li , Cong Liang , Deyuan Meng
Designing superior distributed algorithms for solving linear algebraic equations (LAEs) plays a crucial role in engineering and computer science fields. This paper proposes two discrete distributed algorithms for solving LAEs from the perspective of optimal control. By benefiting from the devised error system and constructed performance index, the presented algorithms can converge R-linearly to a solution of LAEs without solving algebraic Riccati equations. In particular, the full-row rank requirements on sub-matrices are eliminated in row partitioning framework. Moreover, the need for communication exchange among all agents within the same cluster is alleviated, and only one state variable is updated in the row-wise arbitrary column partitioning framework. Simulation results demonstrate that the proposed distributed algorithms outperform non-optimal control design algorithms in terms of convergence performance.
{"title":"Distributed algorithms for solving linear algebraic equations: An optimal control perspective","authors":"Juntao Li , Cong Liang , Deyuan Meng","doi":"10.1016/j.automatica.2025.112772","DOIUrl":"10.1016/j.automatica.2025.112772","url":null,"abstract":"<div><div>Designing superior distributed algorithms for solving linear algebraic equations (LAEs) plays a crucial role in engineering and computer science fields. This paper proposes two discrete distributed algorithms for solving LAEs from the perspective of optimal control. By benefiting from the devised error system and constructed performance index, the presented algorithms can converge R-linearly to a solution of LAEs without solving algebraic Riccati equations. In particular, the full-row rank requirements on sub-matrices are eliminated in row partitioning framework. Moreover, the need for communication exchange among all agents within the same cluster is alleviated, and only one state variable is updated in the row-wise arbitrary column partitioning framework. Simulation results demonstrate that the proposed distributed algorithms outperform non-optimal control design algorithms in terms of convergence performance.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112772"},"PeriodicalIF":5.9,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145799603","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-19DOI: 10.1016/j.automatica.2025.112790
Julian D. Schiller, Matthias A. Müller
We propose a moving horizon estimation scheme to estimate the states and the unknown constant parameters of general nonlinear uncertain discrete-time systems. The proposed framework and analysis explicitly do not involve the a priori verification of a particular excitation condition for the parameters. Instead, we use online information about the actual excitation of the parameters at any time during operation and ensure that the regularization term in the cost function is always automatically selected appropriately. This ensures that the state and parameter estimation error is bounded for all times, even if the parameters are never (or only rarely) excited during operation. Robust exponential stability of the state and parameter estimation error emerges under an additional uniform condition on the maximum duration of insufficient excitation. The theoretical results are illustrated by a numerical example.
{"title":"Nonlinear moving horizon estimation for robust state and parameter estimation","authors":"Julian D. Schiller, Matthias A. Müller","doi":"10.1016/j.automatica.2025.112790","DOIUrl":"10.1016/j.automatica.2025.112790","url":null,"abstract":"<div><div>We propose a moving horizon estimation scheme to estimate the states and the unknown constant parameters of general nonlinear uncertain discrete-time systems. The proposed framework and analysis explicitly do not involve the <em>a priori</em> verification of a particular excitation condition for the parameters. Instead, we use online information about the actual excitation of the parameters at any time during operation and ensure that the regularization term in the cost function is always automatically selected appropriately. This ensures that the state and parameter estimation error is bounded for all times, even if the parameters are never (or only rarely) excited during operation. Robust exponential stability of the state and parameter estimation error emerges under an additional uniform condition on the maximum duration of insufficient excitation. The theoretical results are illustrated by a numerical example.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112790"},"PeriodicalIF":5.9,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145784443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-19DOI: 10.1016/j.automatica.2025.112791
Zhenhua Deng, Cong Liu
This paper studies constrained noncooperative games (NGs), which take the general linear dynamics of players into account. In the formulation, each player has local convex set constraints, and all players are restricted by coupling nonlinear inequality constraints. Notably, the majority of existing results for NGs with physical systems do not involve local constraints, let alone general convex sets. Besides, nearly all of related results cannot guarantee local constraints to be satisfied all the time, because physical players cannot control their decisions directly due to system dynamics. Here we develop a distributed adaptive strategy on the basis of gradient descent, projection operators, primal–dual methods and state feedback. The strategy is fully distributed. We analyze the strategy via variational analysis and Lyapunov theory. With our strategy, the players seek the exact variational generalized Nash equilibrium (v-GNE), and always satisfy local constraints, in contrast to existing results. Lastly, our method is applied to the electricity market games of doubly-fed induction generators.
{"title":"Distributed local-constraint-satisfied strategy for noncooperative games of autonomous general linear players and its application to smart grids","authors":"Zhenhua Deng, Cong Liu","doi":"10.1016/j.automatica.2025.112791","DOIUrl":"10.1016/j.automatica.2025.112791","url":null,"abstract":"<div><div>This paper studies constrained noncooperative games (NGs), which take the general linear dynamics of players into account. In the formulation, each player has local convex set constraints, and all players are restricted by coupling nonlinear inequality constraints. Notably, the majority of existing results for NGs with physical systems do not involve local constraints, let alone general convex sets. Besides, nearly all of related results cannot guarantee local constraints to be satisfied all the time, because physical players cannot control their decisions directly due to system dynamics. Here we develop a distributed adaptive strategy on the basis of gradient descent, projection operators, primal–dual methods and state feedback. The strategy is fully distributed. We analyze the strategy via variational analysis and Lyapunov theory. With our strategy, the players seek the exact variational generalized Nash equilibrium (v-GNE), and always satisfy local constraints, in contrast to existing results. Lastly, our method is applied to the electricity market games of doubly-fed induction generators.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112791"},"PeriodicalIF":5.9,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145784447","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-19DOI: 10.1016/j.automatica.2025.112782
Liwei An , Can Zhao , Guang-Hong Yang
This paper studies the problem of adaptive tracking control for nonlinear strict-feedback systems with parametric uncertainties and safety constraints. A co-design strategy of control barrier functions (CBFs) and barrier Lyapunov functions (BLFs) is proposed, which inherits the robustness and stability of traditional adaptive backstepping controllers. First, a safe virtual control signal is generated by the CBF-induced quadratic programming (QP), which is the suboptimal and smooth solution of the QP with a shifting function. Then, a BLF-based backstepping controller is designed by following the safe virtual control signal. It is shown that the co-design can minimize the damage to the original tracking performance on the premise of safety guarantees. The distinguishing point of the safety design over the existing results is to avoid constructing the high-order CBFs that lead to conservative feasible sets of inputs for ensuring high-relative-degree safety constraints. The simulation results show that the proposed scheme achieves better tracking performance compared with the existing high-order CBF-based method.
{"title":"CBF-based safety design for adaptive control of uncertain nonlinear strict-feedback systems","authors":"Liwei An , Can Zhao , Guang-Hong Yang","doi":"10.1016/j.automatica.2025.112782","DOIUrl":"10.1016/j.automatica.2025.112782","url":null,"abstract":"<div><div>This paper studies the problem of adaptive tracking control for nonlinear strict-feedback systems with parametric uncertainties and safety constraints. A co-design strategy of control barrier functions (CBFs) and barrier Lyapunov functions (BLFs) is proposed, which inherits the robustness and stability of traditional adaptive backstepping controllers. First, a safe virtual control signal is generated by the CBF-induced quadratic programming (QP), which is the suboptimal and smooth solution of the QP with a shifting function. Then, a BLF-based backstepping controller is designed by following the safe virtual control signal. It is shown that the co-design can minimize the damage to the original tracking performance on the premise of safety guarantees. The distinguishing point of the safety design over the existing results is to avoid constructing the high-order CBFs that lead to conservative feasible sets of inputs for ensuring high-relative-degree safety constraints. The simulation results show that the proposed scheme achieves better tracking performance compared with the existing high-order CBF-based method.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112782"},"PeriodicalIF":5.9,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145799183","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-19DOI: 10.1016/j.automatica.2025.112758
Kaiyun Xie , Junlin Xiong
This paper investigates the existence and computability of the stationary Stackelberg equilibrium (SSE) in two-person zero-sum stochastic Stackelberg games (SSGs). First, an operator-based approach is developed to illustrate that such games admit a fixed-point equilibrium (FPE). It is further proven that the FPE strategy pair constitutes an SSE. Building on this foundation, a value iteration (VI) algorithm is proposed to compute the SSE strategies. However, due to the curse of dimensionality, the exact computation of SSE strategies involves high computational complexity. To address this issue, an -sacrifice strategy is introduced to approximate the leader’s SSE strategy by performing finite iterations, with the degree of approximation quantified by . The relationship between and the number of iterations is established, ensuring a trade-off between computational efficiency and strategic performance. An information flow control example demonstrates the efficiency of the designed strategies.
{"title":"Stationary Stackelberg equilibrium in two-person zero-sum stochastic Stackelberg games","authors":"Kaiyun Xie , Junlin Xiong","doi":"10.1016/j.automatica.2025.112758","DOIUrl":"10.1016/j.automatica.2025.112758","url":null,"abstract":"<div><div>This paper investigates the existence and computability of the stationary Stackelberg equilibrium (SSE) in two-person zero-sum stochastic Stackelberg games (SSGs). First, an operator-based approach is developed to illustrate that such games admit a fixed-point equilibrium (FPE). It is further proven that the FPE strategy pair constitutes an SSE. Building on this foundation, a value iteration (VI) algorithm is proposed to compute the SSE strategies. However, due to the curse of dimensionality, the exact computation of SSE strategies involves high computational complexity. To address this issue, an <span><math><mi>ϵ</mi></math></span>-sacrifice strategy is introduced to approximate the leader’s SSE strategy by performing finite iterations, with the degree of approximation quantified by <span><math><mi>ϵ</mi></math></span>. The relationship between <span><math><mi>ϵ</mi></math></span> and the number of iterations <span><math><mi>n</mi></math></span> is established, ensuring a trade-off between computational efficiency and strategic performance. An information flow control example demonstrates the efficiency of the designed strategies.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112758"},"PeriodicalIF":5.9,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145799602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-19DOI: 10.1016/j.automatica.2025.112794
Ming Li , Zhaojian Wang , Mengshuo Jia , Feng Liu , Bo Yang , Xinping Guan
In this paper, we propose a distributed feedback controller to steer a multi-agent dynamical system to the generalized Nash equilibrium (GNE) for an aggregative game with only a monotone pseudo-gradient. First, a monotone aggregative game among the agents is formulated, which considers operational constraints in both the transient process and the steady state. Then, a distributed controller based on primal–dual gradient dynamics is designed for each agent to steer the system to track the GNE of the predefined game autonomously. The controller relaxes the requirement of the strictly/strongly monotone pseudo-gradient. At the same time, the hard limits of the control input are satisfied both at equilibrium and during the transient process. We further prove that the closed-loop system is asymptotically stable and its equilibrium attains the GNE. Finally, a practical example of frequency control on IEEE 68-bus system verifies the effectiveness of the proposed method.
{"title":"Distributed control to steer dynamical systems to the generalized Nash equilibria for monotone aggregative games with operational constraints","authors":"Ming Li , Zhaojian Wang , Mengshuo Jia , Feng Liu , Bo Yang , Xinping Guan","doi":"10.1016/j.automatica.2025.112794","DOIUrl":"10.1016/j.automatica.2025.112794","url":null,"abstract":"<div><div>In this paper, we propose a distributed feedback controller to steer a multi-agent dynamical system to the generalized Nash equilibrium (GNE) for an aggregative game with only a monotone pseudo-gradient. First, a monotone aggregative game among the agents is formulated, which considers operational constraints in both the transient process and the steady state. Then, a distributed controller based on primal–dual gradient dynamics is designed for each agent to steer the system to track the GNE of the predefined game autonomously. The controller relaxes the requirement of the strictly/strongly monotone pseudo-gradient. At the same time, the hard limits of the control input are satisfied both at equilibrium and during the transient process. We further prove that the closed-loop system is asymptotically stable and its equilibrium attains the GNE. Finally, a practical example of frequency control on IEEE 68-bus system verifies the effectiveness of the proposed method.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112794"},"PeriodicalIF":5.9,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145799647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-19DOI: 10.1016/j.automatica.2025.112756
Ali Wadi, Kyriakos G. Vamvoudakis
In this paper, we introduce a trajectory-informed machine learning framework to address the infinite-horizon optimal control problem for uncertain quantum-mechanical systems. Our approach is inspired by physics-informed neural networks (PINNs), but is based on trajectories rather than points. Moreover, our methodology does not require knowledge of the drift term of the system’s dynamics. It also uses a finite-horizon formulation for the quantum optimal control (QOC) problem that can guarantee a unique solution to the derived Hamilton–Jacobi–Bellman (HJB) equation, which is currently not achievable with traditional PINNs. We finally provide a rigorous mathematical justification, demonstrating that the solution uniformly converges and approximates the infinite-horizon HJB for a sufficiently large finite horizon. We have validated our proposed QOC approach through simulations on the spin- particle quantum system.
{"title":"Trajectory-informed machine learning for quantum optimal control of uncertain systems","authors":"Ali Wadi, Kyriakos G. Vamvoudakis","doi":"10.1016/j.automatica.2025.112756","DOIUrl":"10.1016/j.automatica.2025.112756","url":null,"abstract":"<div><div>In this paper, we introduce a trajectory-informed machine learning framework to address the infinite-horizon optimal control problem for uncertain quantum-mechanical systems. Our approach is inspired by physics-informed neural networks (PINNs), but is based on trajectories rather than points. Moreover, our methodology does not require knowledge of the drift term of the system’s dynamics. It also uses a finite-horizon formulation for the quantum optimal control (QOC) problem that can guarantee a unique solution to the derived Hamilton–Jacobi–Bellman (HJB) equation, which is currently not achievable with traditional PINNs. We finally provide a rigorous mathematical justification, demonstrating that the solution uniformly converges and approximates the infinite-horizon HJB for a sufficiently large finite horizon. We have validated our proposed QOC approach through simulations on the spin-<span><math><mrow><mn>1</mn><mo>/</mo><mn>2</mn></mrow></math></span> particle quantum system.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112756"},"PeriodicalIF":5.9,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145784444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-19DOI: 10.1016/j.automatica.2025.112778
David Angeli , Davide Martini , Giacomo Innocenti , Alberto Tesi
In this paper a non-invasive approach to chaos control based on -Contraction Theory is developed. Specifically, some recent results on 2-contractive nonlinear systems are suitably extended to design a feedback controller capable to remove attractors with positive Lyapunov exponents of the open loop system, without altering the equilibrium points. First, 2-contraction stabilizability of linear control systems is discussed, showing that it can be checked by solving some linear matrix inequalities. Then, a novel technique based on 2-contraction stabilizability is devised for computing the gain matrix of a derivative feedback controller ensuring that the controlled system has the same equilibrium points of the uncontrolled one but no longer displays attractors with positive Lyapunov exponents. Finally, the classical Lorenz system is employed to illustrate the features of the proposed technique.
{"title":"Non-invasive chaos control based on 2-contraction stabilizability","authors":"David Angeli , Davide Martini , Giacomo Innocenti , Alberto Tesi","doi":"10.1016/j.automatica.2025.112778","DOIUrl":"10.1016/j.automatica.2025.112778","url":null,"abstract":"<div><div>In this paper a non-invasive approach to chaos control based on <span><math><mi>k</mi></math></span>-Contraction Theory is developed. Specifically, some recent results on 2-contractive nonlinear systems are suitably extended to design a feedback controller capable to remove attractors with positive Lyapunov exponents of the open loop system, without altering the equilibrium points. First, 2-contraction stabilizability of linear control systems is discussed, showing that it can be checked by solving some linear matrix inequalities. Then, a novel technique based on 2-contraction stabilizability is devised for computing the gain matrix of a derivative feedback controller ensuring that the controlled system has the same equilibrium points of the uncontrolled one but no longer displays attractors with positive Lyapunov exponents. Finally, the classical Lorenz system is employed to illustrate the features of the proposed technique.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112778"},"PeriodicalIF":5.9,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145799189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}