IEEE Transactions on Control of Network Systems最新文献_第5页

Timer-Based Coverage Control for Mobile Sensors 基于定时器的移动传感器覆盖控制

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-07 DOI: 10.1109/TCNS.2025.3526717

Federico M. Zegers;Sean Phillips;Gregory P. Hicks

引用次数: 0

Cooperative Hierarchical Coverage Control of Multiagent Systems With Nonholonomic Constraints in Poriferous Environments 多孔环境下非完整约束多智能体系统的协同层次覆盖控制

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-06 DOI: 10.1109/TCNS.2025.3526566

Jiayu Zou;Hai-Tao Zhang;Chao Zhai;Ning Xing;Yong Ma;Xingjian Liu

{"title":"Cooperative Hierarchical Coverage Control of Multiagent Systems With Nonholonomic Constraints in Poriferous Environments","authors":"Jiayu Zou;Hai-Tao Zhang;Chao Zhai;Ning Xing;Yong Ma;Xingjian Liu","doi":"10.1109/TCNS.2025.3526566","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526566","url":null,"abstract":"It has long posed a challenging task to optimally deploy multiagent systems (MASs) to cooperatively coverage poriferous environments in real cooperative detection applications. In response to this challenge, this article proposes a hierarchical coverage control (HCC) protocol for MASs to perform sector-based coverage operations. First, a distributed Voronoi partition-based sweep-and-assign protocol, combined with a sectorial partition method, is developed, enabling the segmentation of a whole poriferous region into multiple sectorial sub-subregions. Following this procedure, an extreme search scheme is developed to determine the optimal amount of agents for each subregion. After this allocation, a distributed controller is proposed to deploy the agents, considering nonholonomic constraints, into designated niche positions. In addition, sufficient conditions are derived to guarantee the asymptotical stability of the present HCC. The analytical challenge of the present study stems from the nonconvex characteristics inherent in the loss function induced by porous environments. This nonconvexity renders the task of globally optimizing the assignment of MASs intractable. Finally, numerical simulations are conducted to validate the effectiveness of the present coverage control approach.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1512-1520"},"PeriodicalIF":4.0,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331578","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 Time-Varying Constrained Convex Optimization: Finite-Time/Fixed-Time Convergence 分布式时变约束凸优化：有限时间/固定时间收敛

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-06 DOI: 10.1109/TCNS.2025.3526324

Ge Guo;Zeng-Di Zhou;Renyongkang Zhang

引用次数: 0

Control of Multiagent Networks With Misbehaving Nodes Over Directed Graph Topologies 有向图拓扑上具有不良行为节点的多智能体网络控制

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-06 DOI: 10.1109/TCNS.2025.3526569

Emre Yildirim;Tansel Yucelen

{"title":"Control of Multiagent Networks With Misbehaving Nodes Over Directed Graph Topologies","authors":"Emre Yildirim;Tansel Yucelen","doi":"10.1109/TCNS.2025.3526569","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526569","url":null,"abstract":"In this article, we study multiagent networks over directed graph topologies involving nodes subject to exogenous disturbances (i.e., misbehaving nodes) and nodes that receive feedback control signals (i.e., driver nodes) for the purpose of suppressing the adverse effects of misbehaving nodes. The number of driver nodes can be less than the total number of nodes in the multiagent network. Specifically, we propose proportional–integral feedback controllers to be executed by driver nodes. These controllers guarantee the stability of the overall multiagent network in the sense of input-to-state stability (i.e., they make the resulting closed-loop system matrix Hurwitz). Furthermore, we utilize a graph-theoretical approach that allows users to find the steady-state values of critical nodes without requiring the knowledge of the Laplacian matrix of the overall multiagent network. The results presented in this article pave the way for understanding how driver nodes need to be selected to suppress the effect of misbehaving nodes on the neighborhood of critical nodes, which is further illustrated through illustrative numerical examples.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1521-1530"},"PeriodicalIF":4.0,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331614","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

Online and Offline Dynamic Influence Maximization Games Over Social Networks 基于社交网络的在线和离线动态影响最大化游戏

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-06 DOI: 10.1109/TCNS.2025.3526327

Melih Bastopcu;S. Rasoul Etesami;Tamer Başar

{"title":"Online and Offline Dynamic Influence Maximization Games Over Social Networks","authors":"Melih Bastopcu;S. Rasoul Etesami;Tamer Başar","doi":"10.1109/TCNS.2025.3526327","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526327","url":null,"abstract":"In this work, we consider dynamic influence maximization games over social networks with multiple players (influencers). At the beginning of each campaign opportunity, individuals' opinion dynamics take independent and identically distributed realizations based on an arbitrary distribution. Upon observing the realizations, influencers allocate some of their budgets to affect their opinion dynamics. Then, individuals' opinion dynamics evolve according to the well-known DeGroot model. In the end, influencers collect their reward based on the final opinion dynamics. Each influencer's goal is to maximize their own reward subject to their limited total budget rate constraints, leading to a dynamic game problem. We first consider the <italic>offline</i> and <italic>online</i> versions of a single influencer's optimization problem where the opinion dynamics and campaign durations are either known or not known a priori. Then, we consider the game formulation with multiple influencers in offline and online settings. For the offline setting, we show that the dynamic game admits a unique Nash equilibrium policy and provide a method to compute it. For the online setting and with two influencers, we show that if each influencer applies the same no-regret online algorithm proposed for the single-influencer maximization problem, they converge to the set of <inline-formula><tex-math>$epsilon$</tex-math></inline-formula>-Nash equilibrium policies where <inline-formula><tex-math>$epsilon =mathcal {O}(1/sqrt{K})$</tex-math></inline-formula> scales in average inversely with the number of campaign times <inline-formula><tex-math>$K$</tex-math></inline-formula> considering the influencers' average utilities. Moreover, we extend this result to any finite number of influencers under more strict requirements on the information structure.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1440-1453"},"PeriodicalIF":4.0,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331536","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

