IEEE Control Systems Letters最新文献

筛选
英文 中文
Positive Consensus for Heterogeneous Multi-Agent Systems Over Jointly Connected Graphs 联合连接图上异构多代理系统的积极共识
IF 2.4
IEEE Control Systems Letters Pub Date : 2024-10-31 DOI: 10.1109/LCSYS.2024.3489392
Ruonan Li;Yichen Zhang;Yutao Tang;Shurong Li
{"title":"Positive Consensus for Heterogeneous Multi-Agent Systems Over Jointly Connected Graphs","authors":"Ruonan Li;Yichen Zhang;Yutao Tang;Shurong Li","doi":"10.1109/LCSYS.2024.3489392","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3489392","url":null,"abstract":"This letter studies the leader-following positive consensus for a group of heterogeneous multi-agent systems. The followers’ dynamics are allowed to be mutually different from each other and also the leader, while the communication graph is not required to be fixed or connected. To tackle this problem, we first present an extended distributed observer for positive multi-agent systems. By constructing a novel weak common linear copositive Lyapunov function (CLCLF), we show its effectiveness by rigorous proofs over jointly connected switching networks. Then, with the aid of the presented positive observer, we propose distributed controllers for the followers to reach the expected positive consensus with disturbance rejection. Finally, a numerical simulation is provided to illustrate the effectiveness of our proposed design.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"2451-2456"},"PeriodicalIF":2.4,"publicationDate":"2024-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142645489","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}
引用次数: 0
Logarithmically Quantized Distributed Optimization Over Dynamic Multi-Agent Networks 动态多代理网络上的对数量化分布式优化
IF 2.4
IEEE Control Systems Letters Pub Date : 2024-10-29 DOI: 10.1109/LCSYS.2024.3487796
Mohammadreza Doostmohammadian;Sérgio Pequito
{"title":"Logarithmically Quantized Distributed Optimization Over Dynamic Multi-Agent Networks","authors":"Mohammadreza Doostmohammadian;Sérgio Pequito","doi":"10.1109/LCSYS.2024.3487796","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3487796","url":null,"abstract":"Distributed optimization finds many applications in machine learning, signal processing, and control systems. In these real-world applications, the constraints of communication networks, particularly limited bandwidth, necessitate implementing quantization techniques. In this letter, we propose distributed optimization dynamics over multi-agent networks subject to logarithmically quantized data transmission. Under this condition, data exchange benefits from representing smaller values with more bits and larger values with fewer bits. As compared to uniform quantization, this allows for higher precision in representing near-optimal values and more accuracy of the distributed optimization algorithm. The proposed optimization dynamics comprise a primary state variable converging to the optimizer and an auxiliary variable tracking the objective function’s gradient. Our setting accommodates dynamic network topologies, resulting in a hybrid system requiring convergence analysis using matrix perturbation theory and eigenspectrum analysis.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"2433-2438"},"PeriodicalIF":2.4,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600208","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}
引用次数: 0
Direct Data-Driven Design of LPV Controllers and Polytopic Invariant Sets With Cross-Covariance Noise Bounds 直接数据驱动设计 LPV 控制器和具有交叉协方差噪声约束的多拓扑不变集
IF 2.4
IEEE Control Systems Letters Pub Date : 2024-10-28 DOI: 10.1109/LCSYS.2024.3487504
Manas Mejari;Valentina Breschi
{"title":"Direct Data-Driven Design of LPV Controllers and Polytopic Invariant Sets With Cross-Covariance Noise Bounds","authors":"Manas Mejari;Valentina Breschi","doi":"10.1109/LCSYS.2024.3487504","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3487504","url":null,"abstract":"We propose a direct data-driven method for the concurrent computation of polytopic robust control invariant (RCI) sets and the associated invariance-inducing control laws for linear parameter-varying (LPV) systems. We present a data-based covariance parameterization of the gain-scheduled controller and the closed-loop dynamics and show that by assuming bounded cross-covariance noise, the invariance condition can be formulated as a set of data-based LMIs such that the number of decision variables are independent of the length of the dataset. These LMIs are combined with polytopic state-input constraints in a convex semi-definite program to maximize the volume of the RCI set. A numerical example demonstrates the computational effectiveness of the proposed method in synthesizing RCI sets even with large datasets.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"2427-2432"},"PeriodicalIF":2.4,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600117","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}
引用次数: 0
Sampling in Parametric and Nonparametric System Identification: Aliasing, Input Conditions, and Consistency 参数和非参数系统识别中的采样:差分、输入条件和一致性
IF 2.4
IEEE Control Systems Letters Pub Date : 2024-10-28 DOI: 10.1109/LCSYS.2024.3487501
Rodrigo A. González;Max van Haren;Tom Oomen;Cristian R. Rojas
{"title":"Sampling in Parametric and Nonparametric System Identification: Aliasing, Input Conditions, and Consistency","authors":"Rodrigo A. González;Max van Haren;Tom Oomen;Cristian R. Rojas","doi":"10.1109/LCSYS.2024.3487501","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3487501","url":null,"abstract":"The sampling rate of input and output signals is known to play a critical role in the identification and control of dynamical systems. For slow-sampled continuous-time systems that do not satisfy the Nyquist-Shannon sampling condition for perfect signal reconstructability, careful consideration is required when identifying parametric and nonparametric models. In this letter, a comprehensive statistical analysis of estimators under slow sampling is performed. Necessary and sufficient conditions are obtained for unbiased estimates of the frequency response function beyond the Nyquist frequency, and it is shown that consistency of parametric estimators can be achieved even if input frequencies overlap after aliasing. Monte Carlo simulations confirm the theoretical properties.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"2415-2420"},"PeriodicalIF":2.4,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142587599","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}
引用次数: 0
Rationality of Learning Algorithms in Repeated Normal-Form Games 重复正态博弈中学习算法的合理性
IF 2.4
IEEE Control Systems Letters Pub Date : 2024-10-25 DOI: 10.1109/LCSYS.2024.3486631
Shivam Bajaj;Pranoy Das;Yevgeniy Vorobeychik;Vijay Gupta
{"title":"Rationality of Learning Algorithms in Repeated Normal-Form Games","authors":"Shivam Bajaj;Pranoy Das;Yevgeniy Vorobeychik;Vijay Gupta","doi":"10.1109/LCSYS.2024.3486631","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3486631","url":null,"abstract":"Many learning algorithms are known to converge to an equilibrium for specific classes of games if the same learning algorithm is adopted by all agents. However, when the agents are self-interested, a natural question is whether the agents have an incentive to unilaterally shift to an alternative learning algorithm. We capture such incentives as an algorithm’s rationality ratio, which is the ratio of the highest payoff an agent can obtain by unilaterally deviating from a learning algorithm to its payoff from following it. We define a learning algorithm to be c-rational if its rationality ratio is at most c irrespective of the game. We show that popular learning algorithms such as fictitious play and regret-matching are not c-rational for any constant \u0000<inline-formula> <tex-math>${mathrm { c}}geq 1$ </tex-math></inline-formula>\u0000. We also show that if an agent can only observe the actions of the other agents but not their payoffs, then there are games for which c-rational algorithms do not exist. We then propose a framework that can build upon any existing learning algorithm and establish, under mild assumptions, that our proposed algorithm is (i) c-rational for a given \u0000<inline-formula> <tex-math>${mathrm { c}}geq 1$ </tex-math></inline-formula>\u0000 and (ii) the strategies of the agents converge to an equilibrium, with high probability, if all agents follow it.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"2409-2414"},"PeriodicalIF":2.4,"publicationDate":"2024-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142573620","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}
引用次数: 0
Preventive-Reactive Defense Tradeoffs in Resource Allocation Contests 资源分配竞赛中的预防性-反应性防御权衡
IF 2.4
IEEE Control Systems Letters Pub Date : 2024-10-25 DOI: 10.1109/LCSYS.2024.3486629
Keith Paarporn;Shouhuai Xu
{"title":"Preventive-Reactive Defense Tradeoffs in Resource Allocation Contests","authors":"Keith Paarporn;Shouhuai Xu","doi":"10.1109/LCSYS.2024.3486629","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3486629","url":null,"abstract":"The connectivity enabled by modern computer networking technologies introduces vulnerabilities to adversarial attacks. Although it is ideal to be able to prevent all possible cyber attacks, this is not possible or feasible in practice and society must accept that attacks are inevitable. While many works study optimal security policies to minimize the chance of successful attacks, there are many unexplored territories. In this letter, we formulate and investigate a new problem, namely the tradeoff between the effort or resource that should be spent on preventing attacks (i.e., preventive defense) and the effort or resource that should be spent on recovering from attacks (i.e., reactive defense). We formulate the problem as a resource allocation game between the defender and the attacker, where they decide how to allocate resources to defend and attack a set nodes (e.g., computers), respectively. The game unfolds in two phases. (i) Allocate preventive resources to reduce the probabilities that the nodes are successfully compromised by the attacker. (ii) The compromised nodes undergo a recovery process, which can be sped up with the allocation of more reactive defense resources. Our results completely characterize the Nash equilibria of this game, revealing the defender’s optimal allocation of preventive versus reactive resources.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"2421-2426"},"PeriodicalIF":2.4,"publicationDate":"2024-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142587600","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}
引用次数: 0
Impact of Opinion on Disease Transmission With Waterborne Pathogen and Stubborn Community 水传播病原体和顽固群落对疾病传播的影响
IF 2.4
IEEE Control Systems Letters Pub Date : 2024-10-24 DOI: 10.1109/LCSYS.2024.3485963
Qingsong Liu;Li Ma
{"title":"Impact of Opinion on Disease Transmission With Waterborne Pathogen and Stubborn Community","authors":"Qingsong Liu;Li Ma","doi":"10.1109/LCSYS.2024.3485963","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3485963","url":null,"abstract":"How to control the spread of disease is a challenging problem for human beings, and one of the main reasons is the diversity of disease transmission pathways. Besides, the existing literature shows that community’s opinion plays an important role in controlling the spread of disease. However, the influence of opinions on disease transmission with a waterborne pathogen is unclear. In this letter, we propose a nonlinear dynamic system to analyze the impact of the opinion on disease transmission with a waterborne pathogen and stubborn community. The criteria for determining the global and local stability of the proposed dynamic system are established, respectively. Based on the real data and Email-Eu-Core network, our proposed dynamic system is utilized to show that only the proportion of infected individuals decreased, but diseases and a waterborne pathogen did not disappear, which is completely different from the existing result that the disease disappeared when stubborn communities are introduced.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"2391-2396"},"PeriodicalIF":2.4,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142555131","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}
引用次数: 0
Numerical and Lyapunov-Based Investigation of the Effect of Stenosis on Blood Transport Stability Using a Control-Theoretic PDE Model of Cardiovascular Flow 利用心血管流动的控制论 PDE 模型,基于数值和 Lyapunov 对狭窄对血液运输稳定性影响的研究
IF 2.4
IEEE Control Systems Letters Pub Date : 2024-10-23 DOI: 10.1109/LCSYS.2024.3484635
Shantanu Singh;Nikolaos Bekiaris-Liberis
{"title":"Numerical and Lyapunov-Based Investigation of the Effect of Stenosis on Blood Transport Stability Using a Control-Theoretic PDE Model of Cardiovascular Flow","authors":"Shantanu Singh;Nikolaos Bekiaris-Liberis","doi":"10.1109/LCSYS.2024.3484635","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3484635","url":null,"abstract":"We perform various numerical tests to study the effect of (boundary) stenosis on blood flow stability, employing a detailed and accurate, second-order finite-volume scheme for numerically implementing a partial differential equation (PDE) model, using clinically realistic values for the artery’s parameters and the blood inflow. The model consists of a baseline \u0000<inline-formula> <tex-math>$2times 2$ </tex-math></inline-formula>\u0000 hetero-directional, nonlinear hyperbolic PDE system, in which, the stenosis’ effect is described by a pressure drop at the outlet of an arterial segment considered. We then study the stability properties (observed in our numerical tests) of a reference trajectory, corresponding to a given time-varying inflow (e.g., a periodic trajectory with period equal to the time interval between two consecutive heartbeats) and stenosis severity, deriving the respective linearized system and constructing a Lyapunov functional. Due to the fact that the linearized system is time varying, with time-varying parameters depending on the reference trajectories themselves (that, in turn, depend in an implicit manner on the stenosis degree), which cannot be derived analytically, we verify the Lyapunov-based stability conditions obtained, numerically. Both the numerical tests and the Lyapunov-based stability analysis show that a reference trajectory is asymptotically stable with a decay rate that decreases as the stenosis severity deteriorates.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"2403-2408"},"PeriodicalIF":2.4,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142573618","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}
引用次数: 0
Higher-Order Non-Autonomous Optimal Area Coverage Control 高阶非自主优化区域覆盖控制
IF 2.4
IEEE Control Systems Letters Pub Date : 2024-10-18 DOI: 10.1109/LCSYS.2024.3483668
Qianyu Li;Davide Spinello
{"title":"Higher-Order Non-Autonomous Optimal Area Coverage Control","authors":"Qianyu Li;Davide Spinello","doi":"10.1109/LCSYS.2024.3483668","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3483668","url":null,"abstract":"We present an area coverage control algorithm for multi-agent systems with order-k Voronoi partitions. The system is non-autonomous due to the uncontrolled dynamics of external agents operating in the environment. Area coverage control is an optimal resource allocation problem in which optimal agents’ configurations are stationary points of a coverage metric, consisting of centroidal Voronoi tessellations. We consider time-evolving environments with order-k Voronoi partitions, where Voronoi cells are defined by k-nearest generator rules. This applies to scenarios in which it is necessary and/or desirable to assign \u0000<inline-formula> <tex-math>$kgt 1$ </tex-math></inline-formula>\u0000 agents to the trajectories of each cell. We prove that the proposed non-autonomous feedback control, with feed-forward dictated by the environment’s drift, asymptotically converges the agents to optimal centroidal order-k Voronoi configurations. Theoretical predictions are illustrated in simulation.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"2439-2444"},"PeriodicalIF":2.4,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600209","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}
引用次数: 0
Almost Sure Convergence and Non-Asymptotic Concentration Bounds for Stochastic Mirror Descent Algorithm 随机镜像后裔算法的几乎确定收敛性和非渐近集中限界
IF 2.4
IEEE Control Systems Letters Pub Date : 2024-10-16 DOI: 10.1109/LCSYS.2024.3482148
Anik Kumar Paul;Arun D. Mahindrakar;Rachel K. Kalaimani
{"title":"Almost Sure Convergence and Non-Asymptotic Concentration Bounds for Stochastic Mirror Descent Algorithm","authors":"Anik Kumar Paul;Arun D. Mahindrakar;Rachel K. Kalaimani","doi":"10.1109/LCSYS.2024.3482148","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3482148","url":null,"abstract":"This letter investigates the convergence and concentration properties of the Stochastic Mirror Descent (SMD) algorithm utilizing biased stochastic subgradients. We establish the almost sure convergence of the algorithm’s iterates under the assumption of diminishing bias. Furthermore, we derive concentration bounds for the discrepancy between the iterates’ function values and the optimal value, based on standard assumptions. Subsequently, leveraging the assumption of Sub-Gaussian noise in stochastic subgradients, we present refined concentration bounds for this discrepancy.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"2397-2402"},"PeriodicalIF":2.4,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142565636","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}
引用次数: 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学术官方微信