Pub Date : 2024-08-30DOI: 10.1109/LCSYS.2024.3452194
Sleiman Safaoui;Tyler H. Summers
We introduce cvxRiskOpt (convex Risk-based Optimization): a Python package built on top of CVXPY for the rapid prototyping of convex risk-based optimization problems and generating embeddable C code using CVXPYgen. Our package provides high-level functions to handle several risk-based optimization problems and constraints. These functions reformulate problems and constraints involving random variables and uncertainty into deterministic convex counterparts. The output is either a CVXPY Problem instance or CVXPY constraints that users can directly add to their CVXPY Problem instance. Accordingly, our package can use CVXPYgen to generate C code resulting in custom embeddable risk-based optimization problems. cvxRiskOpt is available at https://tsummerslab.github.io/cvxRiskOpt/ .
{"title":"cvxRiskOpt: A Risk-Based Optimization Tool Based on CVXPY","authors":"Sleiman Safaoui;Tyler H. Summers","doi":"10.1109/LCSYS.2024.3452194","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3452194","url":null,"abstract":"We introduce cvxRiskOpt (convex Risk-based Optimization): a Python package built on top of CVXPY for the rapid prototyping of convex risk-based optimization problems and generating embeddable C code using CVXPYgen. Our package provides high-level functions to handle several risk-based optimization problems and constraints. These functions reformulate problems and constraints involving random variables and uncertainty into deterministic convex counterparts. The output is either a CVXPY Problem instance or CVXPY constraints that users can directly add to their CVXPY Problem instance. Accordingly, our package can use CVXPYgen to generate C code resulting in custom embeddable risk-based optimization problems. cvxRiskOpt is available at \u0000<uri>https://tsummerslab.github.io/cvxRiskOpt/</uri>\u0000.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142230867","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}
Pub Date : 2024-08-30DOI: 10.1109/LCSYS.2024.3452170
Qiyao Wang;Jitao Sun
In this letter, a class of hybrid systems with logical effects is investigated. First, we give the algebraic form of the hybrid systems with the help of the semi-tensor product (STP, i.e., Cheng product). Next, a necessary and sufficient condition for the existence of equilibria is presented. Further, the local asymptotic stability and basins of attractors are discussed. Finally, some numerical examples are provided to demonstrate the validity of the theoretical results.
{"title":"Existence and Stability of Equilibria for a Class of Hybrid Systems With Logical Effects","authors":"Qiyao Wang;Jitao Sun","doi":"10.1109/LCSYS.2024.3452170","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3452170","url":null,"abstract":"In this letter, a class of hybrid systems with logical effects is investigated. First, we give the algebraic form of the hybrid systems with the help of the semi-tensor product (STP, i.e., Cheng product). Next, a necessary and sufficient condition for the existence of equilibria is presented. Further, the local asymptotic stability and basins of attractors are discussed. Finally, some numerical examples are provided to demonstrate the validity of the theoretical results.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142159879","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}
Pub Date : 2024-08-29DOI: 10.1109/LCSYS.2024.3450066
Marco Costanzo;Giuseppe De Maria;Ciro Natale
Presents corrections to the paper, Homography-Based Sampled-Data Visual Servoing.
介绍对论文《基于同构的采样数据视觉伺服》的更正。
{"title":"Corrections to “Homography-Based Sampled-Data Visual Servoing”","authors":"Marco Costanzo;Giuseppe De Maria;Ciro Natale","doi":"10.1109/LCSYS.2024.3450066","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3450066","url":null,"abstract":"Presents corrections to the paper, Homography-Based Sampled-Data Visual Servoing.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10659094","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142165028","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}
Pub Date : 2024-08-29DOI: 10.1109/LCSYS.2024.3451468
Hendra I. Nurdin
The corrigendum uses the notation in [1]. As with [2], the work [1] was concerned with saturability of the QCRB for a finite-dimensional rank-deficient density operator $rho _{theta }$ in the sense that there exists a POVM with a corresponding probability distribution (on the measurement outcomes) with a classical Fisher information matrix that equals the quantum Fisher information (QFI) matrix of $rho _{theta }$ . It does not address the existence of an unbiased estimator that achieves the lowest mean square estimation error for $Ctheta $ under this POVM for any real row vector C of the same length as $theta $ . Reference [1, Th. 2] claims the following necessary and sufficient conditions: 1) $[L_{theta _{l},++},L_{theta _{m},++}]=0$ for $l,m=1,ldots,p$ .2)For each $theta $ there exists a unitary $U_{theta } in mathbb {C}^{r_{+} times r_{+}}$ such that $U_{theta }^{dagger }(partial _{l} U_{theta } - U_{theta } V_{theta }^{dagger } partial _{l} V_{theta })rho _{theta,++} + rho _{theta,++} (partial _{l} U_{theta } - U_{theta } V_{theta }^{dagger } partial _{l} V_{theta })^{dagger } U_{theta }=0$ for $l=1,ldots,p$ , where $partial _{l} = partial /partial theta _{l}$ , $V_{theta } =left [{{begin{array}{ccc} |psi _{1,theta } rangle & ~ ldots & ~ |psi _{r_{+},theta } rangle end{array}}}right ]$ , and $rho _{theta,++}$ is represented in the basis $mathcal {B}_{+,theta }$ . However, an implicit assumption in the proof of [1, Th. 2] that is not valid in general (that $E_{k,00}$ sums to $I_{r_{0}}$ over all k corresponding to null POVM operators) invalidates these conditions for general POVMs. A counterexample to the necessity of Condition 1 can be found for $rho _{theta }$ belonging to the quantum exponential family of parameterized density operators [3] of the form begin{equation*} rho _{theta } = e^{frac {1}{2}sum _{j=1}^{p} left ({{theta _{j} F_{j} + omega left ({{theta }}right)I }}right)} rho _{0} e^{frac {1}{2}sum _{j=1}^{p} left ({{theta _{j} F_{j} + omega left ({{theta }}right)I }}right)},end{equation*} with $F_{j}=1,ldots,p$ taken to be invertible and mutually commuting observables, $rho _{0}$ is some fixed rank-deficient density operator (of the same dimension as the $F_{j}$ ’s), and $omega (theta)$ is a scalar normalizing factor such that $mathrm {tr}(rho _{theta }) = 1$ . It is easily seen that the SLDs can be chosen to be $L_{theta _{j}} = F_{j} + partial _{j} omega (theta) I$ and they are mutually commuting $[L_{theta _{j}},L_{theta _{k}}]=0$ for all $j,k$ . Thus the QCRB is saturated by a POVM that consists of the common spectral projectors of ${L_{theta _{j}}}_{j=1,ldots,p}$ . However, the SLDs will not satisfy Condition 1 in general. It is satisfied, for instance, in the case where $rho _{0}$ also commutes with all the SLDs, which is not generic. There is also an error in Condition 2 since there can exist a unitary solution under this condition that does not necessarily correspond to saturation of the QCRB. For example, when $r_{+}=1$ or
{"title":"Corrections to “Saturability of the Quantum Cramér-Rao Bound in Multiparameter Quantum Estimation at the Single-Copy Level”","authors":"Hendra I. Nurdin","doi":"10.1109/LCSYS.2024.3451468","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3451468","url":null,"abstract":"The corrigendum uses the notation in [1]. As with [2], the work [1] was concerned with saturability of the QCRB for a finite-dimensional rank-deficient density operator $rho _{theta }$ in the sense that there exists a POVM with a corresponding probability distribution (on the measurement outcomes) with a classical Fisher information matrix that equals the quantum Fisher information (QFI) matrix of $rho _{theta }$ . It does not address the existence of an unbiased estimator that achieves the lowest mean square estimation error for $Ctheta $ under this POVM for any real row vector C of the same length as $theta $ . Reference [1, Th. 2] claims the following necessary and sufficient conditions: 1) $[L_{theta _{l},++},L_{theta _{m},++}]=0$ for $l,m=1,ldots,p$ .2)For each $theta $ there exists a unitary $U_{theta } in mathbb {C}^{r_{+} times r_{+}}$ such that $U_{theta }^{dagger }(partial _{l} U_{theta } - U_{theta } V_{theta }^{dagger } partial _{l} V_{theta })rho _{theta,++} + rho _{theta,++} (partial _{l} U_{theta } - U_{theta } V_{theta }^{dagger } partial _{l} V_{theta })^{dagger } U_{theta }=0$ for $l=1,ldots,p$ , where $partial _{l} = partial /partial theta _{l}$ , $V_{theta } =left [{{begin{array}{ccc} |psi _{1,theta } rangle & ~ ldots & ~ |psi _{r_{+},theta } rangle end{array}}}right ]$ , and $rho _{theta,++}$ is represented in the basis $mathcal {B}_{+,theta }$ . However, an implicit assumption in the proof of [1, Th. 2] that is not valid in general (that $E_{k,00}$ sums to $I_{r_{0}}$ over all k corresponding to null POVM operators) invalidates these conditions for general POVMs. A counterexample to the necessity of Condition 1 can be found for $rho _{theta }$ belonging to the quantum exponential family of parameterized density operators [3] of the form begin{equation*} rho _{theta } = e^{frac {1}{2}sum _{j=1}^{p} left ({{theta _{j} F_{j} + omega left ({{theta }}right)I }}right)} rho _{0} e^{frac {1}{2}sum _{j=1}^{p} left ({{theta _{j} F_{j} + omega left ({{theta }}right)I }}right)},end{equation*} with $F_{j}=1,ldots,p$ taken to be invertible and mutually commuting observables, $rho _{0}$ is some fixed rank-deficient density operator (of the same dimension as the $F_{j}$ ’s), and $omega (theta)$ is a scalar normalizing factor such that $mathrm {tr}(rho _{theta }) = 1$ . It is easily seen that the SLDs can be chosen to be $L_{theta _{j}} = F_{j} + partial _{j} omega (theta) I$ and they are mutually commuting $[L_{theta _{j}},L_{theta _{k}}]=0$ for all $j,k$ . Thus the QCRB is saturated by a POVM that consists of the common spectral projectors of ${L_{theta _{j}}}_{j=1,ldots,p}$ . However, the SLDs will not satisfy Condition 1 in general. It is satisfied, for instance, in the case where $rho _{0}$ also commutes with all the SLDs, which is not generic. There is also an error in Condition 2 since there can exist a unitary solution under this condition that does not necessarily correspond to saturation of the QCRB. For example, when $r_{+}=1$ or ","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142160028","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}
Pub Date : 2024-08-29DOI: 10.1109/LCSYS.2024.3451792
Guido Carnevale;Giuseppe Notarstefano
In this letter, we present a timescale separation result for discrete-time stochastic systems. We consider the feedback interconnection of two stochastic subsystems, referred to as fast and slow dynamics, and analyze them by combining timescale separation theory and stochastic LaSalle and Lyapunov theorems. Specifically, we separately focus on two auxiliary dynamics, named the boundary layer system (related to the fast part) and the reduced system (related to the slow part). For each of these auxiliary schemes, we identify a stochastic LaSalle testing condition and guarantee that satisfying both conditions is sufficient to prove almost sure LaSalle-type convergence of the original stochastic interconnection. Finally, we focus on stochastic optimization and exploit this new tool to prove almost sure convergence of the popular Stochastic Averaged Gradient and SAGA algorithms in a general nonconvex framework.
{"title":"Timescale Separation for Discrete-Time Nonlinear Stochastic Systems","authors":"Guido Carnevale;Giuseppe Notarstefano","doi":"10.1109/LCSYS.2024.3451792","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3451792","url":null,"abstract":"In this letter, we present a timescale separation result for discrete-time stochastic systems. We consider the feedback interconnection of two stochastic subsystems, referred to as fast and slow dynamics, and analyze them by combining timescale separation theory and stochastic LaSalle and Lyapunov theorems. Specifically, we separately focus on two auxiliary dynamics, named the boundary layer system (related to the fast part) and the reduced system (related to the slow part). For each of these auxiliary schemes, we identify a stochastic LaSalle testing condition and guarantee that satisfying both conditions is sufficient to prove almost sure LaSalle-type convergence of the original stochastic interconnection. Finally, we focus on stochastic optimization and exploit this new tool to prove almost sure convergence of the popular Stochastic Averaged Gradient and SAGA algorithms in a general nonconvex framework.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10659105","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142165092","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}
Pub Date : 2024-08-26DOI: 10.1109/LCSYS.2024.3449287
Ruiqi Zhou;Xingxing Ju;Qing Wang;Shan Jiang
This letter proposes an inverse-free, noise-tolerant neurodynamic approach with a self-adaptive gain for solving time-varying quadratic programming problems (TVQPs). The proposed neurodynamic approach avoids inverting the coefficient matrix of TVQPs, resulting in lower computational complexity. It is demonstrated that the proposed approach ensures fixed-time convergence in noiseless conditions, and it achieves asymptotic convergence without requiring to anticipate the magnitudes of additive noises in noisy conditions. Additionally, the self-adaptive gain converges to a bounded constant rather than infinity in both noiseless and noisy scenarios. Simulation studies conducted on the redundant manipulator motion planning and ridge regression problem validate the effectiveness of the proposed approach.
{"title":"Inverse-Free Neurodynamic Approach With Self-Adaptive Gain for Time-Varying Quadratic Programming and Applications","authors":"Ruiqi Zhou;Xingxing Ju;Qing Wang;Shan Jiang","doi":"10.1109/LCSYS.2024.3449287","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3449287","url":null,"abstract":"This letter proposes an inverse-free, noise-tolerant neurodynamic approach with a self-adaptive gain for solving time-varying quadratic programming problems (TVQPs). The proposed neurodynamic approach avoids inverting the coefficient matrix of TVQPs, resulting in lower computational complexity. It is demonstrated that the proposed approach ensures fixed-time convergence in noiseless conditions, and it achieves asymptotic convergence without requiring to anticipate the magnitudes of additive noises in noisy conditions. Additionally, the self-adaptive gain converges to a bounded constant rather than infinity in both noiseless and noisy scenarios. Simulation studies conducted on the redundant manipulator motion planning and ridge regression problem validate the effectiveness of the proposed approach.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142230866","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}
While model predictive control (MPC) is widely used in the process industry for its ability to handle constraints and address complex dynamics, its conventional formulations often encounter challenges when dealing with descriptor systems. These formulations rely on system transformations that are applicable only to regular systems in specific scenarios, along with additional index assumptions. This letter formulates the MPC problem of discrete-time linear descriptor systems directly in their original state-space representation. Using the penalized weighted least-squares approach, we derive a quadratic cost function subject to the descriptor system over a finite prediction horizon. Through backward dynamic programming within each horizon, we then solve the constrained optimization problem to construct control inputs for forward-shifted prediction horizons. To accomplish this, we deal with the convergence and stability analysis of the proposed algorithm. Numerical simulations demonstrate its effectiveness compared to traditional techniques, alleviating the need for regularity and index assumptions.
{"title":"Model Predictive Control of Descriptor Systems","authors":"Komeil Nosrati;Juri Belikov;Aleksei Tepljakov;Eduard Petlenkov","doi":"10.1109/LCSYS.2024.3448310","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3448310","url":null,"abstract":"While model predictive control (MPC) is widely used in the process industry for its ability to handle constraints and address complex dynamics, its conventional formulations often encounter challenges when dealing with descriptor systems. These formulations rely on system transformations that are applicable only to regular systems in specific scenarios, along with additional index assumptions. This letter formulates the MPC problem of discrete-time linear descriptor systems directly in their original state-space representation. Using the penalized weighted least-squares approach, we derive a quadratic cost function subject to the descriptor system over a finite prediction horizon. Through backward dynamic programming within each horizon, we then solve the constrained optimization problem to construct control inputs for forward-shifted prediction horizons. To accomplish this, we deal with the convergence and stability analysis of the proposed algorithm. Numerical simulations demonstrate its effectiveness compared to traditional techniques, alleviating the need for regularity and index assumptions.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142174014","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}
Pub Date : 2024-08-19DOI: 10.1109/LCSYS.2024.3445723
Christoph Mark;Daniele Ravasio;Marcello Farina;Daniel Görges
In this letter we consider discrete-time linear systems affected by unbounded multiplicative noise. To control this class of systems, we apply an indirect-feedback stochastic model predictive control scheme that results in formally provable mean square convergence and closed-loop chance constraint satisfaction guarantees. The benefits of the proposed controller will be highlighted on a numerical example.
{"title":"Stochastic MPC for Linear Systems With Unbounded Multiplicative Noise Guaranteeing Closed-Loop Chance Constraints Satisfaction","authors":"Christoph Mark;Daniele Ravasio;Marcello Farina;Daniel Görges","doi":"10.1109/LCSYS.2024.3445723","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3445723","url":null,"abstract":"In this letter we consider discrete-time linear systems affected by unbounded multiplicative noise. To control this class of systems, we apply an indirect-feedback stochastic model predictive control scheme that results in formally provable mean square convergence and closed-loop chance constraint satisfaction guarantees. The benefits of the proposed controller will be highlighted on a numerical example.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142091052","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}
This letter introduces a novel methodology for designing a predefined-time observer for a class of multi-output nonlinear systems with uniform observability. Constructing predefined-time observers for multi-output systems presents a nontrivial extension from the single-output case, particularly when aiming for the error convergence. The predefined-time stability concept is used to devise an observer capable of estimating the system’s state of multi-output nonlinear systems within a predetermined time. The construction depends on utilizing saturated estimates that eliminate peaks and relaxes the local Lipschitz condition, thereby ultimately broadening the class for observer existence. Stability analysis of the proposed approach is carried out using the Lyapunov theorem. The comparative simulations of two numerical examples are presented to demonstrate the efficacy of the proposed approach.
{"title":"Observer Design for Multi-Output Systems With Predefined-Time Convergence","authors":"Sunil Kumar;Sandeep Kumar Soni;Shyam Kamal;Mohamed Djemai","doi":"10.1109/LCSYS.2024.3443048","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3443048","url":null,"abstract":"This letter introduces a novel methodology for designing a predefined-time observer for a class of multi-output nonlinear systems with uniform observability. Constructing predefined-time observers for multi-output systems presents a nontrivial extension from the single-output case, particularly when aiming for the error convergence. The predefined-time stability concept is used to devise an observer capable of estimating the system’s state of multi-output nonlinear systems within a predetermined time. The construction depends on utilizing saturated estimates that eliminate peaks and relaxes the local Lipschitz condition, thereby ultimately broadening the class for observer existence. Stability analysis of the proposed approach is carried out using the Lyapunov theorem. The comparative simulations of two numerical examples are presented to demonstrate the efficacy of the proposed approach.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142274987","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}
Pub Date : 2024-08-12DOI: 10.1109/LCSYS.2024.3441863
Ze-Hong Zeng;Yan-Wu Wang;Xiao-Kang Liu;Wu Yang
This letter addresses the event-triggered control problem for uncertain switched two-time-scale systems (TTSSs) experiencing asynchronous switching. Due to ill-conditioning issues, methods developed for switched single-time-scale systems cannot be directly applied to switched TTSSs. Additionally, event-triggered results for non-switched TTSSs are inapplicable due to the complexities introduced by switching behavior and asynchronism. To address these challenges, we utilize a Lyapunov function dependent on the singular perturbation parameter and the controller mode to establish conditions sufficient to ensure the exponential stability of the closed-loop system with average dwell time switching. These conditions facilitate the joint design of a mode-dependent event-triggered mechanism and the control gains while mitigating the risk of Zeno behavior. Finally, a numerical example is provided to demonstrate the effectiveness and benefits of the proposed theorem.
{"title":"Event-Triggered Control of Switched Two-Time-Scale Systems With Asynchronous Switching","authors":"Ze-Hong Zeng;Yan-Wu Wang;Xiao-Kang Liu;Wu Yang","doi":"10.1109/LCSYS.2024.3441863","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3441863","url":null,"abstract":"This letter addresses the event-triggered control problem for uncertain switched two-time-scale systems (TTSSs) experiencing asynchronous switching. Due to ill-conditioning issues, methods developed for switched single-time-scale systems cannot be directly applied to switched TTSSs. Additionally, event-triggered results for non-switched TTSSs are inapplicable due to the complexities introduced by switching behavior and asynchronism. To address these challenges, we utilize a Lyapunov function dependent on the singular perturbation parameter and the controller mode to establish conditions sufficient to ensure the exponential stability of the closed-loop system with average dwell time switching. These conditions facilitate the joint design of a mode-dependent event-triggered mechanism and the control gains while mitigating the risk of Zeno behavior. Finally, a numerical example is provided to demonstrate the effectiveness and benefits of the proposed theorem.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142021546","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：