Pub Date : 2025-02-18DOI: 10.1109/TCNS.2025.3543666
Shuai Feng;Maojiao Ye;Lihua Xie;Shengyuan Xu
This article studies distributed Nash equilibrium (NE) seeking under denial-of-service (DoS) attacks and quantization. The players can only exchange information with their own direct neighbors. The transmitted information is subject to quantization and packet losses induced by malicious DoS attacks. We propose a quantized distributed NE seeking strategy based on the approach of dynamic quantized consensus. To solve the quantizer saturation problem caused by DoS attacks, the quantization mechanism is equipped to have zooming-in and holding capabilities, in which the holding capability is consistent with the results in quantized consensus under DoS. A sufficient condition on the number of quantizer levels is provided, under which the quantizers are free from saturation under DoS attacks. The proposed distributed quantized NE seeking strategy is shown to have the so-called maximum resilience to DoS attacks. Namely, if the bound characterizing the maximum resilience is violated, an attacker can deny all the transmissions, and hence, distributed NE seeking is impossible.
{"title":"Quantized Distributed Nash Equilibrium Seeking Under DoS Attacks","authors":"Shuai Feng;Maojiao Ye;Lihua Xie;Shengyuan Xu","doi":"10.1109/TCNS.2025.3543666","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3543666","url":null,"abstract":"This article studies distributed Nash equilibrium (NE) seeking under denial-of-service (DoS) attacks and quantization. The players can only exchange information with their own direct neighbors. The transmitted information is subject to quantization and packet losses induced by malicious DoS attacks. We propose a quantized distributed NE seeking strategy based on the approach of dynamic quantized consensus. To solve the quantizer saturation problem caused by DoS attacks, the quantization mechanism is equipped to have zooming-in and holding capabilities, in which the holding capability is consistent with the results in quantized consensus under DoS. A sufficient condition on the number of quantizer levels is provided, under which the quantizers are free from saturation under DoS attacks. The proposed distributed quantized NE seeking strategy is shown to have the so-called maximum resilience to DoS attacks. Namely, if the bound characterizing the maximum resilience is violated, an attacker can deny all the transmissions, and hence, distributed NE seeking is impossible.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"1856-1868"},"PeriodicalIF":5.0,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145315453","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}
Pub Date : 2025-02-07DOI: 10.1109/TCNS.2025.3539542
{"title":"2024 Index IEEE Transactions on Control of Network Systems Vol. 11","authors":"","doi":"10.1109/TCNS.2025.3539542","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3539542","url":null,"abstract":"","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"11 4","pages":"1-38"},"PeriodicalIF":4.0,"publicationDate":"2025-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10878379","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143361275","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-07DOI: 10.1109/TCNS.2025.3539577
Zhixin Zhang;Zhiyong Chen;Wentuo Fang
Constraints on system states are essential performance requirements in various control systems. This article delves into the problem of cooperative fault-tolerant control under state constraints for a specific class of nonlinear multiple-agent systems. To achieve an asymptotic estimation of states and faults, we propose a distributed state–fault observer that leverages the structural information of faults. Notably, this observer operates independently of the choice of control input, thus decoupling it from the controller design. Alongside estimates of states and faults, we develop a cooperative fault-tolerant controller to ensure that the constrained state difference remains within the prescribed range throughout the system's evolution, ultimately converging to the desired value. We demonstrate the applicability of this approach in the context of cooperative fault-tolerant cruise control for multiple high-speed trains, where we consider simultaneous constraints on train position and velocity.
{"title":"Cooperative Fault Tolerant Control With State Constraints for Nonlinear Multiple-Agent Systems","authors":"Zhixin Zhang;Zhiyong Chen;Wentuo Fang","doi":"10.1109/TCNS.2025.3539577","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3539577","url":null,"abstract":"Constraints on system states are essential performance requirements in various control systems. This article delves into the problem of cooperative fault-tolerant control under state constraints for a specific class of nonlinear multiple-agent systems. To achieve an asymptotic estimation of states and faults, we propose a distributed state–fault observer that leverages the structural information of faults. Notably, this observer operates independently of the choice of control input, thus decoupling it from the controller design. Alongside estimates of states and faults, we develop a cooperative fault-tolerant controller to ensure that the constrained state difference remains within the prescribed range throughout the system's evolution, ultimately converging to the desired value. We demonstrate the applicability of this approach in the context of cooperative fault-tolerant cruise control for multiple high-speed trains, where we consider simultaneous constraints on train position and velocity.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1264-1276"},"PeriodicalIF":4.0,"publicationDate":"2025-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331537","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}
Pub Date : 2025-02-07DOI: 10.1109/TCNS.2025.3539495
Soham Mukherjee;Mrityunjoy Chakraborty
We study a decentralized nonconvex stochastic optimization problem in which a group of agents/nodes seek to minimize a global objective function that can be expressed as a sum of local component functions, such that each node in the network has access to exactly one component function. The nodes collaborate with their neighbors by sharing their estimates over communication links that are assumed to be corrupted by additive noise. To address this problem, we propose a computationally efficient and robust algorithm that builds on a probabilistic technique for stochastic gradient computation, which we believe will be applicable to a wide range of problems in decentralized information processing, learning, and control. Specifically, we show that the proposed method achieves an oracle complexity (computational complexity) of $O(1/epsilon ^{2})$ for smooth and nonconvex functions with stochastic gradients, which is known to be sharp for its respective function class, and is an improvement over the computational cost obtained in previous works. In addition, we retain the $O(1/epsilon ^{3})$ rate for the communication cost, which is at par with the communication cost obtained in previous works. We also show how the proposed algorithm has robust performance in environments with unreliable computational resources. Finally, the theoretical findings are validated via numerical experiments.
{"title":"Achieving Near-Optimal Oracle Complexity in Decentralized Stochastic Optimization With Channel Noise","authors":"Soham Mukherjee;Mrityunjoy Chakraborty","doi":"10.1109/TCNS.2025.3539495","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3539495","url":null,"abstract":"We study a decentralized nonconvex stochastic optimization problem in which a group of agents/nodes seek to minimize a global objective function that can be expressed as a sum of local component functions, such that each node in the network has access to exactly one component function. The nodes collaborate with their neighbors by sharing their estimates over communication links that are assumed to be corrupted by additive noise. To address this problem, we propose a computationally efficient and robust algorithm that builds on a probabilistic technique for stochastic gradient computation, which we believe will be applicable to a wide range of problems in decentralized information processing, learning, and control. Specifically, we show that the proposed method achieves an oracle complexity (computational complexity) of <inline-formula><tex-math>$O(1/epsilon ^{2})$</tex-math></inline-formula> for smooth and nonconvex functions with stochastic gradients, which is known to be sharp for its respective function class, and is an improvement over the computational cost obtained in previous works. In addition, we retain the <inline-formula><tex-math>$O(1/epsilon ^{3})$</tex-math></inline-formula> rate for the communication cost, which is at par with the communication cost obtained in previous works. We also show how the proposed algorithm has robust performance in environments with unreliable computational resources. Finally, the theoretical findings are validated via numerical experiments.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1215-1226"},"PeriodicalIF":4.0,"publicationDate":"2025-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331487","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}
Pub Date : 2025-02-06DOI: 10.1109/TCNS.2025.3539580
Bing Liu;Wenli Du;Zhongmei Li
This article studies an enhanced distributed optimization algorithm in an undirected topology based on local communication and computation to optimize the sum of local objective functions under multiple constraints. In particular, the adapt-then-combine distributed inexact gradient tracking algorithm (ATC-DIGing-MC) is developed for smooth and strongly convex local functions with multiple constraints. By implementing the adapt-then-combine scheme and using the gradient tracking technique, rapidity and flexibility can be obtained by the ATC-DIGing-MC with uncoordinated step-sizes. Subsequently, the parameter projection strategy is implemented to deal with realistic production limitations in the presence of multiple constraints. Meanwhile, rigorous theoretical proofs and convergence theorem are provided to verify the geometrical convergence rate of the ATC-DIGing-MC. Furthermore, the numerical experiments based on the entire ethylene separation process validate the superior performance of the ATC-DIGing-MC algorithm in terms of time and energy savings compared to established algorithms.
{"title":"An Enhanced Distributed Optimization Subject to Multiple Constraints: A Case Study on Entire Ethylene Separation Process","authors":"Bing Liu;Wenli Du;Zhongmei Li","doi":"10.1109/TCNS.2025.3539580","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3539580","url":null,"abstract":"This article studies an enhanced distributed optimization algorithm in an undirected topology based on local communication and computation to optimize the sum of local objective functions under multiple constraints. In particular, the adapt-then-combine distributed inexact gradient tracking algorithm (ATC-DIGing-MC) is developed for smooth and strongly convex local functions with multiple constraints. By implementing the adapt-then-combine scheme and using the gradient tracking technique, rapidity and flexibility can be obtained by the ATC-DIGing-MC with uncoordinated step-sizes. Subsequently, the parameter projection strategy is implemented to deal with realistic production limitations in the presence of multiple constraints. Meanwhile, rigorous theoretical proofs and convergence theorem are provided to verify the geometrical convergence rate of the ATC-DIGing-MC. Furthermore, the numerical experiments based on the entire ethylene separation process validate the superior performance of the ATC-DIGing-MC algorithm in terms of time and energy savings compared to established algorithms.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1227-1237"},"PeriodicalIF":4.0,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331637","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}
Pub Date : 2025-02-06DOI: 10.1109/TCNS.2025.3539952
Yuan Wang;Huaicheng Yan;Ju H. Park;Hao Zhang;Hao Shen
This article systematically studies the problem of resilient controller design for networked control systems under imperfect communication environments. The stochastic denial of service attacks in the case of an imperfect network are remodeled. An semi-Markov chain is introduced in this article to provide a suitable description of random attacks. On this basis, the double-layer stochastic process is constructed, which consists of an attack sequence and an observation one. Second, since the attack modes are inaccessible, a controller is constructed based on the observation sequence by virtue of the emission probability to stabilize the system under random attacks. Due to the complexity of the network, the probability that an observer can accurately detect an attack when it occurs is considered unknown. Based on the introduced double-layer stochastic process, a mode-associated Lyapunov function is constructed to facilitate the stability analysis. Building on this foundation, sufficient conditions that can ensure the $delta$-error mean-square stability of the closed-loop system are derived. In the end, a simulation of the autonomous ground vehicle is presented, showcasing the feasibility and validity of the proposed control scheme.
{"title":"Resilient Control of Networked Control Systems With Hidden DoS Attacks and Unknown Observation Probability","authors":"Yuan Wang;Huaicheng Yan;Ju H. Park;Hao Zhang;Hao Shen","doi":"10.1109/TCNS.2025.3539952","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3539952","url":null,"abstract":"This article systematically studies the problem of resilient controller design for networked control systems under imperfect communication environments. The stochastic denial of service attacks in the case of an imperfect network are remodeled. An semi-Markov chain is introduced in this article to provide a suitable description of random attacks. On this basis, the double-layer stochastic process is constructed, which consists of an attack sequence and an observation one. Second, since the attack modes are inaccessible, a controller is constructed based on the observation sequence by virtue of the emission probability to stabilize the system under random attacks. Due to the complexity of the network, the probability that an observer can accurately detect an attack when it occurs is considered unknown. Based on the introduced double-layer stochastic process, a mode-associated Lyapunov function is constructed to facilitate the stability analysis. Building on this foundation, sufficient conditions that can ensure the <inline-formula><tex-math>$delta$</tex-math></inline-formula>-error mean-square stability of the closed-loop system are derived. In the end, a simulation of the autonomous ground vehicle is presented, showcasing the feasibility and validity of the proposed control scheme.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1313-1323"},"PeriodicalIF":4.0,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331518","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}
Pub Date : 2025-02-04DOI: 10.1109/TCNS.2025.3538459
Julian Barreiro-Gomez
We studymultipopulation game problems consisting of both interpopulation and intrapopulation strategic interactions. In the proposed model, the intrapopulation dynamics is given by a stochastic differential equation (SDE) and the strategic interaction occurs among agents who are homogeneous within the same population. A stochastic aggregative game takes place in the intrapopulation game problem. The interpopulation dynamics is given by the aggregative behavior of each population and an ordinary differential equation (ODE). The other strategic interaction occurs among different heterogeneous populations in either a noncooperative or cooperative way. In addition, the interaction for the different populations is performed in a distributed manner over a graph that might also be considered time-varying. We provideconditions to compute the solution by means of dynamic programming, and providesemi-explicit solutions for the linear-quadratic case by solving the emerging Hamilton–Jacobi–Bellman partial differential equation (PDE) and postulating an appropriate ansatz for the value functional. A numerical example illustrates the presented results.
{"title":"Interpopulation and Intrapopulation Linear Quadratic Differential Games","authors":"Julian Barreiro-Gomez","doi":"10.1109/TCNS.2025.3538459","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3538459","url":null,"abstract":"We studymultipopulation game problems consisting of both interpopulation and intrapopulation strategic interactions. In the proposed model, the intrapopulation dynamics is given by a stochastic differential equation (SDE) and the strategic interaction occurs among agents who are <italic>homogeneous</i> within the same population. A stochastic aggregative game takes place in the intrapopulation game problem. The interpopulation dynamics is given by the aggregative behavior of each population and an ordinary differential equation (ODE). The other strategic interaction occurs among different <italic>heterogeneous</i> populations in either a noncooperative or cooperative way. In addition, the interaction for the different populations is performed in a distributed manner over a graph that might also be considered time-varying. We provideconditions to compute the solution by means of dynamic programming, and providesemi-explicit solutions for the linear-quadratic case by solving the emerging Hamilton–Jacobi–Bellman partial differential equation (PDE) and postulating an appropriate ansatz for the value functional. A numerical example illustrates the presented results.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1815-1827"},"PeriodicalIF":4.0,"publicationDate":"2025-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10872827","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-04DOI: 10.1109/TCNS.2025.3538753
Raman Ebrahimi;Parinaz Naghizadeh
Network games provide a framework to study strategic decision-making processes that are governed by structured interdependencies among agents. However, existing models do not account for environments in which agents simultaneously interact over multiple networks, or when agents operate over multiple action dimensions. In this article, we propose new models of multiplex network games to capture the different modalities of interactions among strategic agents, and multilayer network games to capture their interactions over multiple action dimensions. We explore how the properties of the constituent networks of a multiplex/multilayer network can undermine or support the existence, uniqueness, and stability of the game's Nash equilibria. Notably, we highlight that both the largest and smallest eigenvalues of the constituent networks (reflecting their connectivity and two-sidedness, respectively) are instrumental in determining the uniqueness of the multiplex/multilayer network game's equilibrium. Together, our findings shed light on the reasons for the fragility of equilibria when agents interact over networks of networks, and point out potential interventions to alleviate them.
{"title":"United We Fall: On the Nash Equilibria of Multiplex and Multilayer Network Games","authors":"Raman Ebrahimi;Parinaz Naghizadeh","doi":"10.1109/TCNS.2025.3538753","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3538753","url":null,"abstract":"Network games provide a framework to study strategic decision-making processes that are governed by structured interdependencies among agents. However, existing models do not account for environments in which agents simultaneously interact over multiple networks, or when agents operate over multiple action dimensions. In this article, we propose new models of <italic>multiplex</i> network games to capture the different modalities of interactions among strategic agents, and <italic>multilayer</i> network games to capture their interactions over multiple action dimensions. We explore how the properties of the constituent networks of a multiplex/multilayer network can undermine or support the existence, uniqueness, and stability of the game's Nash equilibria. Notably, we highlight that both the largest and smallest eigenvalues of the constituent networks (reflecting their connectivity and two-sidedness, respectively) are instrumental in determining the uniqueness of the multiplex/multilayer network game's equilibrium. Together, our findings shed light on the reasons for the fragility of equilibria when agents interact over networks of networks, and point out potential interventions to alleviate them.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1238-1250"},"PeriodicalIF":4.0,"publicationDate":"2025-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331586","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}
Pub Date : 2025-02-04DOI: 10.1109/TCNS.2025.3538472
Leon Lan;Alessandro Zocca
In transmission networks, power flows and network topology are deeply intertwined due to power flow physics. Recent literature shows that a specific more hierarchical network structure can effectively inhibit the propagation of line failures across the entire system. In particular, a novel approach named tree partitioning has been proposed, which seeks to bolster the robustness of power networks through strategic alterations in network topology, accomplished via targeted line-switching actions. Several tree-partitioning problem formulations have been proposed by considering different objectives, among which power flow disruption and network congestion. Furthermore, various heuristic methods based on a two-stage and recursive approach have been proposed. The present work provides a general framework for tree-partitioning problems based on mixed-integer linear programming (MILP). In particular, we present a novel MILP formulation to optimally solve tree-partitioning problems and also propose a two-stage heuristic based on MILP. We perform extensive numerical experiments to solve two tree-partitioning problem variants, demonstrating the excellent performance of our solution methods. Lastly, through exhaustive cascading failure simulations, we compare the effectiveness of various tree-partitioning strategies and show that, on average, they can achieve a substantial reduction in lost load compared to the original topologies.
{"title":"Mixed-Integer Linear Programming Approaches for Tree Partitioning of Power Networks","authors":"Leon Lan;Alessandro Zocca","doi":"10.1109/TCNS.2025.3538472","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3538472","url":null,"abstract":"In transmission networks, power flows and network topology are deeply intertwined due to power flow physics. Recent literature shows that a specific more hierarchical network structure can effectively inhibit the propagation of line failures across the entire system. In particular, a novel approach named <italic>tree partitioning</i> has been proposed, which seeks to bolster the robustness of power networks through strategic alterations in network topology, accomplished via targeted line-switching actions. Several tree-partitioning problem formulations have been proposed by considering different objectives, among which power flow disruption and network congestion. Furthermore, various heuristic methods based on a two-stage and recursive approach have been proposed. The present work provides a general framework for tree-partitioning problems based on mixed-integer linear programming (MILP). In particular, we present a novel MILP formulation to optimally solve tree-partitioning problems and also propose a two-stage heuristic based on MILP. We perform extensive numerical experiments to solve two tree-partitioning problem variants, demonstrating the excellent performance of our solution methods. Lastly, through exhaustive cascading failure simulations, we compare the effectiveness of various tree-partitioning strategies and show that, on average, they can achieve a substantial reduction in lost load compared to the original topologies.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1805-1814"},"PeriodicalIF":4.0,"publicationDate":"2025-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331580","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}
In this article, a fixed-time convergent reinforcement learning (RL) algorithm is proposed to accomplish the secure formation control of a second-order multiagent system (MAS) under the false data injection (FDI) attack. To alleviate the FDI attack on the control signal, a zero-sum graphical game is introduced to analyze the attack–defense process, in which the secure formation controller intends to minimize the common performance index function, whereas the purpose of the attacker is the opposite. Attaining the optimal secure formation control policy located at the Nash equilibrium depends on solving the game-associated coupled Hamilton–Jacobi–Isaacs equation. Taking into account fixed-time convergence, a critic-only online RL algorithm with the experience replay technique is designed. Meanwhile, the corresponding convergence and stability proofs are provided. A simulation example is presented to show the effectiveness of the devised scheme.
{"title":"Secure Formation Control of Multiagent System Against FDI Attack Using Fixed-Time Convergent Reinforcement Learning","authors":"Zhenyu Gong;Feisheng Yang;Yuan Yuan;Qian Ma;Wei Xing Zheng","doi":"10.1109/TCNS.2025.3538761","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3538761","url":null,"abstract":"In this article, a fixed-time convergent reinforcement learning (RL) algorithm is proposed to accomplish the secure formation control of a second-order multiagent system (MAS) under the false data injection (FDI) attack. To alleviate the FDI attack on the control signal, a zero-sum graphical game is introduced to analyze the attack–defense process, in which the secure formation controller intends to minimize the common performance index function, whereas the purpose of the attacker is the opposite. Attaining the optimal secure formation control policy located at the Nash equilibrium depends on solving the game-associated coupled Hamilton–Jacobi–Isaacs equation. Taking into account fixed-time convergence, a critic-only online RL algorithm with the experience replay technique is designed. Meanwhile, the corresponding convergence and stability proofs are provided. A simulation example is presented to show the effectiveness of the devised scheme.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1203-1214"},"PeriodicalIF":4.0,"publicationDate":"2025-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331638","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：