发布求助
文献互助 智能选刊 最新文献

Automatica最新文献

筛选
英文 中文
Certified data-driven inverse reinforcement learning of Markov jump systems
IF 4.8 2区 计算机科学
Automatica Pub Date : 2025-03-18 DOI: 10.1016/j.automatica.2025.112239
Wenqian Xue , Frank L. Lewis , Bosen Lian
{"title":"Certified data-driven inverse reinforcement learning of Markov jump systems","authors":"Wenqian Xue ,&nbsp;Frank L. Lewis ,&nbsp;Bosen Lian","doi":"10.1016/j.automatica.2025.112239","DOIUrl":"10.1016/j.automatica.2025.112239","url":null,"abstract":"<div><div>This paper devises a data-driven off-policy inverse reinforcement learning algorithm for discrete-time linear Markov jump systems. Leveraging observed behaviors from multi-mode Markov jump systems optimized with respect to unknown mode-wise cost functions, our algorithm reconstructs each mode’s associated cost function and control policies. Our approach certifies mean-square asymptotic stability, unbiased convergence, and nonuniqueness. Notably, the proposed algorithm operates solely on demonstrated behavioral data, eliminating the need for system models, prior knowledge of transition probabilities, or initial control gains. The practical efficacy of our approach is validated.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"176 ","pages":"Article 112239"},"PeriodicalIF":4.8,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143642215","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
Consensus of multi-agent systems under binary-valued measurements: An event-triggered coordination approach
IF 4.8 2区 计算机科学
Automatica Pub Date : 2025-03-18 DOI: 10.1016/j.automatica.2025.112255
Xiaodong Lu , Ting Wang , Yanlong Zhao , Ji-Feng Zhang
{"title":"Consensus of multi-agent systems under binary-valued measurements: An event-triggered coordination approach","authors":"Xiaodong Lu ,&nbsp;Ting Wang ,&nbsp;Yanlong Zhao ,&nbsp;Ji-Feng Zhang","doi":"10.1016/j.automatica.2025.112255","DOIUrl":"10.1016/j.automatica.2025.112255","url":null,"abstract":"<div><div>This paper investigates the consensus problem of multi-agent systems. Owing to the effect of bandwidth restriction, the communication information between two adjacent agents is based on the binary-valued observation of the imprecise sender’s output, which is only 1-bit. Each agent employs the recursive projection algorithm to estimate the states of all neighbors. Then, an event-triggered coordination technique is proposed to address the consensus problem. The first characteristic of this technique is that the information data transmission between two adjacent agents is managed by an event-triggered scheduler. The second characteristic of this technique is that each agent adopts the event-triggered control protocol to achieve the ultimate target. By this technique, the estimation error and the consensus error can converge to zero in the mean square sense and in the almost sure sense with explicit convergence speeds. Moreover, the communication rate of the communication scheme between two adjacent agents does not exceed fifty percent. And the communication rate of the control scheme can almost surely converge to zero with an explicit rate. Compared with the existing results, these two communication rates can be extremely reduced when achieving the same convergence value. As a result, the communication resources can be saved in terms of quantization, communication and control. An example is presented to illustrate the advantage of the proposed technique.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"176 ","pages":"Article 112255"},"PeriodicalIF":4.8,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143643153","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
Wage rigidity and retirement in optimal portfolio choice
IF 4.8 2区 计算机科学
Automatica Pub Date : 2025-03-18 DOI: 10.1016/j.automatica.2025.112225
Sara Biagini , Enrico Biffis , Fausto Gozzi , Margherita Zanella
{"title":"Wage rigidity and retirement in optimal portfolio choice","authors":"Sara Biagini ,&nbsp;Enrico Biffis ,&nbsp;Fausto Gozzi ,&nbsp;Margherita Zanella","doi":"10.1016/j.automatica.2025.112225","DOIUrl":"10.1016/j.automatica.2025.112225","url":null,"abstract":"<div><div>We study an agent’s lifecycle portfolio choice problem with stochastic labor income, borrowing constraints and a finite retirement date. Similarly to Biffis et al. (2020), wages evolve in a path-dependent way, but the presence of a finite retirement time leads to a novel, two-stage infinite dimensional stochastic optimal control problem with explicit optimal controls in feedback form. We find an explicit solution to the associated Hamilton–Jacobi–Bellman (HJB) equation, which is an infinite dimensional PDE of parabolic type. The identification of the optimal feedbacks is delicate due to the presence of time-dependent state constraints, which appear to be new in the infinite dimensional stochastic control literature. The explicit solution allows us to study the properties of optimal strategies and discuss their implications for portfolio choice. As opposed to models with Markovian dynamics, path dependency can now modulate the hedging demand arising from the implicit holding of risky assets in human capital, leading to richer asset allocation predictions consistent with wage rigidity and the agents learning about their earning potential.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"176 ","pages":"Article 112225"},"PeriodicalIF":4.8,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143643152","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
Network combination to persistence of high-dimensional delayed complex balanced mass-action systems 从网络组合到高维延迟复杂平衡质量作用系统的持久性
IF 4.8 2区 计算机科学
Automatica Pub Date : 2025-03-15 DOI: 10.1016/j.automatica.2025.112256
Xiaoyu Zhang , Chuanhou Gao , Denis Dochain
{"title":"Network combination to persistence of high-dimensional delayed complex balanced mass-action systems","authors":"Xiaoyu Zhang ,&nbsp;Chuanhou Gao ,&nbsp;Denis Dochain","doi":"10.1016/j.automatica.2025.112256","DOIUrl":"10.1016/j.automatica.2025.112256","url":null,"abstract":"<div><div>Complex balanced mass-action systems (CBMASs) are of great importance in the field of biochemical systems. However, the increase in system dimensionality significantly amplifies the complexity of boundary cases, posing a considerable challenge for persistence analysis of CBMASs with or without time delays. To tackle this issue, we propose a method of network combination, wherein some high-dimensional delayed CBMAS (DeCBMAS) is regarded as a combination of sub-DeCBMASs that are of dimension lower than 2, according to a certain combination mode. By defining all combination modes as the intersection between semilocking sets and intersecting species sets, we further classify the complex and diverse boundaries brought about by high dimensions and resolve them by utilizing the boundaries of subsystems accordingly, which could not be resolved in previous work. This approach overcomes the bottleneck of persistence in high-dimensional DeCBMAS in some degree. The effectiveness of our proposed approach is also demonstrated through several examples, highlighting its practical applicability.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"176 ","pages":"Article 112256"},"PeriodicalIF":4.8,"publicationDate":"2025-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143629020","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 control theoretical approach to online constrained optimization
IF 4.8 2区 计算机科学
Automatica Pub Date : 2025-03-14 DOI: 10.1016/j.automatica.2024.112107
Umberto Casti , Nicola Bastianello , Ruggero Carli , Sandro Zampieri
{"title":"A control theoretical approach to online constrained optimization","authors":"Umberto Casti ,&nbsp;Nicola Bastianello ,&nbsp;Ruggero Carli ,&nbsp;Sandro Zampieri","doi":"10.1016/j.automatica.2024.112107","DOIUrl":"10.1016/j.automatica.2024.112107","url":null,"abstract":"<div><div>In this paper we focus on the solution of online problems with time-varying, linear equality and inequality constraints. Our approach is to design a novel online algorithm by leveraging the tools of control theory. In particular, for the case of equality constraints only, using robust control we design an online algorithm with asymptotic convergence to the optimal trajectory, differently from the alternatives that achieve non-zero tracking error. When also inequality constraints are present, we show how to modify the proposed algorithm to account for the wind-up induced by the nonnegativity constraints on the dual variables. We report numerical results that corroborate the theoretical analysis, and show how the proposed approach outperforms state-of-the-art algorithms both with equality and inequality constraints.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"176 ","pages":"Article 112107"},"PeriodicalIF":4.8,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143619115","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
Securing voltage stability in power grids via holomorphic dynamics
IF 4.8 2区 计算机科学
Automatica Pub Date : 2025-03-14 DOI: 10.1016/j.automatica.2025.112158
Bai Cui , Xu Andy Sun
{"title":"Securing voltage stability in power grids via holomorphic dynamics","authors":"Bai Cui ,&nbsp;Xu Andy Sun","doi":"10.1016/j.automatica.2025.112158","DOIUrl":"10.1016/j.automatica.2025.112158","url":null,"abstract":"<div><div>Voltage instability is a complex dynamic phenomenon in today’s electric power systems. The onset of voltage instability is usually related to the loss of proper solutions to the nonlinear power flow equations, which express the fundamental law governing electric power and voltages in a power grid. Thus, studying the solvability of the power flow equations is at the heart of the voltage stability problem. In this paper, we transform the solvability problem of the power flow equations to a stability problem of a discrete dynamical system defined by a holomorphic mapping in several complex variables. Then, we show a general result on the fixed points of holomorphic functions invariant in a polydisc. Using these analytical tools, we obtain a strong explicit condition that certifies the existence and uniqueness of a proper solution to the nonlinear power flow equations. The new condition reveals in a precise way the interplay between voltage instability, the electrical and topological structures of the power grid, and the electric load characteristics. The new condition is proven to be stronger than existing ones. Extensive computational experiments further demonstrate the strength of the proposed condition for securing real-time voltage stability of large-scale high-voltage electric transmission systems.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"176 ","pages":"Article 112158"},"PeriodicalIF":4.8,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143629104","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
Joint opacity and opacity against state-estimate-intersection-based intrusion of discrete-event systems
IF 4.8 2区 计算机科学
Automatica Pub Date : 2025-03-14 DOI: 10.1016/j.automatica.2025.112136
K. Ritsuka , Stéphane Lafortune , Feng Lin
{"title":"Joint opacity and opacity against state-estimate-intersection-based intrusion of discrete-event systems","authors":"K. Ritsuka ,&nbsp;Stéphane Lafortune ,&nbsp;Feng Lin","doi":"10.1016/j.automatica.2025.112136","DOIUrl":"10.1016/j.automatica.2025.112136","url":null,"abstract":"<div><div>This paper presents a general framework for joint opacity of discrete-event systems under partial observation. It discusses a class of state-estimate-intersection-based (SEI-based) intrusions that existing opacity conditions cannot prevent. The paper provides a procedure to verify the opacity of a system against such SEI-based intrusions. The results are formally verified by Isabelle/HOL.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"176 ","pages":"Article 112136"},"PeriodicalIF":4.8,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143619193","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
Optimal control over Markovian wireless communication channels under generalized packet dropout compensation
IF 4.8 2区 计算机科学
Automatica Pub Date : 2025-03-12 DOI: 10.1016/j.automatica.2025.112240
Yuriy Zacchia Lun , Francesco Smarra , Alessandro D’Innocenzo
{"title":"Optimal control over Markovian wireless communication channels under generalized packet dropout compensation","authors":"Yuriy Zacchia Lun ,&nbsp;Francesco Smarra ,&nbsp;Alessandro D’Innocenzo","doi":"10.1016/j.automatica.2025.112240","DOIUrl":"10.1016/j.automatica.2025.112240","url":null,"abstract":"<div><div>Control loops closed over wireless links greatly benefit from accurate estimates of the communication channel condition. To this end, the finite-state Markov channel model allows for reliable channel state estimation. This paper develops a Markov jump linear system representation for wireless networked control with persistent channel state observation, stochastic message losses, and generalized packet dropout compensation. With this model, we solve the finite- and infinite-horizon linear quadratic regulation problems and introduce an easy-to-test stability condition for any given infinite-horizon control law. We also thoroughly analyze the impact of a scalar general dropout compensation factor on the stability and closed-loop performance of a rotary inverted pendulum controlled remotely through a wireless link. Finally, we validate the results numerically via extensive Monte Carlo simulations, showing the benefits of the proposed control strategy.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"176 ","pages":"Article 112240"},"PeriodicalIF":4.8,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143609654","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
Bearing-only solution for Fermat–Weber location problem: Generalized algorithms
IF 4.8 2区 计算机科学
Automatica Pub Date : 2025-03-11 DOI: 10.1016/j.automatica.2025.112242
Nhat-Minh Le-Phan , Phuoc Doan Nguyen , Hyo-Sung Ahn , Minh Hoang Trinh
{"title":"Bearing-only solution for Fermat–Weber location problem: Generalized algorithms","authors":"Nhat-Minh Le-Phan ,&nbsp;Phuoc Doan Nguyen ,&nbsp;Hyo-Sung Ahn ,&nbsp;Minh Hoang Trinh","doi":"10.1016/j.automatica.2025.112242","DOIUrl":"10.1016/j.automatica.2025.112242","url":null,"abstract":"<div><div>This paper presents novel algorithms for the Fermat–Weber Location Problem, guiding an autonomous agent to the point that minimizes the weighted sum of Euclidean distances to some beacons using only bearing measurements. The current results address only the simple scenario where the beacons are stationary and the agent is modeled by a single integrator. In this paper, we present a number of bearing-only algorithms that let the agent follow the Fermat–Weber point of a group of stationary or moving beacons. Exponential and finite-time stability of the Fermat–Weber point are also established. The theoretical results are rigorously proven using Lyapunov theory and supported with simulation examples.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"176 ","pages":"Article 112242"},"PeriodicalIF":4.8,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143592327","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
Rank resilience of pattern matrices against structured perturbations with applications
IF 4.8 2区 计算机科学
Automatica Pub Date : 2025-03-10 DOI: 10.1016/j.automatica.2025.112236
Yuan Zhang, Yuanqing Xia, Gang Wang
{"title":"Rank resilience of pattern matrices against structured perturbations with applications","authors":"Yuan Zhang,&nbsp;Yuanqing Xia,&nbsp;Gang Wang","doi":"10.1016/j.automatica.2025.112236","DOIUrl":"10.1016/j.automatica.2025.112236","url":null,"abstract":"<div><div>In structured system theory, a pattern matrix is a matrix with entries either fixed to zero or free to take arbitrary numbers. The (generic) rank of a pattern matrix is the rank of almost all its realizations. The resilience of various system properties is closely tied to the rank resilience of the corresponding pattern matrices. Yet, existing literature predominantly explores the latter aspect by focusing on perturbations that change the zero–nonzero structure of pattern matrices, corresponding to link additions/deletions. In this paper, we consider the rank resilience of pattern matrices against structured perturbations that can arbitrarily alter the values of a prescribed set of entries, corresponding to link weight variations. We say a pattern matrix is structurally rank <span><math><mi>r</mi></math></span> resilient against a perturbation pattern if almost all realizations of this pattern matrix have a rank not less than <span><math><mi>r</mi></math></span> under arbitrary complex-valued realizations of the perturbation pattern. We establish a generic property in this concept. We then present combinatorial necessary and sufficient conditions for a rectangular pattern matrix to lose full rank under given perturbation patterns. We also generalize them to obtain a sufficient condition and a necessary one for losing an arbitrarily prescribed rank. We finally show our results can be applied to the resilience analysis of various properties of structured (descriptor) systems, including controllability and input-state observability, as well as characterizing zero structurally fixed modes.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"176 ","pages":"Article 112236"},"PeriodicalIF":4.8,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143580282","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信