Automatica最新文献

英文中文

Input-to-state stabilization of endemic models for uncertainty of transmission, inflows, and immunity waning

IF 4.8 2区计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS

Automatica

Pub Date : 2025-02-03 DOI: 10.1016/j.automatica.2025.112167

Hiroshi Ito

To mitigate the impact of infectious diseases spread, feedback decision that effectively adjusts the control amount making use of current data has been anticipated. In general, feedback control design is based on models, which are inherently subject to inaccuracy and uncertainty. Control theory seeks robustness guarantees that do not rely on the model perfection which is usually required for prediction purposes. To provide such a key, this paper deals with uncertainty of disease transmission and waning immunity as well as uncertain inflows from neighboring regions. New feedback control laws are proposed to achieve robustness in the framework of input-to-state stabilization (ISS) by governing societal activity levels, vaccination, and isolation. The control addresses endemic situations, which are more practical and mathematically much harder than disease-free situations. To go beyond Jacobian linearization and local analysis, the proposed control covers the entire space of population variables by articulating the achievable globalness mathematically. The preceding ISS-based studies cannot cope with waning immunity no matter how small the waning rate is since it gives rise to supply and dissipation in different growth orders in their formulation. This paper demonstrates how a Lyapunov function and control laws can be constructed to coordinate the orders.

{"title":"Input-to-state stabilization of endemic models for uncertainty of transmission, inflows, and immunity waning","authors":"Hiroshi Ito","doi":"10.1016/j.automatica.2025.112167","DOIUrl":"10.1016/j.automatica.2025.112167","url":null,"abstract":"<div><div>To mitigate the impact of infectious diseases spread, feedback decision that effectively adjusts the control amount making use of current data has been anticipated. In general, feedback control design is based on models, which are inherently subject to inaccuracy and uncertainty. Control theory seeks robustness guarantees that do not rely on the model perfection which is usually required for prediction purposes. To provide such a key, this paper deals with uncertainty of disease transmission and waning immunity as well as uncertain inflows from neighboring regions. New feedback control laws are proposed to achieve robustness in the framework of input-to-state stabilization (ISS) by governing societal activity levels, vaccination, and isolation. The control addresses endemic situations, which are more practical and mathematically much harder than disease-free situations. To go beyond Jacobian linearization and local analysis, the proposed control covers the entire space of population variables by articulating the achievable globalness mathematically. The preceding ISS-based studies cannot cope with waning immunity no matter how small the waning rate is since it gives rise to supply and dissipation in different growth orders in their formulation. This paper demonstrates how a Lyapunov function and control laws can be constructed to coordinate the orders.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"174 ","pages":"Article 112167"},"PeriodicalIF":4.8,"publicationDate":"2025-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143130480","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}

引用次数: 0

Robust adaptive consensus of perturbed Euler–Lagrange agents with unknown time varying disturbances

IF 4.8 2区计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS

Automatica

Pub Date : 2025-02-03 DOI: 10.1016/j.automatica.2025.112170

Jose Guadalupe Romero , Romeo Ortega , Emmanuel Nuño , Alexey Bobtsov

In this paper we consider the problem of leaderless consensus for networks of fully actuated Euler–Lagrange agents perturbed by unknown additive disturbances. The network is an undirected weighted graph with time delays. The proposed controller has a PD structure that incorporates the estimate of the unknown time varying disturbance, which is included in the control signal to cancel it. To the best of our knowledge, this is the first time that this disturbance cancellation approach is adopted for this problem. The design of the disturbance estimator proceeds along the following steps. First, the estimation of the unknown frequencies and then the reconstruction of the initial conditions of the disturbance internal model—an essential piece in the estimation of the actual additive disturbance. To reduce the excitation requirements of the proposed interlaced estimators, we use a recently introduced least-squares plus dynamic regressor extension algorithm that ensures convergence imposing extremely weak excitation assumptions. In this way, we derive a sufficient condition on the proportional and derivative gains of the controller to ensure that the systems globally and asymptotically converge to a consensus position. The efficacy of the proposed method is shown in a numerical simulation using a network of 4 robotic manipulators.