An Interval-Appointed Looped-Functional Approach for Switching Event-Triggered Systems With Input Saturation and Its Application to Memory-Based Event-Triggered Control 具有输入饱和的切换事件触发系统的区间指定环函数方法及其在基于记忆的事件触发控制中的应用

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-06 DOI: 10.1109/TCNS.2025.3526339

Zhen Wang;Yanyan Ni;Yingjie Fan;Jianwei Xia

{"title":"An Interval-Appointed Looped-Functional Approach for Switching Event-Triggered Systems With Input Saturation and Its Application to Memory-Based Event-Triggered Control","authors":"Zhen Wang;Yanyan Ni;Yingjie Fan;Jianwei Xia","doi":"10.1109/TCNS.2025.3526339","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526339","url":null,"abstract":"This article first presents an interval-appointed looped-functional approach for the stability of switching event-triggered (SET) control systems with input saturation. In order to improve the resource utilization of the networked control system while maintaining satisfactory system performance, a memory term and a dynamic triggering threshold are introduced into the existing SET scheme. Thus, a dynamic memory-based SET (DMSET) scheme is newly designed. To analyze the stability of the controlled system, a useful lemma is established in which an interval-appointed looped-functional is constructed, and a combined Lyapunov method is developed accordingly to derive a relaxed stability criterion. This method contributes to discarding the positive definiteness of certain Lyapunov matrices in the interval-appointed looped-functional and lays a groundwork for the stability analysis of other SET-based saturated control systems. As an application, an LMI-based less conservative stability criterion for DMSET control systems is then derived. Two optimization algorithms are given to maximize the estimates of the region of attraction and the permissible length of the sampling period, respectively. In the end, the advantages of the interval-appointed looped-functional approach and the DMSET scheme are demonstrated by two illustrative examples.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1478-1487"},"PeriodicalIF":4.0,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331534","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

Stability of Networked Evolutionary Games With Randomly Mixed Two-Level Reasoning 具有随机混合两级推理的网络进化博弈的稳定性

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-06 DOI: 10.1109/TCNS.2025.3526328

Jiahao Li;Yong Ding;Yuqian Guo;Weihua Gui

引用次数: 0

Lag Synchronization and Lag $mathcal {H}_{infty }$ Synchronization for Multiweighted Coupled Reaction–Diffusion Neural Networks Suffering Topology Attacks 受拓扑攻击的多加权耦合反应-扩散神经网络的滞后同步和滞后$mathcal {H}_{infty }$同步

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-06 DOI: 10.1109/TCNS.2025.3526322

Jin-Liang Wang;Xin-Yu Zhao;Shun-Yan Ren;Tingwen Huang

引用次数: 0

A Modified Distributed Gradient Dynamics for Multiagent Optimization on Directed Networks 有向网络多智能体优化的改进分布式梯度动力学

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-06 DOI: 10.1109/TCNS.2025.3526343

Mohammad Jahvani;Martin Guay

引用次数: 0

Deep and Decentralized Multiagent Coverage of a Target With Unknown Distribution 未知分布目标的深度分散多智能体覆盖

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-03 DOI: 10.1109/TCNS.2025.3525802

Hossein Rastgoftar

{"title":"Deep and Decentralized Multiagent Coverage of a Target With Unknown Distribution","authors":"Hossein Rastgoftar","doi":"10.1109/TCNS.2025.3525802","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3525802","url":null,"abstract":"This article proposes a new architecture for multiagent systems to cover an unknown distributed target quickly and safely and in a decentralized manner. The interagent communication is organized by a directed graph with a fixed topology. The author models agent coordination as a decentralized leader–follower problem with time-varying communication weights. Given this problem setting, the author first presents a method for converting the communication graph into a neural network, where an agent can be represented by a unique node of the communication graph but multiple neurons of the corresponding neural network. The author then applies a mass-centric strategy to train time-varying communication weights of the neural network in a decentralized fashion. This implies that the observation zone of every follower agent is independently assigned by the follower based on positions of its in-neighbors. By training the neural network, the author can ensure safe and decentralized multiagent coverage control. Despite the target is unknown to the agent team, the author provides a proof for convergence of the proposed multiagent coverage method. The functionality of the proposed method is validated by a large-scale multicopter team covering distributed targets on the ground.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1393-1405"},"PeriodicalIF":4.0,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331539","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