Pub Date : 2026-04-01Epub Date: 2026-02-06DOI: 10.1016/j.automatica.2026.112865
Xiaoyu Li , Yuhu Wu , Simone Fiori , Lining Ru
In this paper, we investigate the finite-time flocking problem for the multi-agent system on the infinite cylinder. We first generalize the finite-time flocking Cucker–Smale model from Euclidean space to the infinite cylinder by exploiting the Lie group structure of . We then analyze the emergent behavior of the proposed model and provide a sufficient condition for finite-time flocking. It is shown that the emergence of such behavior critically depends on the parameter in the interaction weight function of the Cucker–Smale model. In particular, finite-time flocking occurs for , while conditional flocking occurs for . Moreover, an upper bound on the convergence time is derived in terms of system parameters and initial states.
{"title":"Finite-time flocking behavior of the Cucker–Smale model on the infinite cylinder","authors":"Xiaoyu Li , Yuhu Wu , Simone Fiori , Lining Ru","doi":"10.1016/j.automatica.2026.112865","DOIUrl":"10.1016/j.automatica.2026.112865","url":null,"abstract":"<div><div>In this paper, we investigate the finite-time flocking problem for the multi-agent system on the infinite cylinder. We first generalize the finite-time flocking Cucker–Smale model from Euclidean space to the infinite cylinder <span><math><mrow><msup><mrow><mi>S</mi></mrow><mrow><mn>1</mn></mrow></msup><mo>×</mo><mi>R</mi></mrow></math></span> by exploiting the Lie group structure of <span><math><mrow><msup><mrow><mi>S</mi></mrow><mrow><mn>1</mn></mrow></msup><mo>×</mo><mi>R</mi></mrow></math></span>. We then analyze the emergent behavior of the proposed model and provide a sufficient condition for finite-time flocking. It is shown that the emergence of such behavior critically depends on the parameter <span><math><mi>β</mi></math></span> in the interaction weight function of the Cucker–Smale model. In particular, finite-time flocking occurs for <span><math><mrow><mi>β</mi><mo>≤</mo><mfrac><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></mrow></math></span>, while conditional flocking occurs for <span><math><mrow><mi>β</mi><mo>></mo><mfrac><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></mrow></math></span>. Moreover, an upper bound on the convergence time is derived in terms of system parameters and initial states.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112865"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146134384","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 : 2026-04-01Epub Date: 2026-02-05DOI: 10.1016/j.automatica.2026.112857
Pavel Osinenko , Grigory Yaremenko
In this brief note, we investigate some constructions of Lyapunov functions for stochastic discrete-time stabilizable dynamical systems, in other words, controlled Markov chains. The main question here is whether a Lyapunov function in some statistical sense exists if the respective controlled Markov chain admits a stabilizing policy. We demonstrate some constructions extending on the classical results for deterministic systems. Some limitations of the constructed Lyapunov functions for stabilization are discussed, particularly for stabilization in mean. Although results for deterministic systems are well known, the stochastic case was addressed in less detail, which the current paper remarks on. A distinguishable feature of this work is the study of stabilizers that possess computationally tractable convergence certificates.
{"title":"Some remarks on stochastic converse Lyapunov theorems","authors":"Pavel Osinenko , Grigory Yaremenko","doi":"10.1016/j.automatica.2026.112857","DOIUrl":"10.1016/j.automatica.2026.112857","url":null,"abstract":"<div><div>In this brief note, we investigate some constructions of Lyapunov functions for stochastic discrete-time stabilizable dynamical systems, in other words, controlled Markov chains. The main question here is whether a Lyapunov function in some statistical sense exists if the respective controlled Markov chain admits a stabilizing policy. We demonstrate some constructions extending on the classical results for deterministic systems. Some limitations of the constructed Lyapunov functions for stabilization are discussed, particularly for stabilization in mean. Although results for deterministic systems are well known, the stochastic case was addressed in less detail, which the current paper remarks on. A distinguishable feature of this work is the study of stabilizers that possess computationally tractable convergence certificates.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112857"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146134389","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 : 2026-04-01Epub Date: 2026-02-05DOI: 10.1016/j.automatica.2026.112867
Sébastien Fueyo, Carlos Canudas de Wit
This paper addresses the stabilization of traffic flow using a control strategy for autonomous vehicles. While previous approaches have stabilized traffic near equilibrium states, the proposed method extends this to time-varying density and velocity profiles. The strategy modulates vehicle accelerations based on a continuation-based framework, which is applied to macroscopic traffic models on ring-roads. A key feature of the method is its ability to adapt to various intervehicle connectivity structures, which depend on the communication capabilities between vehicles, allowing it to handle complex traffic scenarios with varying connectivity patterns. The main contributions include (i) deriving a macroscopic control model from a second-order microscopic framework, and (ii) proposing a general procedure to synthesize control inputs that guide traffic toward time-varying target profiles, offering a flexible approach for real-world traffic conditions.
{"title":"Continuum control design for traffic flow stabilization on circular roads: A microscopic–macroscopic approach","authors":"Sébastien Fueyo, Carlos Canudas de Wit","doi":"10.1016/j.automatica.2026.112867","DOIUrl":"10.1016/j.automatica.2026.112867","url":null,"abstract":"<div><div>This paper addresses the stabilization of traffic flow using a control strategy for autonomous vehicles. While previous approaches have stabilized traffic near equilibrium states, the proposed method extends this to time-varying density and velocity profiles. The strategy modulates vehicle accelerations based on a continuation-based framework, which is applied to macroscopic traffic models on ring-roads. A key feature of the method is its ability to adapt to various intervehicle connectivity structures, which depend on the communication capabilities between vehicles, allowing it to handle complex traffic scenarios with varying connectivity patterns. The main contributions include (i) deriving a macroscopic control model from a second-order microscopic framework, and (ii) proposing a general procedure to synthesize control inputs that guide traffic toward time-varying target profiles, offering a flexible approach for real-world traffic conditions.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112867"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146134390","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 : 2026-04-01Epub Date: 2026-01-16DOI: 10.1016/j.automatica.2026.112826
Adrian P. Kennedy , Ashutosh Prasad , Suresh P. Sethi , Chi Chung Siu , Sheung Chi Phillip Yam
This paper studies the optimal advertising policy over the product life cycle of a semi-durable good whose failure rate is a design decision. The product’s adoption process draws from three sources of consumers, viz., innovators who find the product directly, consumers influenced by advertising, and loyal customers making replacements. The revenue stream is composed of the sales of new products, maintenance fees, and replacement sales. We propose a product diffusion model with both durable and non-durable properties and solve it using optimal control. The guidelines for advertising during new product diffusion are simple to implement due to explicit solutions. We make recommendations for the design of product durability and observe cases where higher failure rates are optimal. Finally, we extend our analysis to a game-theoretic framework, showcasing that the optimal advertising decisions remain tractable even in the context of competing manufacturers.
{"title":"Optimal advertising and product durability decisions in new product diffusion","authors":"Adrian P. Kennedy , Ashutosh Prasad , Suresh P. Sethi , Chi Chung Siu , Sheung Chi Phillip Yam","doi":"10.1016/j.automatica.2026.112826","DOIUrl":"10.1016/j.automatica.2026.112826","url":null,"abstract":"<div><div>This paper studies the optimal advertising policy over the product life cycle of a semi-durable good whose failure rate is a design decision. The product’s adoption process draws from three sources of consumers, viz., innovators who find the product directly, consumers influenced by advertising, and loyal customers making replacements. The revenue stream is composed of the sales of new products, maintenance fees, and replacement sales. We propose a product diffusion model with both durable and non-durable properties and solve it using optimal control. The guidelines for advertising during new product diffusion are simple to implement due to explicit solutions. We make recommendations for the design of product durability and observe cases where higher failure rates are optimal. Finally, we extend our analysis to a game-theoretic framework, showcasing that the optimal advertising decisions remain tractable even in the context of competing manufacturers.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112826"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145982057","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 : 2026-04-01Epub Date: 2026-01-14DOI: 10.1016/j.automatica.2026.112835
Yuxin Sun, Feng Xu
This paper proposes a new observer-based method suitable for both passive and active fault diagnosis in discrete linear time-invariant systems, developed from an optimization design perspective using state estimation sets. First, based on the output-consistent state sets explicitly expressed as the Minkowski sum of a constrained zonotope and a subspace, this paper establishes an equivalent interpretation of the fault diagnosis criterion using state estimation sets instead of traditional output estimation sets. This provides a novel state estimation set-based design perspective to enhance fault diagnosis. Second, this paper introduces a new quantitative metric named separation tendency that quantifies the geometric relationship between two constrained zonotopes. The observer gain for each mode is optimized to facilitate fault diagnosis by maximizing the separation tendency of the orthogonal projections of the two constructed state estimation sets of that mode. Third, a distinctive feature of our design method compared to existing approaches is that the design of observer gains does not depend on the current system input, enabling the design of inputs after that of observer gains without the counteracting effect on the inputs from the observer gains. At the end of this paper, numerical examples are used to illustrate the effectiveness of the proposed method.
{"title":"Observer-based passive/active fault diagnosis: A new optimization design perspective from state sets","authors":"Yuxin Sun, Feng Xu","doi":"10.1016/j.automatica.2026.112835","DOIUrl":"10.1016/j.automatica.2026.112835","url":null,"abstract":"<div><div>This paper proposes a new observer-based method suitable for both passive and active fault diagnosis in discrete linear time-invariant systems, developed from an optimization design perspective using state estimation sets. First, based on the output-consistent state sets explicitly expressed as the Minkowski sum of a constrained zonotope and a subspace, this paper establishes an equivalent interpretation of the fault diagnosis criterion using state estimation sets instead of traditional output estimation sets. This provides a novel state estimation set-based design perspective to enhance fault diagnosis. Second, this paper introduces a new quantitative metric named separation tendency that quantifies the geometric relationship between two constrained zonotopes. The observer gain for each mode is optimized to facilitate fault diagnosis by maximizing the separation tendency of the orthogonal projections of the two constructed state estimation sets of that mode. Third, a distinctive feature of our design method compared to existing approaches is that the design of observer gains does not depend on the current system input, enabling the design of inputs after that of observer gains without the counteracting effect on the inputs from the observer gains. At the end of this paper, numerical examples are used to illustrate the effectiveness of the proposed method.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112835"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145963136","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 : 2026-04-01Epub Date: 2026-02-04DOI: 10.1016/j.automatica.2026.112847
Dongyu Li , Shanyao Ren , Hanzhou Wang , Jianwei Liu , Shuzhi Sam Ge
Distributed average consensus plays a crucial role in multi-agent systems. In data-sensitive applications, agents need to exchange state without disclosing true privacy. To address this issue, homomorphic encryption and random perturbations-based schemes are commonly adopted privacy-preserving approaches. However, homomorphic encryption is typically limited to scenarios where agents’ state values are non-negative integers with substantial computational overhead. On the other hand, random perturbation-based schemes often require prior knowledge of the total number of agents, rendering them ineffective in dynamic environments or vulnerable against external eavesdroppers. Motivated by this, we propose an additive secret-sharing method based on multiplication operations to achieve consensus among agents. Specifically, we first introduce random perturbations and exponentiation to true states. Based on this, each agent’s true state is decomposed into secret shares, which are then transmitted over public channels. We design the scheme to enable fundamental operations to be executed in a distributed manner, thereby facilitating distributed average consensus. This solution resists attacks from both honest-but-curious and global eavesdropping agents, under the condition that each node is connected to at least one trusted node. In comparison with differential privacy solutions, our approach achieves consensus by an exact state value. Furthermore, it has a lighter resource consumption and broader applicability than homomorphic encryption schemes. Simulation results show the feasibility and security of our approach.
{"title":"Randomized average consensus based on additive privacy sharing","authors":"Dongyu Li , Shanyao Ren , Hanzhou Wang , Jianwei Liu , Shuzhi Sam Ge","doi":"10.1016/j.automatica.2026.112847","DOIUrl":"10.1016/j.automatica.2026.112847","url":null,"abstract":"<div><div>Distributed average consensus plays a crucial role in multi-agent systems. In data-sensitive applications, agents need to exchange state without disclosing true privacy. To address this issue, homomorphic encryption and random perturbations-based schemes are commonly adopted privacy-preserving approaches. However, homomorphic encryption is typically limited to scenarios where agents’ state values are non-negative integers with substantial computational overhead. On the other hand, random perturbation-based schemes often require prior knowledge of the total number of agents, rendering them ineffective in dynamic environments or vulnerable against external eavesdroppers. Motivated by this, we propose an additive secret-sharing method based on multiplication operations to achieve consensus among agents. Specifically, we first introduce random perturbations and exponentiation to true states. Based on this, each agent’s true state is decomposed into secret shares, which are then transmitted over public channels. We design the scheme to enable fundamental operations to be executed in a distributed manner, thereby facilitating distributed average consensus. This solution resists attacks from both honest-but-curious and global eavesdropping agents, under the condition that each node is connected to at least one trusted node. In comparison with differential privacy solutions, our approach achieves consensus by an exact state value. Furthermore, it has a lighter resource consumption and broader applicability than homomorphic encryption schemes. Simulation results show the feasibility and security of our approach.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112847"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146189715","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 : 2026-04-01Epub Date: 2026-01-19DOI: 10.1016/j.automatica.2026.112818
Ho Duc Tho , Kazuhiko Terashima , Takanori Miyoshi
The second swing angle information may not be strictly required to fully control the double-pendulum overhead crane (DPOC) system. Such an insight stems from the propagation of vibration suppression principle, which states that if either of the two swing angles is suppressed by control, both pendulums will cease to vibrate altogether. This intuition serves as the basis of the augmented passivity-based control law. The trolley velocity — the default command of most industrial cranes — is chosen as the system’s control input. Passivity properties of the system and the control law design are formulated based on a linearized model. The region of attraction (ROA) of the nonlinear closed-loop system is then computed using the sum-of-square (SOS) programming. The established controller does not require measurements or estimations of any rate or velocity signals. In the absence of the second swing angle information, the proposed approach can achieve similar control performance compared to existing full-state feedback controllers. An experimental result on a small-scale DPOC rig is also provided.
{"title":"Passivity-based control of a double-pendulum crane using propagation of vibration suppression","authors":"Ho Duc Tho , Kazuhiko Terashima , Takanori Miyoshi","doi":"10.1016/j.automatica.2026.112818","DOIUrl":"10.1016/j.automatica.2026.112818","url":null,"abstract":"<div><div>The second swing angle information may not be strictly required to fully control the double-pendulum overhead crane (DPOC) system. Such an insight stems from the propagation of vibration suppression principle, which states that if either of the two swing angles is suppressed by control, both pendulums will cease to vibrate altogether. This intuition serves as the basis of the augmented passivity-based control law. The trolley velocity — the default command of most industrial cranes — is chosen as the system’s control input. Passivity properties of the system and the control law design are formulated based on a linearized model. The region of attraction (ROA) of the nonlinear closed-loop system is then computed using the sum-of-square (SOS) programming. The established controller does not require measurements or estimations of any rate or velocity signals. In the absence of the second swing angle information, the proposed approach can achieve similar control performance compared to existing full-state feedback controllers. An experimental result on a small-scale DPOC rig is also provided.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112818"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146000582","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 : 2026-04-01Epub Date: 2026-01-20DOI: 10.1016/j.automatica.2026.112828
Yuzhe Chen , Ci Chen , Frank L. Lewis
This paper studies multiplayer nonzero-sum (NZS) games with an infinite horizon for nonlinear continuous-time (CT) systems with an emphasis on addressing the pervasive stability challenges encountered during the application of policy iteration methodologies. Central to this work is the introduction of the framework termed multiplayer cascaded policy iteration (MCPI), devised to iteratively approximate Nash equilibrium solutions within the realm of nonlinear NZS games. A salient feature of MCPI lies in its ability to ensure not only the stability of the iterative process but also its intriguing convergence equivalence with quasi-Newton iteration paradigms. Furthermore, building upon approximate dynamic programming technology, we present an extended effort in the development of an online algorithm. This algorithm leverages input and state data from the system to approximate the optimal solution online, eliminating the need for specific system parameters. Employing the apparatus of the approximation theorem, the algorithm approximates value functions and control policies, with the least squares method serving for weight updates. A rigorous proof of convergence substantiates the efficacy of the approximate solution, ensuring its eventual convergence to optimality. The efficacy of the developed method is validated through a numerical example.
{"title":"Non-zero-sum games in continuous-time nonlinear systems: Multiplayer cascaded solutions","authors":"Yuzhe Chen , Ci Chen , Frank L. Lewis","doi":"10.1016/j.automatica.2026.112828","DOIUrl":"10.1016/j.automatica.2026.112828","url":null,"abstract":"<div><div>This paper studies multiplayer nonzero-sum (NZS) games with an infinite horizon for nonlinear continuous-time (CT) systems with an emphasis on addressing the pervasive stability challenges encountered during the application of policy iteration methodologies. Central to this work is the introduction of the framework termed multiplayer cascaded policy iteration (MCPI), devised to iteratively approximate Nash equilibrium solutions within the realm of nonlinear NZS games. A salient feature of MCPI lies in its ability to ensure not only the stability of the iterative process but also its intriguing convergence equivalence with quasi-Newton iteration paradigms. Furthermore, building upon approximate dynamic programming technology, we present an extended effort in the development of an online algorithm. This algorithm leverages input and state data from the system to approximate the optimal solution online, eliminating the need for specific system parameters. Employing the apparatus of the approximation theorem, the algorithm approximates value functions and control policies, with the least squares method serving for weight updates. A rigorous proof of convergence substantiates the efficacy of the approximate solution, ensuring its eventual convergence to optimality. The efficacy of the developed method is validated through a numerical example.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112828"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146006432","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 : 2026-04-01Epub Date: 2026-01-21DOI: 10.1016/j.automatica.2026.112831
Kai Wulff , Maria Christine Honecker , Robert Schmid , Johann Reger
We consider the analytical control design for switched linear multiple-input multiple-output (MIMO) systems subject to arbitrary switching signals. A state feedback controller design method is proposed to obtain an eigenstructure assignment ensuring that the closed-loop switched system is globally asymptotically stable, and the outputs achieve the non-overshooting tracking of a step reference. Our analysis indicates whether non-overshooting or even monotonic tracking is achievable for the given system and considered outputs, and provides a choice of possible eigenstructures to be assigned to the constituent subsystems. We derive a structural condition that verifies the feasibility of the chosen assignment. A constructive algorithm to obtain suitable feedback matrices is provided, and the method is illustrated with numerical examples.
{"title":"Non-overshooting output shaping for switched linear systems under arbitrary switching using eigenstructure assignment","authors":"Kai Wulff , Maria Christine Honecker , Robert Schmid , Johann Reger","doi":"10.1016/j.automatica.2026.112831","DOIUrl":"10.1016/j.automatica.2026.112831","url":null,"abstract":"<div><div>We consider the analytical control design for switched linear multiple-input multiple-output (MIMO) systems subject to arbitrary switching signals. A state feedback controller design method is proposed to obtain an eigenstructure assignment ensuring that the closed-loop switched system is globally asymptotically stable, and the outputs achieve the non-overshooting tracking of a step reference. Our analysis indicates whether non-overshooting or even monotonic tracking is achievable for the given system and considered outputs, and provides a choice of possible eigenstructures to be assigned to the constituent subsystems. We derive a structural condition that verifies the feasibility of the chosen assignment. A constructive algorithm to obtain suitable feedback matrices is provided, and the method is illustrated with numerical examples.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112831"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146014286","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 : 2026-04-01Epub Date: 2026-02-06DOI: 10.1016/j.automatica.2026.112862
Shenghan Mei , Ziqin He , Yidan Mei , Xin Mao , Anqi Dong , Ren Wang , Can Chen
Model order reduction plays a crucial role in simplifying complex systems while preserving their essential dynamic characteristics, making it an invaluable tool in a wide range of applications, including robotic systems, signal processing, and fluid dynamics. However, traditional model order reduction techniques like balanced truncation are not designed to handle tensor data directly and instead require unfolding the data, which may lead to the loss of important higher-order structural information. In this article, we introduce a novel framework for data-driven model order reduction of T-product-based dynamical systems (TPDSs), which are often used to capture the evolution of third-order tensor data such as images and videos through the T-product, using tensor decomposition. Specifically, we develop advanced T-product-based techniques, including T-balanced truncation, T-balanced proper orthogonal decomposition, and the T-eigensystem realization algorithm for input–output TPDSs by leveraging the unique properties of T-singular value decomposition, which are fundamentally different from their matrix-based counterparts. We demonstrate that these techniques offer significant memory and computational savings while achieving reduction errors that are comparable to those of conventional methods. The effectiveness of the proposed framework is further validated through both synthetic and real-world examples.
{"title":"Data-driven model order reduction via T-SVD","authors":"Shenghan Mei , Ziqin He , Yidan Mei , Xin Mao , Anqi Dong , Ren Wang , Can Chen","doi":"10.1016/j.automatica.2026.112862","DOIUrl":"10.1016/j.automatica.2026.112862","url":null,"abstract":"<div><div>Model order reduction plays a crucial role in simplifying complex systems while preserving their essential dynamic characteristics, making it an invaluable tool in a wide range of applications, including robotic systems, signal processing, and fluid dynamics. However, traditional model order reduction techniques like balanced truncation are not designed to handle tensor data directly and instead require unfolding the data, which may lead to the loss of important higher-order structural information. In this article, we introduce a novel framework for data-driven model order reduction of T-product-based dynamical systems (TPDSs), which are often used to capture the evolution of third-order tensor data such as images and videos through the T-product, using tensor decomposition. Specifically, we develop advanced T-product-based techniques, including T-balanced truncation, T-balanced proper orthogonal decomposition, and the T-eigensystem realization algorithm for input–output TPDSs by leveraging the unique properties of T-singular value decomposition, which are fundamentally different from their matrix-based counterparts. We demonstrate that these techniques offer significant memory and computational savings while achieving reduction errors that are comparable to those of conventional methods. The effectiveness of the proposed framework is further validated through both synthetic and real-world examples.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112862"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146134382","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}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号