{"title":"Robust adaptive consensus of perturbed Euler–Lagrange agents with unknown time varying disturbances","authors":"Jose Guadalupe Romero , Romeo Ortega , Emmanuel Nuño , Alexey Bobtsov","doi":"10.1016/j.automatica.2025.112170","DOIUrl":"10.1016/j.automatica.2025.112170","url":null,"abstract":"<div><div>In this paper we consider the problem of leaderless <em>consensus</em> for networks of fully actuated Euler–Lagrange agents perturbed by <em>unknown</em> additive disturbances. The network is an undirected weighted graph with time delays. The proposed controller has a PD structure that incorporates the estimate of the unknown time varying disturbance, which is included in the control signal to cancel it. To the best of our knowledge, this is the first time that this <em>disturbance cancellation</em> approach is adopted for this problem. The design of the disturbance estimator proceeds along the following steps. First, the estimation of the unknown <em>frequencies</em> and then the reconstruction of the <em>initial conditions</em> of the disturbance internal model—an essential piece in the estimation of the actual additive disturbance. To reduce the excitation requirements of the proposed interlaced estimators, we use a recently introduced least-squares plus dynamic regressor extension algorithm that ensures convergence imposing extremely weak excitation assumptions. In this way, we derive a sufficient condition on the proportional and derivative gains of the controller to ensure that the systems globally and asymptotically converge to a consensus position. The efficacy of the proposed method is shown in a numerical simulation using a network of 4 robotic manipulators.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"174 ","pages":"Article 112170"},"PeriodicalIF":4.8,"publicationDate":"2025-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143130718","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}

引用次数: 0

Decentralised adaptive-gain control for eliminating epidemic spreading on networks

IF 4.8 2区计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS

Automatica

Pub Date : 2025-02-01 DOI: 10.1016/j.automatica.2025.112143

Liam Walsh , Mengbin Ye , Brian D.O. Anderson , Zhiyong Sun

This paper considers the classical Susceptible–Infected–Susceptible (SIS) network epidemic model, which describes a disease spreading through

n

nodes, with the network links governing the possible transmission pathways of the disease between nodes. We consider feedback control to eliminate the disease, focusing especially on scenarios where the disease would otherwise persist in an uncontrolled network. We propose a family of decentralised adaptive-gain control algorithms, in which each node has a control gain that adaptively evolves according to a differential equation, independent of the gains of other nodes. The adaptive gain is applied multiplicatively to either decrease the infection rate or increase the recovery rate. To begin, we assume all nodes are controlled with adaptive gains, and prove that both infection rate control and recovery rate control algorithms eliminate the disease with positive finite limiting gains. Then, we consider the possibility of controlling a subset of the nodes, for both the infection rate control and recovery rate control. We first identify a necessary and sufficient condition for the existence of a subset of nodes, which if controlled would result in the elimination of the disease. For a given network, there may exist several such viable subsets, and we propose an iterative algorithm to identify such a subset. Simulations demonstrate the effectiveness of the proposed controllers.

