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

IEEE Transactions on Control of Network Systems最新文献

筛选
英文 中文
Dynamic Quantized Output-Feedback Control of Impulsive Systems With Round-Robin Protocols and Transmission Delays 具有轮循协议和传输延迟的脉冲系统的动态量化输出反馈控制
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-07-24 DOI: 10.1109/TCNS.2024.3432952
Meng Yao;Guoliang Wei;Derui Ding
{"title":"Dynamic Quantized Output-Feedback Control of Impulsive Systems With Round-Robin Protocols and Transmission Delays","authors":"Meng Yao;Guoliang Wei;Derui Ding","doi":"10.1109/TCNS.2024.3432952","DOIUrl":"10.1109/TCNS.2024.3432952","url":null,"abstract":"In this article, the output-feedback control problem is investigated for a class of impulsive systems under dynamic quantization, communication delays, and round-robin protocols. The main purpose of employing the dynamic quantization mechanism and round-robin protocols is to overcome the limited bandwidth of the communication networks and save communication resources. Moreover, the network-induced transmission delays are considered, which result in the final closed-loop system as an impulsive delayed one. With the help of the constructed impulse-time-delayed Lyapunov functional, a new sufficient condition is developed to guarantee the exponential stability of the addressed system. Subsequently, the expected output-feedback controller gains are derived by applying the semipositive programming method. Finally, illustrative examples are proposed to examine the practicality and effectiveness of our constructed control strategy.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"114-124"},"PeriodicalIF":4.0,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distributed Nash Equilibrium Seeking for Games in Uncertain Nonlinear Systems via Adaptive Backstepping Approach 通过自适应反步进方法为不确定非线性系统中的博弈寻求分布式纳什均衡
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-07-23 DOI: 10.1109/TCNS.2024.3432825
Qingtan Meng;Qian Ma
{"title":"Distributed Nash Equilibrium Seeking for Games in Uncertain Nonlinear Systems via Adaptive Backstepping Approach","authors":"Qingtan Meng;Qian Ma","doi":"10.1109/TCNS.2024.3432825","DOIUrl":"10.1109/TCNS.2024.3432825","url":null,"abstract":"In this article, we investigate the distributed Nash equilibrium seeking for games in a class of uncertain nonlinear systems, in which players communicate with their neighbors via a strongly connected and weight-balanced digraph. First, consensus-based adaptive Nash equilibrium seeking is studied for first-order nonlinear systems with parameter uncertainties. The case of high-order systems with mismatched parameter uncertainties and nonlinearities is then considered, and a distributed adaptive Nash equilibrium seeking algorithm is designed by incorporating the celebrated adaptive backstepping technique. Under the Lyapunov stability analysis, it is proved that the players' actions can globally asymptotically converge to the Nash equilibrium by the proposed seeking strategies. Finally, simulation results show the validness of the seeking strategies.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"1188-1198"},"PeriodicalIF":4.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Switching Performance Index-Driven Escaping–Chasing Control of Networked Control Systems Under Triggered DoS Attacks 触发式 DoS 攻击下网络控制系统的交换性能指标驱动的逃逸-追逐控制
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-07-23 DOI: 10.1109/TCNS.2024.3432646
Ning Xing;Hai-Tao Zhang
{"title":"A Switching Performance Index-Driven Escaping–Chasing Control of Networked Control Systems Under Triggered DoS Attacks","authors":"Ning Xing;Hai-Tao Zhang","doi":"10.1109/TCNS.2024.3432646","DOIUrl":"10.1109/TCNS.2024.3432646","url":null,"abstract":"In this article, an escaping–chasing control problem under triggered denial-of-service (DoS) attacks is addressed. A switching performance index-driven escaping–chasing path planning method is designed, and the tracking error systems are accordingly established. The analytical challenge lies in the tricky coupling between the performance index-driven and the DoS attack-driven switches. To this end, with the assistance of the average dwell time analytical method, the restrictions on both the DoS attack intensity and the switching frequency between “chasing unawareness” and “chasing awareness” are given to guarantee finite-time capturing of the chaser. Finally, simulations are conducted to verify the effectiveness of the proposed escaping–chasing control method.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"1115-1124"},"PeriodicalIF":4.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Game Theory Analysis of Decentralized Epidemic Management With Opinion Dynamics 具有舆论动态的分散式流行病管理的博弈论分析
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-07-23 DOI: 10.1109/TCNS.2024.3432821
Olivier Lindamulage De Silva;Samson Lasaulce;Irinel-Constantin Morărescu;Vineeth S. Varma
{"title":"A Game Theory Analysis of Decentralized Epidemic Management With Opinion Dynamics","authors":"Olivier Lindamulage De Silva;Samson Lasaulce;Irinel-Constantin Morărescu;Vineeth S. Varma","doi":"10.1109/TCNS.2024.3432821","DOIUrl":"10.1109/TCNS.2024.3432821","url":null,"abstract":"In this article, we introduce a static game that allows one to numerically assess the loss of efficiency induced by decentralized control or management of a global epidemic. Each player represents a region, which is assumed to choose its control to implement a tradeoff between socioeconomic aspects and health aspects; the control comprises both epidemic control physical measures and influence actions on the region's opinion. The generalized Nash equilibrium (GNE) analysis of the proposed game model is conducted. The direct analysis of this game of practical interest is nontrivial, but it turns out that one can construct an auxiliary game that allows one to prove existence and uniqueness and to compute the GNE and the optimal centralized solution (sum cost) of the game. These results allow us to assess numerically the loss (measured in terms of price of anarchy) induced by decentralization with or without taking into account the opinion dynamics.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"1137-1149"},"PeriodicalIF":4.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distributed Optimal Resource Allocation for High-Order Nonlinear Multiagent Systems Over Unbalanced Digraphs 非平衡数图上高阶非线性多代理系统的分布式最优资源分配
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-07-23 DOI: 10.1109/TCNS.2024.3432817
Zeli Zhao;Jinliang Ding;Jin-Xi Zhang;Yang Shi;Tianyou Chai
{"title":"Distributed Optimal Resource Allocation for High-Order Nonlinear Multiagent Systems Over Unbalanced Digraphs","authors":"Zeli Zhao;Jinliang Ding;Jin-Xi Zhang;Yang Shi;Tianyou Chai","doi":"10.1109/TCNS.2024.3432817","DOIUrl":"10.1109/TCNS.2024.3432817","url":null,"abstract":"In this article, we consider the distributed optimal resource allocation problem with multiple coupled equality constraints for strict-feedback multiagent systems (MASs) over unbalanced digraphs. To solve this problem, a novel integrated distributed control strategy consisting of a set of optimal reference generators and a group of tracking controllers is proposed. The reference generator is based on the estimation of the left eigenvector of the Laplacian matrix and is suitable for unbalanced digraphs. Moreover, the backstepping design technique is efficiently combined with the distributed optimization scheme, leading to a systematic solution for the high-order nonlinear MAS. It is proven that all the outputs of the MAS exponentially converge to the optimal solution of the resource allocation problem under the proposed control. Compared with the existing optimal resource allocation strategies for MASs, the proposed control strategy is applicable to high-order nonlinear MASs and shows favorable exponential convergence, even for unbalanced digraphs. Finally, the simulation results illustrate the above-mentioned theoretical findings.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"51-63"},"PeriodicalIF":4.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Rendezvous Control for a Double-Integrator Multiparticle System on Lorentz Group $SO(1,1)$ 洛伦兹群$SO(1,1)$上双积分器多粒子系统的交会控制
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-07-23 DOI: 10.1109/TCNS.2024.3432251
Xiaoyu Li;Lining Ru;Yuhu Wu
{"title":"Rendezvous Control for a Double-Integrator Multiparticle System on Lorentz Group $SO(1,1)$","authors":"Xiaoyu Li;Lining Ru;Yuhu Wu","doi":"10.1109/TCNS.2024.3432251","DOIUrl":"10.1109/TCNS.2024.3432251","url":null,"abstract":"In this article, we study the rendezvous problem for a double-integrator multiparticle system under a proximity-based communication topology on the Lorentz group <inline-formula><tex-math>$SO(1,1)$</tex-math></inline-formula>. With the help of the Riemannian manifold structure on the Lorentz group <inline-formula><tex-math>$SO(1,1)$</tex-math></inline-formula>, we design a rendezvous controller for particles by using the covariant derivative, parallel transport, and Riemannian logarithm map on <inline-formula><tex-math>$SO(1,1)$</tex-math></inline-formula>. We further show that the proposed controller can guarantee that the distance between each particle converges to zero and maintain the connectivity of the communication topology if the initial network is connected. Several numerical simulations are provided to verify and illustrate the theoretical results.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"1091-1101"},"PeriodicalIF":4.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778267","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distributed Average Consensus via Noisy and Noncoherent Over-the-Air Aggregation 通过噪声和非相干空中聚合实现分布式平均共识
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-07-23 DOI: 10.1109/TCNS.2024.3432827
Huiwen Yang;Xiaomeng Chen;Lingying Huang;Subhrakanti Dey;Ling Shi
{"title":"Distributed Average Consensus via Noisy and Noncoherent Over-the-Air Aggregation","authors":"Huiwen Yang;Xiaomeng Chen;Lingying Huang;Subhrakanti Dey;Ling Shi","doi":"10.1109/TCNS.2024.3432827","DOIUrl":"10.1109/TCNS.2024.3432827","url":null,"abstract":"Over-the-air aggregation has attracted widespread attention for its potential advantages in task-oriented applications, such as distributed sensing, learning, and consensus. In this article, we develop a communication-efficient distributed average consensus protocol by utilizing over-the-air aggregation, which exploits the superposition property of wireless channels rather than combat it. Noisy channels and noncoherent transmission are taken into account, and only half-duplex transceivers are required. We prove that the system can achieve average consensus in mean square and even almost surely under the proposed protocol. Furthermore, we extend the analysis to the scenarios with time-varying topology. Numerical simulation shows the effectiveness of the proposed protocol.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"64-73"},"PeriodicalIF":4.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778275","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Active Disturbance Rejection Formation Control for Multiagent Systems With Input Constraints 有输入约束的多代理系统的主动干扰抑制编队控制
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-07-23 DOI: 10.1109/TCNS.2024.3432823
Caoyuan Gu;Xiang Wu;Wen-An Zhang;Hongjie Ni;Steven X. Ding
{"title":"Active Disturbance Rejection Formation Control for Multiagent Systems With Input Constraints","authors":"Caoyuan Gu;Xiang Wu;Wen-An Zhang;Hongjie Ni;Steven X. Ding","doi":"10.1109/TCNS.2024.3432823","DOIUrl":"10.1109/TCNS.2024.3432823","url":null,"abstract":"This article deals with the formation control of multiagent systems (MASs) subject to disturbances and input constraints, and an active disturbance rejection formation control (ADRFC) approach based on distributed observation is proposed. First, the states and disturbances of tracking error systems are estimated by a distributed intermediate estimator (DIE). Second, an improved distributed model-predictive control (IDMPC) is proposed to achieve the formation control of MASs under disturbances and input constraints. Then, the robust ADRFC method is designed by combining the DIE and IDMPC, and the stability of the whole system is analyzed. Finally, experiments are conducted on an MAS consisting of four mobile robots to illustrate the effectiveness and superiority of the proposed method.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"38-50"},"PeriodicalIF":4.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distributed Bang–Bang Control for Multitrain Systems With Self-Adjusting Zones and Communication Delays 具有自调整区域和通信延迟的多列车系统的分布式 Bang-Bang 控制
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-07-23 DOI: 10.1109/TCNS.2024.3432172
Mengxiang Zeng;Peng Lin
{"title":"Distributed Bang–Bang Control for Multitrain Systems With Self-Adjusting Zones and Communication Delays","authors":"Mengxiang Zeng;Peng Lin","doi":"10.1109/TCNS.2024.3432172","DOIUrl":"10.1109/TCNS.2024.3432172","url":null,"abstract":"In real applications, the expected distances between adjacent trains are usually not fixed values, but some specific intervals called “self-adjusting zones” in this article. This article is devoted to address the cooperative control problem of multitrain systems with self-adjusting zones, constraints, communication delays, and collision avoidance. To enhance the rapidity of the systems, a distributed bang–bang control algorithm is introduced with communication delays. It is shown that all trains will eventually achieve stable operation with a desired velocity while remaining in the self-adjusting zones in the absence of communication delays or remaining in the neighborhood of the self-adjusting zones in the presence of communication delays. The analysis is mainly based on linear equivalent transformations of the sign functions and constraints, and the convexity of stochastic matrices. Finally, numerical examples show the effectiveness of the proposed algorithm.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"1062-1070"},"PeriodicalIF":4.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778266","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Pseudorange Rigidity and Solvability of Cooperative GNSS Positioning 伪范围刚度与全球导航卫星系统合作定位的可解决性
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-07-23 DOI: 10.1109/TCNS.2024.3432831
Colin Cros;Pierre-Olivier Amblard;Christophe Prieur;Jean-François Da Rocha
{"title":"Pseudorange Rigidity and Solvability of Cooperative GNSS Positioning","authors":"Colin Cros;Pierre-Olivier Amblard;Christophe Prieur;Jean-François Da Rocha","doi":"10.1109/TCNS.2024.3432831","DOIUrl":"10.1109/TCNS.2024.3432831","url":null,"abstract":"Global Navigation Satellite Systems (GNSS) are a widely used technology for positioning and navigation. GNSS positioning relies on pseudorange measurements from satellites to receivers. A pseudorange is the apparent distance between two agents deduced from the time-of-flight of a signal sent from one agent to the other, because of the lack of synchronization between the agents' clocks, it is a biased version of their distance. In this article, we introduce a new rigidity theory adapted to pseudorange measurements. The peculiarity of pseudoranges is that they are asymmetrical measurements. Therefore, unlike other usual rigidities, the graphs of pseudorange frameworks are directed. In this article, pseudorange rigidity is proved to be a generic property of the underlying undirected graph of constraints. The main result is a characterization of rigid pseudorange graphs as combinations of rigid distance graphs and connected graphs. This new theory is adapted for GNSS. It provides new insights into the minimum number of satellites needed to locate a receiver and is applied to the localization of GNSS cooperative networks of receivers. The interests of asymmetrical constraints in the context of formation control are also discussed.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"1176-1187"},"PeriodicalIF":4.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"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学术官方微信