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

Clock Synchronization With Unknown and Unmodeled Disturbances Over Distributed Networks 分布式网络上未知和未建模干扰的时钟同步

IF 4 3区计算机科学

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

Ke Fang;Jianqi Chen;Junfeng Wu

{"title":"Clock Synchronization With Unknown and Unmodeled Disturbances Over Distributed Networks","authors":"Ke Fang;Jianqi Chen;Junfeng Wu","doi":"10.1109/TCNS.2024.3463399","DOIUrl":"10.1109/TCNS.2024.3463399","url":null,"abstract":"The clock synchronization problem has garnered significant attention in the field of multiagent systems due to its aim of establishing a common and reliable framework for facilitating cooperation among different agents. In contrast to previous studies, our primary focus lies in addressing the following question: When we lack prior knowledge about disturbances, what synchronization performance can we achieve compared to a hindsight-based approach? To tackle this challenge, we introduce the concept of <italic>regret</i> as a metric to model and quantify our problem, independent of any assumptions regarding disturbances. We define regret as the measure of deviation from an ideal synchronization outcome. Furthermore, we prove that the problem inherently possesses a lower bound of regret, which remains unaffected by disturbances. By appropriately setting the regret requirement, we can transform the problem into an <inline-formula><tex-math>$mathcal {H}_infty$</tex-math></inline-formula> optimal control problem equivalently, which allows us to determine the corresponding synchronization strategy. Through simulations, we validate the effectiveness of our method, demonstrating its superiority over existing approaches.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"262-274"},"PeriodicalIF":4.0,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142254963","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 Distributed Proximal Alternating Direction Multiplier Method for Multiblock Nonsmooth Composite Optimization 多块非光滑复合优化的分布式近端交替方向乘法器方法

IF 4 3区计算机科学

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

Yuan Zhou;Luyao Guo;Xinli Shi;Jinde Cao

{"title":"A Distributed Proximal Alternating Direction Multiplier Method for Multiblock Nonsmooth Composite Optimization","authors":"Yuan Zhou;Luyao Guo;Xinli Shi;Jinde Cao","doi":"10.1109/TCNS.2024.3462519","DOIUrl":"10.1109/TCNS.2024.3462519","url":null,"abstract":"In this article, we address a composite optimization problem in a distributed network. Each agent in the network possesses a private local convex function consisting of a differentiable term, a nonsmooth term, and a nonsmooth term combined with a linear operator. The objective is to minimize the sum of all local functions while achieving consensus among the local states through information exchange with neighboring agents. To tackle this problem, we propose a novel distributed proximal alternating direction multiplier method (ADMM). By introducing the proximal operator of the nonsmooth term, linearizing the smooth term, and incorporating an additional proximal term, the ADMM subproblem can be solved more efficiently. One key advantage of the proposed algorithm is that it allows each agent to select parameters without being constrained by the network topology. In some instances, the algorithm can be transformed into some classical optimization algorithms. The algorithm is further extended to an asynchronous version by introducing randomized block coordinate. We further analyze the convergence of the proposed asynchronous algorithm and establish the sublinear convergence rate under synchronous conditions. Finally, several numerical experiments are conducted to verify the effectiveness of the proposed algorithm.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"202-215"},"PeriodicalIF":4.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142254964","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

Learning Nonlinear Couplings in Network of Agents From a Single Sample Trajectory 从单个样本轨迹学习代理网络中的非线性耦合

IF 4 3区计算机科学

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

Arash Amini;Qiyu Sun;Nader Motee

引用次数: 0

Refined Algorithms for Adaptive Optimal Output Regulation and Adaptive Optimal Cooperative Output Regulation Problems 自适应最优输出调节和自适应最优合作输出调节问题的改进算法

IF 4 3区计算机科学

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

Liquan Lin;Jie Huang

{"title":"Refined Algorithms for Adaptive Optimal Output Regulation and Adaptive Optimal Cooperative Output Regulation Problems","authors":"Liquan Lin;Jie Huang","doi":"10.1109/TCNS.2024.3462549","DOIUrl":"10.1109/TCNS.2024.3462549","url":null,"abstract":"Given a linear unknown system with <inline-formula><tex-math>$m$</tex-math></inline-formula> inputs, <inline-formula><tex-math>$p$</tex-math></inline-formula> outputs, <inline-formula><tex-math>$n$</tex-math></inline-formula>-dimensional state vector, and <inline-formula><tex-math>$q$</tex-math></inline-formula>-dimensional exosystem, the problem of the adaptive optimal output regulation of this system boils down to iteratively solving a set of linear equations and each of these equations contains <inline-formula><tex-math>$frac{n (n+1)}{2} + (m+q)n$</tex-math></inline-formula> unknown variables. A problem with a moderate size may entail forming and then solving a few hundreds of such linear equations. Thus, the computational cost of solving such a problem can be formidable. In this article, we first improve the existing algorithm by decoupling each of these linear equations into two lower dimensional linear equations. The first one contains <inline-formula><tex-math>$nq$</tex-math></inline-formula> unknown variables, and the second one contains <inline-formula><tex-math>$frac{n (n+1)}{2} + mn$</tex-math></inline-formula> unknown variables. Thus, this improved algorithm reduces a linear equation with <inline-formula><tex-math>$frac{n (n+1)}{2} + (m+q)n$</tex-math></inline-formula> unknown variables to a linear equation with <inline-formula><tex-math>$nq$</tex-math></inline-formula> unknown variables and a linear equation with <inline-formula><tex-math>$frac{n (n+1)}{2} + mn$</tex-math></inline-formula> unknown variables. As a result, not only the computational cost of the problem is drastically reduced but also the solvability conditions for these equations are significantly weakened. Moreover, we also apply this improved algorithm to the adaptive cooperative optimal output regulation of linear multiagent unknown systems and reduce the computational cost of the problem more saliently.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"241-250"},"PeriodicalIF":4.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142254967","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

Robust Formation Control of Robot Manipulators With Interagent Constraints Over Undirected Signed Networks 无向符号网络上具有代理间约束的机器人机械手鲁棒编队控制

IF 4 3区计算机科学

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

Pelin Şekercioğlu;Bayu Jayawardhana;Ioannis Sarras;Antonio Loría;Julien Marzat

引用次数: 0

On Privacy Preservation of Distributed Energy Resource Optimization in Power Distribution Networks 论配电网络中分布式能源资源优化的隐私保护

IF 4 3区计算机科学

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

Xiang Huo;Mingxi Liu

引用次数: 0

Security Allocation in Networked Control Systems Under Stealthy Attacks 隐形攻击下网络控制系统的安全分配

IF 4 3区计算机科学

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

Anh Tung Nguyen;André M. H. Teixeira;Alexander Medvedev

{"title":"Security Allocation in Networked Control Systems Under Stealthy Attacks","authors":"Anh Tung Nguyen;André M. H. Teixeira;Alexander Medvedev","doi":"10.1109/TCNS.2024.3462546","DOIUrl":"10.1109/TCNS.2024.3462546","url":null,"abstract":"In this article, we consider the problem of security allocation in a networked control system under stealthy attacks. The system is comprised of interconnected subsystems represented by vertices. A malicious adversary selects a single vertex on which to conduct a stealthy data injection attack with the purpose of maximally disrupting a distant target vertex while remaining undetected. Defense resources against the adversary are allocated by a defender on several selected vertices. First, the objectives of the adversary and the defender with uncertain targets are formulated in a probabilistic manner, resulting in an expected worst-case impact of stealthy attacks. Next, we provide a graph-theoretic necessary and sufficient condition under which the cost for the defender and the expected worst-case impact of stealthy attacks are bounded. This condition enables the defender to restrict the admissible actions to dominating sets of the graph representing the network. Then, the security allocation problem is solved through a Stackelberg game-theoretic framework. Finally, the obtained results are validated through a numerical example of a 50-vertex networked control system.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"216-227"},"PeriodicalIF":4.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142254966","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

Leaky Forcing in Graphs for Resilient Controllability in Networks 图中的泄漏强迫，实现网络的弹性可控性

IF 4 3区计算机科学

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

Waseem Abbas

{"title":"Leaky Forcing in Graphs for Resilient Controllability in Networks","authors":"Waseem Abbas","doi":"10.1109/TCNS.2024.3457582","DOIUrl":"10.1109/TCNS.2024.3457582","url":null,"abstract":"In this article, the author studies resilient strong structural controllability (SSC) in networks with misbehaving agents and edges. The author considers various misbehavior models and identifies the set of input agents offering resilience against such disruptions. The author's approach leverages a graph-based characterization of SSC, utilizing the concept of zero forcing in graphs. Specifically, the author examines three misbehavior models that disrupt the zero forcing process and compromise network SSC. The author then characterizes a leader set that guarantees SSC despite misbehaving nodes and edges, utilizing the concept of leaky forcing—a variation of zero forcing in graphs. The author's main finding reveals that resilience against one misbehavior model inherently provides resilience against others, thus simplifying the design process. Furthermore, the author explores combining multiple networks by augmenting edges between their nodes to achieve SSC in the combined network using a reduced leader set compared to the leader sets of individual networks. The author analyzes the tradeoff between added edges and leader set size in the resulting combined graph. Finally, the author discusses computational aspects and provides numerical evaluations to demonstrate the effectiveness of the author's approach.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"190-201"},"PeriodicalIF":4.0,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142202383","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

On the Dynamic Behavior of the Network SIR Epidemic Model 论网络 SIR 流行病模型的动态行为

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-08-22 DOI: 10.1109/TCNS.2024.3448136

Martina Alutto;Leonardo Cianfanelli;Giacomo Como;Fabio Fagnani

{"title":"On the Dynamic Behavior of the Network SIR Epidemic Model","authors":"Martina Alutto;Leonardo Cianfanelli;Giacomo Como;Fabio Fagnani","doi":"10.1109/TCNS.2024.3448136","DOIUrl":"10.1109/TCNS.2024.3448136","url":null,"abstract":"In this article, we study a susceptible–infected–recovered (SIR) epidemic model on a network of <inline-formula><tex-math>$n$</tex-math></inline-formula> interacting subpopulations. We analyze the transient and asymptotic behavior of the infection dynamics in each node of the network. In contrast to the classical scalar epidemic SIR model, where the infection curve is known to be unimodal (either always decreasing over time, or initially increasing until reaching a peak and from then on monotonically decreasing and asymptotically vanishing), we show the possible occurrence of multimodal infection curves in the network SIR epidemic model with <inline-formula><tex-math>$ngeq 2$</tex-math></inline-formula> subpopulations. We then focus on the special case of rank-1 interaction matrices, modeling subpopulations of homogeneously mixing individuals with different activity rates, susceptibility to the disease, and infectivity levels. For this special case, we find <inline-formula><tex-math>$n$</tex-math></inline-formula> invariants of motion and provide an explicit expression for the limit equilibrium point. We also determine necessary and sufficient conditions for stability of the equilibrium points. We then establish an upper bound on the number of changes of monotonicity of the infection curve at the single node level and provide sufficient conditions for its multimodality. Finally, we present some numerical results revealing that in the case of interaction matrices with rank larger than 1, the single nodes' infection curves may display multiple peaks.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"177-189"},"PeriodicalIF":4.0,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142202384","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

Protocol-Based Control for Hidden Markov Jump Systems With Incomplete Transition Descriptions Against Injection Attacks

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-08-20 DOI: 10.1109/TCNS.2024.3446696

Yuan Wang;Huaicheng Yan;Ju H. Park;Hao Zhang;Hao Shen

{"title":"Protocol-Based Control for Hidden Markov Jump Systems With Incomplete Transition Descriptions Against Injection Attacks","authors":"Yuan Wang;Huaicheng Yan;Ju H. Park;Hao Zhang;Hao Shen","doi":"10.1109/TCNS.2024.3446696","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3446696","url":null,"abstract":"This article aims to design the dynamic event-triggered protocol for hidden Markov jump systems subject to injection attacks. We initially introduce the hidden Markov model (HMM), which accommodates incomplete transition descriptions found in both the transition probability matrix and the observation probability matrix of the observation signal. Importantly, the underlying HMM demonstrates applicability to a broader range of scenarios than certain existing works. Furthermore, data are vulnerable to cyberattacks before being transmitted to the controller due to the open communication architecture, in which adversaries are assumed to inject false data that are capable of affecting data security. To effectively mitigate unnecessary utilization, we develop a novel dynamic event-based protocol involving dynamic threshold parameter and system modes in the feedback channel. Our methodology tackles the vulnerability of data to cyberattacks in open communication architectures, and the proposed protocol provides a feasible security solution for the hidden Markov jump systems. Eventually, the theoretical findings are demonstrated by two provided simulation examples.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"165-176"},"PeriodicalIF":4.0,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675984","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