{"title":"Decentralised adaptive-gain control for eliminating epidemic spreading on networks","authors":"Liam Walsh , Mengbin Ye , Brian D.O. Anderson , Zhiyong Sun","doi":"10.1016/j.automatica.2025.112143","DOIUrl":"10.1016/j.automatica.2025.112143","url":null,"abstract":"<div><div>This paper considers the classical Susceptible–Infected–Susceptible (SIS) network epidemic model, which describes a disease spreading through <span><math><mi>n</mi></math></span> nodes, with the network links governing the possible transmission pathways of the disease between nodes. We consider feedback control to eliminate the disease, focusing especially on scenarios where the disease would otherwise persist in an uncontrolled network. We propose a family of decentralised adaptive-gain control algorithms, in which each node has a control gain that adaptively evolves according to a differential equation, independent of the gains of other nodes. The adaptive gain is applied multiplicatively to either decrease the infection rate or increase the recovery rate. To begin, we assume all nodes are controlled with adaptive gains, and prove that both infection rate control and recovery rate control algorithms eliminate the disease with positive finite limiting gains. Then, we consider the possibility of controlling a subset of the nodes, for both the infection rate control and recovery rate control. We first identify a necessary and sufficient condition for the existence of a subset of nodes, which if controlled would result in the elimination of the disease. For a given network, there may exist several such viable subsets, and we propose an iterative algorithm to identify such a subset. Simulations demonstrate the effectiveness of the proposed controllers.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"174 ","pages":"Article 112143"},"PeriodicalIF":4.8,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143130485","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}

引用次数: 0

Delay-margin design in consensus for high-order integrator agents

IF 4.8 2区计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS

Automatica

Pub Date : 2025-02-01 DOI: 10.1016/j.automatica.2025.112173

Pedro Trindade, Pedro Batista, Rita Cunha

This paper analyzes the consensus problem for agents modeled with any number of integrators when these are subject to constant time-delays and interact over a directed network. Concretely, it provides convergence criteria that are used to devise a systematic methodology for designing the coupling gains of the consensus protocols. Such design is performed in a way that the multi-agent system attains a prescribed delay-margin (the maximum delay such that consensus is achieved), which can be made arbitrarily large at the cost of reducing the convergence rate. To that end, a modal decomposition is used to split the dynamics into fundamental modes and reduce the consensus problem to a stability problem. Frequency domain tools are then exploited to analyze stability and provide a unified approach to the consensus problem with constant time-delays. Initially, the proposed methodology is applied to design coupling gains for high-order consensus protocols. Then, the analysis focuses on first-, second- and third-order consensus protocols due to their high practical applicability, and explicit bounds on the coupling gains are derived. Finally, the proposed methodology is illustrated with examples.

{"title":"Delay-margin design in consensus for high-order integrator agents","authors":"Pedro Trindade, Pedro Batista, Rita Cunha","doi":"10.1016/j.automatica.2025.112173","DOIUrl":"10.1016/j.automatica.2025.112173","url":null,"abstract":"<div><div>This paper analyzes the consensus problem for agents modeled with any number of integrators when these are subject to constant time-delays and interact over a directed network. Concretely, it provides convergence criteria that are used to devise a systematic methodology for designing the coupling gains of the consensus protocols. Such design is performed in a way that the multi-agent system attains a prescribed delay-margin (the maximum delay such that consensus is achieved), which can be made arbitrarily large at the cost of reducing the convergence rate. To that end, a modal decomposition is used to split the dynamics into fundamental modes and reduce the consensus problem to a stability problem. Frequency domain tools are then exploited to analyze stability and provide a unified approach to the consensus problem with constant time-delays. Initially, the proposed methodology is applied to design coupling gains for high-order consensus protocols. Then, the analysis focuses on first-, second- and third-order consensus protocols due to their high practical applicability, and explicit bounds on the coupling gains are derived. Finally, the proposed methodology is illustrated with examples.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"174 ","pages":"Article 112173"},"PeriodicalIF":4.8,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143130481","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}

引用次数: 0

Comments on “Distributed optimization of multi-integrator agent systems with mixed neighbor interactions” [Automatica 157 (2023) 111245 ]

IF 4.8 2区计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS

Automatica

Pub Date : 2025-02-01 DOI: 10.1016/j.automatica.2024.112007

Jiaxu Liu , Song Chen

This note aims to identify and rectify the flaws found in the proof of Chen et al. (2023), specifically in Lemma 2, Lemma 3, Theorem 1, and Theorem 2. While the conclusions of Lemma 2, Lemma 3, and Theorem 1 remain valid, certain aspects of their proofs are found to be flawed. This note provides modifications to address these flaws. Additionally, the statement and proof of Theorem 2 are shown to be incorrect. A corrected Theorem 2 with proof is given.

引用次数: 0

Authors’ Reply to ‘Comments on “Distributed optimization of multi-integrator agent systems with mixed neighbor interactions” [Automatica 157 (2023) 111245]’

IF 4.8 2区计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS

Automatica

Pub Date : 2025-02-01 DOI: 10.1016/j.automatica.2024.112008

Zhao Chen, Xiaohong Nian, Qing Meng

引用次数: 0

Boundary control and observer design via backstepping for a coupled parabolic–elliptic system

IF 4.8 2区计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS

Automatica

Pub Date : 2025-02-01 DOI: 10.1016/j.automatica.2025.112154

Ala’ Alalabi, Kirsten Morris

Stabilization of a coupled system consisting of a parabolic partial differential equation and an elliptic partial differential equation is considered. Even in a situation where the parabolic equation is exponentially stable on its own, the coupling between the two equations can cause instability in the overall system. A backstepping approach is used to derive a single boundary control input that stabilizes the coupled system. The result is an explicit expression for the stabilizing control law. The second part of the paper involves the design of exponentially convergent observers to estimate the state of the coupled system, given some partial boundary measurements. The observation error system is shown to be exponentially stable, again using a backstepping method. This leads to the design of observer gains in closed-form. Finally, the output feedback problem is addressed by combining the observers with the state feedback boundary control. The theoretical results are demonstrated with numerical simulations.

引用次数: 0

Functional interval estimation for continuous-time linear systems with time-invariant uncertainties

IF 4.8 2区计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS

Automatica

Pub Date : 2025-02-01 DOI: 10.1016/j.automatica.2024.112017

Youdao Ma , Zhenhua Wang , Nacim Meslem , Tarek Raïssi

This paper investigates functional interval estimation for continuous-time linear systems subject to both time-varying and time-invariant uncertainties. Two novel methods are proposed based on peak-to-peak functional observer design and interval analysis. First, we present a splitting-based method that splits the estimation error dynamics into two subsystems to handle the time-invariant disturbances and provide accurate estimation results. Then, to further enhance the estimation accuracy, we present an augmentation-based method that considers the time invariance in both functional observer design and reliable interval estimation. The relationship between a state-of-art method and the proposed methods are analysed theoretically. Finally, simulation results are provided to demonstrate the performances of the proposed methods.

引用次数: 0

Data-driven invariant set for nonlinear systems with application to command governors

IF 4.8 2区计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS

Automatica

Pub Date : 2025-02-01 DOI: 10.1016/j.automatica.2024.112010

Ali Kashani, Claus Danielson

This paper presents a novel approach to synthesize positive invariant sets for unmodeled nonlinear systems using direct data-driven techniques. The data-driven invariant sets are used to design a data-driven command governor that selects a command for the closed-loop system to enforce constraints. Using basis functions, we solve a semi-definite program to learn a sum-of-squares Lyapunov-like function whose unity level-set is a constraint admissible positive invariant set, which determines the constraint admissible states and input commands. Leveraging Lipschitz properties of the system, we prove that tightening the model-based design ensures robustness of the invariant set to the inherent plant uncertainty in a data-driven framework. To mitigate the curse-of-dimensionality, we repose the semi-definite program into a linear program. We validate our approach through two examples: First, we present an illustrative example where we can analytically compute the maximum positive invariant set and compare with the presented data-driven invariant set. Second, we present a practical autonomous driving scenario to demonstrate the utility of the presented method for nonlinear systems.

{"title":"Data-driven invariant set for nonlinear systems with application to command governors","authors":"Ali Kashani, Claus Danielson","doi":"10.1016/j.automatica.2024.112010","DOIUrl":"10.1016/j.automatica.2024.112010","url":null,"abstract":"<div><div>This paper presents a novel approach to synthesize positive invariant sets for unmodeled nonlinear systems using direct data-driven techniques. The data-driven invariant sets are used to design a data-driven command governor that selects a command for the closed-loop system to enforce constraints. Using basis functions, we solve a semi-definite program to learn a sum-of-squares Lyapunov-like function whose unity level-set is a constraint admissible positive invariant set, which determines the constraint admissible states and input commands. Leveraging Lipschitz properties of the system, we prove that tightening the model-based design ensures robustness of the invariant set to the inherent plant uncertainty in a data-driven framework. To mitigate the curse-of-dimensionality, we repose the semi-definite program into a linear program. We validate our approach through two examples: First, we present an illustrative example where we can analytically compute the maximum positive invariant set and compare with the presented data-driven invariant set. Second, we present a practical autonomous driving scenario to demonstrate the utility of the presented method for nonlinear systems.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"172 ","pages":"Article 112010"},"PeriodicalIF":4.8,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143095092","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}

引用次数: 0

Event-triggered stabilization of uncertain switched linear systems under finite feedback bit rate

IF 4.8 2区计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS

Automatica

Pub Date : 2025-02-01 DOI: 10.1016/j.automatica.2024.111988

Jin Zhu , Zhi Xie , Geir E. Dullerud

This paper investigates event-triggered stabilization of uncertain switched linear systems under finite feedback bit rate where the boundary of model uncertainty is unknown. Based on the appropriate boundary estimation, a novel communication and control strategy is given to obtain qualified feedback gains and visible system states in which the event-triggering mechanism is adopted. By utilizing the additional timing information carried by the triggering moments, the proposed event-triggering controller can achieve a lower occupation of average bit rate to ensure exponential convergence of the system state. Simulation results show the effectiveness of our method.

引用次数: 0

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Automatica

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