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

Forced Symmetric Formation Control 强制对称编队控制

IF 4 3区计算机科学

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

Daniel Zelazo;Shin-ichi Tanigawa;Bernd Schulze

引用次数: 0

Live Streaming Synchronization Using Event-Triggered Consensus Control 使用事件触发共识控制的实时流同步

IF 4 3区计算机科学

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

Gioacchino Manfredi;Vito Andrea Racanelli;Luca De Cicco;Saverio Mascolo

{"title":"Live Streaming Synchronization Using Event-Triggered Consensus Control","authors":"Gioacchino Manfredi;Vito Andrea Racanelli;Luca De Cicco;Saverio Mascolo","doi":"10.1109/TCNS.2025.3525769","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3525769","url":null,"abstract":"The advent of social media applications and mobile devices has allowed users to experience live streaming events (e.g., a football match) together, even if they are not in the same physical place. However, this service brings along the issue of ensuring a synchronized video playback among geographically distributed users. Users leave comments and reactions to an online live event on social networks. As a consequence, an unsynchronized video playback can be easily noticed and be detrimental to users' feelings of togetherness. In this work, we propose a distributed control approach to achieve synchronization among users. In particular, the well-known consensus problem of first-order integrators with saturated inputs is employed to design a distributed playback synchronization framework. Furthermore, we propose a leader–follower approach to ensure a controlled synchronization among users in order to obtain the least possible delay with respect to the video content provider. Finally, an event-triggered control is introduced as an enhancement to the previously developed control with the aim of reducing the information exchanged among users. Simulations on different network topologies confirm that the proposed approach is effective at enforcing asymptotic synchronization.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1381-1392"},"PeriodicalIF":4.0,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331585","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

Minimal Sensor Placement for Generic State and Unknown Input Observability 通用状态和未知输入可观测性的最小传感器配置

IF 4 3区计算机科学

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

Ranbo Cheng;Yuan Zhang;Amin Md Al;Yuanqing Xia

{"title":"Minimal Sensor Placement for Generic State and Unknown Input Observability","authors":"Ranbo Cheng;Yuan Zhang;Amin Md Al;Yuanqing Xia","doi":"10.1109/TCNS.2025.3525838","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3525838","url":null,"abstract":"This article addresses the problem of selecting the minimum number of dedicated sensors to achieve observability in the presence of unknown inputs, namely, the state and input observability, for linear time-invariant systems. We assume that the only available information is the zero–nonzero structure of system matrices, and approach this problem within a structured system model. We revisit the concept of state and input observability for structured systems, providing refined necessary and sufficient conditions for placing dedicated sensors via the Dulmage–Mendelsohn decomposition. Based on these conditions, we prove that determining the minimum number of dedicated sensors to achieve generic state and input observability is NP-hard, which contrasts sharply with the polynomial-time complexity of the corresponding problem with known inputs. We also demonstrate that this problem is hard to approximate within a factor of <inline-formula><tex-math>$(1-o(1))mathrm{{log}}(n)$</tex-math></inline-formula>, where <inline-formula><tex-math>$n$</tex-math></inline-formula> is the state dimension. Notwithstanding, we propose nontrivial upper and lower bounds that can be computed in polynomial time, which confine the optimal value of this problem to an interval with length being the number of inputs. We further present a special case for which the exact optimal value can be determined in polynomial time. In addition, we propose a two-stage algorithm to solve this problem approximately. Each stage of the algorithm is either optimal or suboptimal and can be completed in polynomial time.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1427-1439"},"PeriodicalIF":4.0,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331612","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

Discrete-Time Leader-Following Multiagent Systems: Saturation Constraints and Event-Triggered Control 离散时间先导跟随多智能体系统：饱和约束和事件触发控制

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-12-12 DOI: 10.1109/TCNS.2024.3516578

Yicheng Xu;Faryar Jabbari

引用次数: 0

Consensus of High-Order Multiagent Systems With Binary-Valued Communications and Switching Topologies 具有二值通信和交换拓扑的高阶多智能体系统的一致性

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-12-12 DOI: 10.1109/TCNS.2024.3516582

Ru An;Ying Wang;Yanlong Zhao;Ji-Feng Zhang

{"title":"Consensus of High-Order Multiagent Systems With Binary-Valued Communications and Switching Topologies","authors":"Ru An;Ying Wang;Yanlong Zhao;Ji-Feng Zhang","doi":"10.1109/TCNS.2024.3516582","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3516582","url":null,"abstract":"This article studies the consensus problem of high-order multiagent systems (MASs) with binary-valued communications and switching topologies. To tackle the challenge of unknown states caused by binary-valued communications, this article constructs an estimation-based consensus algorithm. First, a recursive projection identification algorithm is presented to estimate the neighbors' states dynamically. Then, based on these estimates, a consensus law is designed. By constructing and analyzing two combined Lyapunov functions about estimation error and state error, this article establishes their relation to overcome the difficulty resulting from the coupling of the estimation and control and less information due to switching topologies. Under the condition of jointly connected topologies, it is proven that by properly selecting the step coefficient, the estimates of states can converge to the true states with a convergence rate as the reciprocal of the recursion times. Besides, the MAS is proved to achieve weak consensus and the consensus rate is also established as the reciprocal of the recursion times. Finally, a simulation example is given to validate the algorithm.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1369-1380"},"PeriodicalIF":4.0,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331575","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

