Automatica最新文献

{"title":"Nonlinear functional estimation: Functional detectability and full information estimation","authors":"Simon Muntwiler,&nbsp;Johannes Köhler,&nbsp;Melanie N. Zeilinger","doi":"10.1016/j.automatica.2024.111945","DOIUrl":"10.1016/j.automatica.2024.111945","url":null,"abstract":"<div><div>We consider the design of functional estimators, i.e., approaches to compute an estimate of a nonlinear function of the state of a general nonlinear dynamical system subject to process noise based on noisy output measurements. To this end, we introduce a novel functional detectability notion in the form of incremental input/output-to-output stability (<span><math><mi>δ</mi></math></span>-IOOS). We show that <span><math><mi>δ</mi></math></span>-IOOS is a necessary condition for the existence of a functional estimator satisfying an input-to-output type stability property. Additionally, we prove that a system is functional detectable if and only if it admits a corresponding <span><math><mi>δ</mi></math></span>-IOOS Lyapunov function. Furthermore, <span><math><mi>δ</mi></math></span>-IOOS is shown to be a sufficient condition for the design of a stable functional estimator by introducing the design of a full information estimation (FIE) approach for functional estimation. Together, we present a unified framework to study functional estimation with a detectability condition, which is necessary and sufficient for the existence of a stable functional estimator, and a corresponding functional estimator design. The practical need for and applicability of the proposed functional estimator design is illustrated with a numerical example of a power system.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142421965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Soft-minimum and soft-maximum barrier functions for safety with actuation constraints","authors":"Pedram Rabiee,&nbsp;Jesse B. Hoagg","doi":"10.1016/j.automatica.2024.111921","DOIUrl":"10.1016/j.automatica.2024.111921","url":null,"abstract":"<div><div>This paper presents two new control approaches for guaranteed safety (remaining in a safe set) subject to actuator constraints (the control is in a convex polytope). The control signals are computed using real-time optimization, including linear and quadratic programs subject to affine constraints, which are shown to be feasible. The first control method relies on a soft-minimum barrier function that is constructed using a finite-time-horizon prediction of the system trajectories under a known backup control. The main result shows that the control is continuous and satisfies the actuator constraints, and a subset of the safe set is forward invariant under the control. Next, we extend this method to allow from multiple backup controls. This second approach relies on a combined soft-maximum/soft-minimum barrier function, and it has properties similar to the first. We demonstrate these controls on numerical simulations of an inverted pendulum and a nonholonomic ground robot.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142421961","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}

{"title":"Adaptive learning-based model predictive control for uncertain interconnected systems: A set membership identification approach","authors":"Ahmed Aboudonia,&nbsp;John Lygeros","doi":"10.1016/j.automatica.2024.111943","DOIUrl":"10.1016/j.automatica.2024.111943","url":null,"abstract":"<div><div>We propose a novel adaptive learning-based model predictive control (MPC) scheme for interconnected systems which can be decomposed into several smaller dynamically coupled subsystems with uncertain coupling. The proposed scheme is mainly divided into two main online phases; a learning phase and an adaptation phase. Set membership identification is used in the learning phase to learn an uncertainty set that contains the coupling strength using online data. In the adaptation phase, rigid tube-based robust MPC is used to compute the optimal predicted states and inputs. Besides computing the optimal trajectories, the MPC ingredients are adapted in the adaptation phase taking the learnt uncertainty set into account. These MPC ingredients include the prestabilizing controller, the rigid tube, the tightened constraints and the terminal ingredients. The recursive feasibility of the proposed scheme as well as the stability of the corresponding closed-loop system are discussed. The developed scheme is compared in simulations to existing schemes including robust, adaptive and learning-based MPC.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142421963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Tamper-tolerant diagnosability analysis and tampering detectability in discrete event systems under cost constraints","authors":"Yuting Li ,&nbsp;Christoforos N. Hadjicostis ,&nbsp;Naiqi Wu ,&nbsp;Zhiwu Li","doi":"10.1016/j.automatica.2024.111971","DOIUrl":"10.1016/j.automatica.2024.111971","url":null,"abstract":"<div><div>This paper addresses fault diagnosis and tampering detection in discrete event systems modeled with nondeterministic finite automata under malicious attacks. We propose a novel structure to simultaneously track the occurrence of fault events and tampering actions in systems compromised by attacks (i.e., by arbitrary deletions, insertions, or substitutions of observed symbols). Assuming that each deletion, insertion, or substitution bears a positive cost to the attacker, two scenarios are taken into account: (1) a bounded number of attacks or, more generally, a total cost constraint on tampering actions, and (2) an unbounded number of attacks or, more generally, no constraints on the total cost of tampering actions. Several examples are presented to demonstrate the influence of cost constraints on tamper-tolerant diagnosis and tampering detection. A state isolation technique is developed to deal with the fault and/or tampering action detection problem via an external observer that aims to isolate the estimated states within a certain subset of states based on a given sequence of observations. We also report a technique of polynomial complexity for verifying tamper-tolerant diagnosability and tampering detectability.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142421289","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}

{"title":"A separation principle for the prescribed-time stabilization of a class of nonlinear systems","authors":"Hefu Ye,&nbsp;Yongduan Song","doi":"10.1016/j.automatica.2024.111983","DOIUrl":"10.1016/j.automatica.2024.111983","url":null,"abstract":"<div><div>Despite the recent development of prescribed-time control theory, the highly desirable separation principle remains unavailable for nonlinear systems with only the output being measurable. In this paper, for the first time we establish such separation principle for a class of nonlinear systems, such that the prescribed-time observer and prescribed-time controller can be designed independently, and the parameter designs do not affect each other. Our method makes use of two parametric Lyapunov equations (PLEs) to generate two symmetric positive-definite matrices, aiming to avoid conservative treatments of nonlinear functions commonly associated with high-gain methods during the design process. Our work provides a stronger version of the matrix pencil formulation that is applicable when nonlinearities satisfy the so-called linear growth condition, even if the growth rate is unknown. In our method the selection of design parameters is straightforward as it involves only three parameters: one for the prescribed convergence time <span><math><msub><mrow><mi>t</mi></mrow><mrow><mi>f</mi></mrow></msub></math></span>, and the other two are for the controller and the observer respectively, and the choice of the latter two parameters does not affect each other. Once the system order is determined, one can directly obtain reasonable ranges for these two parameters. Numerical simulations verify the effectiveness of the proposed method.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142421964","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}

{"title":"Convergence rate bounds for the mirror descent method: IQCs, Popov criterion and Bregman divergence","authors":"Mengmou Li ,&nbsp;Khaled Laib ,&nbsp;Takeshi Hatanaka ,&nbsp;Ioannis Lestas","doi":"10.1016/j.automatica.2024.111973","DOIUrl":"10.1016/j.automatica.2024.111973","url":null,"abstract":"<div><div>This paper presents a comprehensive convergence analysis for the mirror descent (MD) method, a widely used algorithm in convex optimization. The key feature of this algorithm is that it provides a generalization of classical gradient-based methods via the use of generalized distance-like functions, which are formulated using the Bregman divergence. Establishing convergence rate bounds for this algorithm is in general a non-trivial problem due to the lack of monotonicity properties in the composite nonlinearities involved. In this paper, we show that the Bregman divergence from the optimal solution, which is commonly used as a Lyapunov function for this algorithm, is a special case of Lyapunov functions that follow when the Popov criterion is applied to an appropriate reformulation of the MD dynamics. This is then used as a basis to construct an integral quadratic constraint (IQC) framework through which convergence rate bounds with reduced conservatism can be deduced. We also illustrate via examples that the convergence rate bounds derived can be tight.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142421952","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Necessary and sufficient condition of distributed H∞ filtering for interconnected large-scale systems: A novel space construction approach","authors":"Tao Yu ,&nbsp;Jun Song ,&nbsp;Zhiying Wu ,&nbsp;Shuping He","doi":"10.1016/j.automatica.2024.111918","DOIUrl":"10.1016/j.automatica.2024.111918","url":null,"abstract":"<div><div>This paper studies the distributed <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>∞</mi></mrow></msub></math></span> filtering problem for interconnected large-scale systems (ILSs). In distributed filtering, all sub-filters are interconnected via the designed interconnection matrix and each filter only requires local subsystems’ measurements to estimate the target signals. By the developed space construction method, novel both necessary and sufficient conditions are proposed to ensure the asymptotic stability and <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>∞</mi></mrow></msub></math></span> performance of the filtering error ILSs. The novel conditions are numerically attractive because the computationally expensive matrix inversion terms are eliminated. In order to further reduce the computation burden, some sufficient conditions are also provided to guarantee the stability and <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>∞</mi></mrow></msub></math></span> performance of the filtering error for ILSs. Then, by constructing the basis of the null space for some matrices skillfully and using Finsler’s Lemma three times, this paper separates the product relation among the filter parameters and the unknown auxiliary variables. As a result, not only the filter parameters but also the interconnection matrix of distributed filters can be designed. The designed conditions are given in terms of linear matrix inequalities. At last, three examples are tested to demonstrate the advantages and superiorities of the developed filtering methodology.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142421953","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}

{"title":"Robust fault estimators for nonlinear systems: An ultra-local model design","authors":"Farhad Ghanipoor ,&nbsp;Carlos Murguia ,&nbsp;Peyman Mohajerin Esfahani ,&nbsp;Nathan van de Wouw","doi":"10.1016/j.automatica.2024.111920","DOIUrl":"10.1016/j.automatica.2024.111920","url":null,"abstract":"<div><div>This paper proposes a nonlinear estimator for the robust reconstruction of process and sensor faults for a class of uncertain nonlinear systems. The proposed fault estimation method augments the system dynamics with an ultra-local (in time) internal state–space representation (a finite chain of integrators) of the fault vector. Next, a nonlinear state observer is designed based on the known parts of the augmented dynamics. This nonlinear filter (observer) reconstructs the fault signal as well as the states of the augmented system. We provide sufficient conditions that guarantee stability of the estimation error dynamics: firstly, asymptotic stability (i.e., exact fault estimation) in the absence of perturbations induced by the fault model mismatch (mismatch between internal ultra-local model for the fault and the actual fault dynamics), uncertainty, external disturbances, and measurement noise and, secondly, Input-to-State Stability (ISS) of the estimation error dynamics is guaranteed in the presence of these perturbations. In addition, to support performance-based estimator design, we provide Linear Matrix Inequality (LMI) conditions for <span><math><msub><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>-gain and <span><math><mrow><msub><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>−</mo><msub><mrow><mi>L</mi></mrow><mrow><mi>∞</mi></mrow></msub></mrow></math></span> induced norm and cast the synthesis of the estimator gains as a semi-definite program where the effect of model mismatch and external disturbances on the fault estimation error is minimized in the sense of <span><math><msub><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>-gain, for an acceptable <span><math><mrow><msub><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>−</mo><msub><mrow><mi>L</mi></mrow><mrow><mi>∞</mi></mrow></msub></mrow></math></span> induced norm with respect to measurement noise. The latter result facilitates a design that explicitly addresses the performance trade-off between noise sensitivity and robustness against model mismatch and external disturbances. Finally, numerical results for a benchmark system illustrate the performance of the proposed methodologies.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142421274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A non-interior-point continuation method for the optimal control problem with equilibrium constraints","authors":"Kangyu Lin,&nbsp;Toshiyuki Ohtsuka","doi":"10.1016/j.automatica.2024.111940","DOIUrl":"10.1016/j.automatica.2024.111940","url":null,"abstract":"<div><div>This study presents a numerical method for the optimal control problem with equilibrium constraints (OCPEC). It is extremely difficult to solve OCPEC owing to the absence of constraint regularity and strictly feasible interior points. To solve OCPEC efficiently, we first relax the discretized OCPEC to recover the constraint regularity and then map its Karush–Kuhn–Tucker (KKT) conditions into a parameterized system of equations. Subsequently, we solve the parameterized system using a novel two-stage solution method called the non-interior-point continuation method. In the first stage, a non-interior-point method is employed to find an initial solution, which solves the parameterized system using Newton’s method and globalizes convergence using a dedicated merit function. In the second stage, a predictor–corrector continuation method is utilized to track the solution trajectory as a function of the parameter, starting at the initial solution. The proposed method regularizes the KKT matrix and does not enforce iterates to remain in the feasible interior, which mitigates the numerical difficulties in solving OCPEC. Convergence properties are analyzed under certain assumptions. Numerical experiments demonstrate that the proposed method can solve OCPEC while demanding remarkably less computation time than the interior-point method.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142421959","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"How do the lengths of switching intervals influence the stability of a dynamical system?","authors":"Vladimir Yu. Protasov ,&nbsp;Rinat Kamalov","doi":"10.1016/j.automatica.2024.111929","DOIUrl":"10.1016/j.automatica.2024.111929","url":null,"abstract":"<div><div>If a linear switching system with frequent switches is stable, will it be stable under arbitrary switches? In general, the answer is negative. Nevertheless, this question can be answered in an explicit form for any concrete system. This is done by finding the mode-dependent critical lengths of switching intervals after which any enlargement does not influence the stability. The solution is given in terms of the exponential polynomials of least deviation from zero on a segment (“Chebyshev-like” polynomials). By proving several theoretical results on exponential polynomial approximation we derive an algorithm for finding such polynomials and for computing the critical switching time. The convergence of the algorithm is estimated and numerical results are provided.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142421951","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}