Automatica最新文献_第5页

Fundamental structures of invariant dual subspaces with respect to a Boolean network

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-04-10 DOI: 10.1016/j.automatica.2025.112299

Dongyao Bi , Lijun Zhang , Kuize Zhang , Shenggui Zhang

{"title":"Fundamental structures of invariant dual subspaces with respect to a Boolean network","authors":"Dongyao Bi , Lijun Zhang , Kuize Zhang , Shenggui Zhang","doi":"10.1016/j.automatica.2025.112299","DOIUrl":"10.1016/j.automatica.2025.112299","url":null,"abstract":"<div><div>This paper presents the following research findings on a Boolean network (BN) and the invariant dual subspaces with respect to the BN. First, we establish a bijection between the dual subspaces over the BN’s state set <span><math><mi>X</mi></math></span> and the partitions of <span><math><mi>X</mi></math></span>. Furthermore, we prove that a dual subspace is <span><math><mi>M</mi></math></span>-invariant if and only if the associated partition of the BN’s state-transition graph is equitable (i.e., for every two cells of the partition, all states in the former cell have the same number of out-neighbors in the latter), where <span><math><mi>M</mi></math></span> represents the state transition matrix of the BN. Secondly, we leverage the concept of equitable graphic representation to develop a graphical algorithm for determining the smallest <span><math><mi>M</mi></math></span>-invariant dual subspaces generated by a set of Boolean functions. Based on this algorithm, we provide, for the first time, a complete structural characterization of these <span><math><mi>M</mi></math></span>-invariant dual subspaces. Finally, we prove that a BN with a given set of (Boolean) output functions is observable if and only if the partition corresponding to the smallest <span><math><mi>M</mi></math></span>-invariant dual subspace generated by this set of functions is discrete (i.e., all partition cells are singletons). Building upon our structural characterization, we introduce a method for constructing output functions that render the BN observable.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"177 ","pages":"Article 112299"},"PeriodicalIF":4.8,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143807860","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

Switching multiplicative watermark design against covert attacks

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-04-10 DOI: 10.1016/j.automatica.2025.112301

Alexander J. Gallo , Sribalaji C. Anand , Andre M.H. Teixeira , Riccardo M.G. Ferrari

引用次数: 0

Performance recovery in event-triggered control

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-04-10 DOI: 10.1016/j.automatica.2025.112295

Deniz Kurtoglu , Tansel Yucelen , Dzung Tran , David W. Casbeer , Eloy Garcia

引用次数: 0

Efficient iterative learning model predictive control for uncertain nonlinear discrete-time systems

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-04-10 DOI: 10.1016/j.automatica.2025.112306

Shuyu Zhang , Xiao-Dong Li , Xuefang Li

引用次数: 0

Stability and stabilization of piecewise homogeneous partially known hidden Markov jump linear systems

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-04-10 DOI: 10.1016/j.automatica.2025.112304

Yue-Yue Tao , Zheng-Guang Wu , Gang Feng

{"title":"Stability and stabilization of piecewise homogeneous partially known hidden Markov jump linear systems","authors":"Yue-Yue Tao , Zheng-Guang Wu , Gang Feng","doi":"10.1016/j.automatica.2025.112304","DOIUrl":"10.1016/j.automatica.2025.112304","url":null,"abstract":"<div><div>This brief deals with the asynchronous stabilization problem for discrete-time piecewise homogeneous Markov jump linear systems (MJLSs) with stochastic switching transition probabilities (TPs) that are governed by a higher-level Markov chain. Two practical scenarios are considered: (i) the modes of the system and its TP matrix cannot always be accurately detected, leading to the mismatched modes phenomenon; and (ii) the information of probability matrices cannot be fully obtained. First, we adopt a dual hidden Markov model (HMM) to characterize the mismatched modes phenomenon. It is expected that the feasibility of the established stability conditions for the resulting closed-loop system is enhanced because both observed modes are used in the design. Second, we allow all transition and observation probability (T/OP) matrices to be partially known, considering that some T/OPs cannot be obtained. We propose a novel nonconservative probability decoupling principle to deal with the simultaneous existence of unknown T/OPs, and we then obtain several novel stability conditions based on the probability decoupling principle. We also show that the obtained stability conditions recover some existing results in the literature as special cases without sacrifice of any conservatism. In the end, we use an example of an economic model to demonstrate the effectiveness of the proposed controller design method.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"177 ","pages":"Article 112304"},"PeriodicalIF":4.8,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143807863","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

A unifying framework for fixed-time input-to-state stability in stochastic systems

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-04-10 DOI: 10.1016/j.automatica.2025.112282

Rong-Heng Cui , Xue-Jun Xie

引用次数: 0

Tuning function based adaptive prescribed-time parameter estimation and tracking control design

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-04-10 DOI: 10.1016/j.automatica.2025.112285

Wenrui Shi , Christodoulos Keliris , Mingzhe Hou , Marios M. Polycarpou

{"title":"Tuning function based adaptive prescribed-time parameter estimation and tracking control design","authors":"Wenrui Shi , Christodoulos Keliris , Mingzhe Hou , Marios M. Polycarpou","doi":"10.1016/j.automatica.2025.112285","DOIUrl":"10.1016/j.automatica.2025.112285","url":null,"abstract":"<div><div>Most existing prescribed-time (PT) control results focus on the stabilization/regulation problem, with only a few results considering the tracking control problem. In this paper, an adaptive PT tracking control method is proposed for a class of strict feedback nonlinear systems with linearly parametric uncertainties which can be non-vanishing and include both matched and mismatched parts. By using the normalization technique and a novel cutoff function, a two-filter-based parameter estimation error reconstruction mechanism is designed. Furthermore, an improved tuning function based backstepping design solution is provided. Different from the classic tuning function based backstepping results, some additional terms which are designed through the reconstructed parameter estimation errors, are embedded into the virtual control laws, the actual control law and the adaptive laws. Moreover, in order to avoid potential numerical problems in the implementation of the scheme, a modified adaptive PT control scheme is proposed. Finally, two simulation examples are employed to illustrate the effectiveness of the proposed control method.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"177 ","pages":"Article 112285"},"PeriodicalIF":4.8,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143807862","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

Smooth finite-dimensional time-varying feedback for chained nonholonomic systems with distributed input delays

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-04-10 DOI: 10.1016/j.automatica.2025.112307

Kang-Kang Zhang , Xuefei Yang , Kai Zhang

引用次数: 0

Data-driven robust linear quadratic regulator: A minimax design using reinforcement learning

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-04-10 DOI: 10.1016/j.automatica.2025.112305

Haoran Ma , Zhengen Zhao , Ying Yang

{"title":"Data-driven robust linear quadratic regulator: A minimax design using reinforcement learning","authors":"Haoran Ma , Zhengen Zhao , Ying Yang","doi":"10.1016/j.automatica.2025.112305","DOIUrl":"10.1016/j.automatica.2025.112305","url":null,"abstract":"<div><div>This paper presents a minimax design approach based on model-free reinforcement learning (RL) to solve the robust linear quadratic regulator (LQR) problem. The proposed method derives a controller that guarantees stability and tends to be optimal as the data amount increases, even in the presence of unknown system dynamics. Initially, the robust LQR problem is transformed into a zero-sum differential game to minimize the worst linear quadratic cost in the system ensemble compatible with data containing Gaussian noise. Then, the RL algorithm is delineated, accompanied by the necessary and sufficient data condition for the existence of a unique solution, which is equivalent to the model-based minimax design solution. The RL-based controller can stabilize the original system with a high probability. Simultaneously, the sub-optimality gap between the controller’s performance and the optimal performance illustrates the asymptotic optimality of the controller. In addition to these attributes, the proposed method exhibits a distinct advantage in terms of computational efficiency. Simulations validate the effectiveness of the proposed method in terms of robustness, optimality, and run time.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"177 ","pages":"Article 112305"},"PeriodicalIF":4.8,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143807945","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

Coevolutionary dynamics of multidimensional opinions over coopetitive influence networks

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-04-10 DOI: 10.1016/j.automatica.2025.112279

Yangyang Luan , Xiaoqun Wu , Jinhu Lü

{"title":"Coevolutionary dynamics of multidimensional opinions over coopetitive influence networks","authors":"Yangyang Luan , Xiaoqun Wu , Jinhu Lü","doi":"10.1016/j.automatica.2025.112279","DOIUrl":"10.1016/j.automatica.2025.112279","url":null,"abstract":"<div><div>To better understand opinion dynamics on social networks, especially when antagonistic interactions exist, we propose a novel coevolution model of multidimensional opinions and coopetitive (cooperative–competitive) influence networks. In this model, agents update their opinions according to the designed multidimensional Altafini-type rule. Additionally, the asynchronous evolutionary dynamics of influence networks is formulated based on three well-established sociological mechanisms: symmetry, influence, and person-opinion homophily. Going beyond the limitations of existing models in explaining network structural evolution, we characterize the sign equilibria of the influence dynamics as equivalent to all possible fully connected structurally balanced configurations, and prove that the influence networks will almost surely converge to sign equilibria within finite time. Further, we claim convergence of the opinion dynamics model and systematically analyze the role of the set of logic matrices in determining the limiting opinion distribution. For irreducible logic matrices, agents’ opinions on each topic exhibit a bipartite consensus under conditions of structurally balanced logic matrices and no competing logical interdependencies. For reducible logic matrices, the scope of opinions on a topic within an open strongly connected component (SCC) is determined by that of the closed SCCs it connects to. Finally, we provide simulation examples to illustrate the theoretical results.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"177 ","pages":""},"PeriodicalIF":4.8,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143815393","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