Virtual Leader and Distance-Based Formation Control With Funnel Constraints 漏斗约束下的虚拟领导者与基于距离的编队控制

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-12-12 DOI: 10.1109/TCNS.2024.3516559

Maria Charitidou;Dimos V. Dimarogonas

引用次数: 0

Distributed Optimal Contract for Data Rewarding With Network Effects 具有网络效应的数据奖励分布式最优契约

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-12-09 DOI: 10.1109/TCNS.2024.3515002

Alireza Baneshi;Mina Montazeri;Hamed Kebriaei

引用次数: 0

Distributed Multiagent Reinforcement Learning With One-Hop Neighbors and Compute Straggler Mitigation 具有一跳邻居的分布式多智能体强化学习与离散者缓解计算

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-12-04 DOI: 10.1109/TCNS.2024.3511400

Baoqian Wang;Junfei Xie;Nikolay Atanasov

{"title":"Distributed Multiagent Reinforcement Learning With One-Hop Neighbors and Compute Straggler Mitigation","authors":"Baoqian Wang;Junfei Xie;Nikolay Atanasov","doi":"10.1109/TCNS.2024.3511400","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3511400","url":null,"abstract":"Most multiagent reinforcement learning (MARL) methods are limited in the scale of problems they can handle. With increasing numbers of agents, the number of training iterations required to find the optimal behaviors increases exponentially due to the exponentially growing joint state and action spaces. This article tackles this limitation by introducing a scalable MARL method called distributed multiagent reinforcement learning with one-hop neighbors (DARL1N). DARL1N is an off-policy actor–critic method that addresses the curse of dimensionality by restricting information exchanges among the agents to one-hop neighbors when representing value and policy functions. Each agent optimizes its value and policy functions over a one-hop neighborhood, significantly reducing the learning complexity, yet maintaining expressiveness by training with varying neighbor numbers and states. This structure allows us to formulate a distributed learning framework to further speed up the training procedure. Distributed computing systems, however, contain <italic>straggler</i> compute nodes, which are slow or unresponsive due to communication bottlenecks, software problems, or hardware problems. To mitigate the detrimental straggler effect, we introduce a novel coded distributed learning architecture, which leverages coding theory to improve the resilience of the learning system to stragglers. Comprehensive experiments show that DARL1N significantly reduces training time without sacrificing policy quality and is scalable as the number of agents increases. Moreover, the coded distributed learning architecture improves training efficiency in the presence of stragglers.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1300-1312"},"PeriodicalIF":4.0,"publicationDate":"2024-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331639","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

Extremum Seeking Tracking for Derivative-Free Distributed Optimization 无导数分布优化的极值求跟踪

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-12-03 DOI: 10.1109/TCNS.2024.3510368

Nicola Mimmo;Guido Carnevale;Andrea Testa;Giuseppe Notarstefano

引用次数: 0

Consensus-Based Distributed Optimization for Multiagent Systems Over Multiplex Networks 基于共识的多智能体网络分布式优化

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-12-03 DOI: 10.1109/TCNS.2024.3510602

Christian David Rodríguez-Camargo;Andrés F. Urquijo-Rodríguez;Eduardo Mojica-Nava

{"title":"Consensus-Based Distributed Optimization for Multiagent Systems Over Multiplex Networks","authors":"Christian David Rodríguez-Camargo;Andrés F. Urquijo-Rodríguez;Eduardo Mojica-Nava","doi":"10.1109/TCNS.2024.3510602","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3510602","url":null,"abstract":"Multilayer networks provide a more comprehensive framework for exploring real-world and engineering systems than traditional single-layer networks consisting of multiple interacting networks. However, despite significant research on distributed optimization for single-layer networks, similar progress is lacking for multilayer systems. This article proposes two algorithms for distributed optimization problems in multiplex networks using the supra-Laplacian matrix and its diffusion dynamics. The algorithms include a distributed saddle-point algorithm and its variation as a distributed gradient descent algorithm. By relating consensus and diffusion dynamics, we obtain the multiplex supra-Laplacian matrix. We extend the distributed gradient descent algorithm for multiplex networks using this matrix and analyze the convergence of both algorithms with several theoretical results. Numerical examples validate our proposed algorithms, and we explore the impact of interlayer diffusion on consensus time. We also present a coordinated dispatch for interdependent infrastructure networks (energy–gas) to demonstrate the application of the proposed framework to real engineering problems.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"1040-1051"},"PeriodicalIF":4.0,"publicationDate":"2024-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143667364","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