Yuan Wang;Huaicheng Yan;Ju H. Park;Hao Zhang;Hao Shen
{"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}
{"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}
{"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}
{"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}
{"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}
{"title":"Discrete-Time Formation Control With Attitude Alignment: A Geometric Approach Under Ergodic Products","authors":"Zhen Li;Yang Tang;Wenbing Zhang;Yongqing Fan;Tingwen Huang","doi":"10.1109/TCNS.2025.3538743","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3538743","url":null,"abstract":"Assuming agents possess sensing capabilities and dynamics relative to their body coordinate frames, this article addresses a displacement-based strategy for discrete-time formation control through attitude synchronization. Unlike the Eulerian approximation, the first challenge lies in developing discrete-time models that capture both position and attitude motions, thereby complementing existing continuous-time systems with a discretized version. Then, two leader-following control protocols are designed, incorporating a jointly connected topology to relax the connectivity requirements. The analysis of these systems often relies on the Lyapunov function, the existence of which may be hard to guarantee. Consequently, the geometric properties of several polytopes are explored under the dynamic topologies and time-varying parameters. By extending the ergodicity results to leader-following scenarios, these properties are characterized as positively invariant sets. This invariance, which is independent of the existence of the Lyapunov function or the solvability of its associated criteria, provides a beneficial tool for analyzing time-variant systems. Utilizing this invariance and some mathematical techniques, the desired formation shape can be achieved in cases where the attitudes of the followers synchronize with the leader. Finally, a numerical simulation validates the results.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1793-1804"},"PeriodicalIF":4.0,"publicationDate":"2025-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331711","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}
{"title":"Asynchronously Integral Event-Triggered Formation Tracking in UAV Swarm Systems Featuring Switching Directed Topologies","authors":"Zhiheng Dong;Shuang Shi;Ziyang Zhen","doi":"10.1109/TCNS.2025.3538745","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3538745","url":null,"abstract":"This article explores the control problem of integral event-triggered <inline-formula><tex-math>$mathcal {H}_{infty }$</tex-math></inline-formula> time-varying formation tracking (TVFT) for unmanned aerial vehicle (UAV) swarm systems, featuring switching directed topologies. Employing the persistent dwell time (PDT) switching approach, the nonweighted <inline-formula><tex-math>$mathcal {H}_{infty }$</tex-math></inline-formula> performance can be assured for the swarm system, which improves disturbance attenuation capability and has rarely been studied in the existing UAV formation control research to date. Meanwhile, a more advanced integral event-triggered mechanism (IETM) is devised to further decrease the triggering frequency compared to the static event-triggered one. In addition, the asynchronism due to the coexistence of event-triggered transmission and switching characteristics is taken into consideration. Building on these foundations, a comprehensive approach is developed, integrating the TVFT control scheme, the IETM, and the PDT switching, with simulation results validating its effectiveness and advantages.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1251-1263"},"PeriodicalIF":4.0,"publicationDate":"2025-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331712","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}
{"title":"IEEE Control Systems Society Information","authors":"","doi":"10.1109/TCNS.2025.3526701","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526701","url":null,"abstract":"","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"11 4","pages":"C2-C2"},"PeriodicalIF":4.0,"publicationDate":"2025-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10865804","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143361453","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}
{"title":"IEEE Control Systems Society Information","authors":"","doi":"10.1109/TCNS.2025.3526702","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526702","url":null,"abstract":"","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"11 4","pages":"2276-2277"},"PeriodicalIF":4.0,"publicationDate":"2025-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10865829","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143107205","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}
{"title":"Stochastic Event-Triggered Estimation With Smart Sensors Over Packet-Dropping Links","authors":"Yahan Deng;Nachuan Yang;Yuzhe Li","doi":"10.1109/TCNS.2025.3534281","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3534281","url":null,"abstract":"The event-triggered scheme (ETS) has been widely used for sensor data scheduling in cyber-physical systems. Existing literature on the design of ETSs for packet drops deals with the issue of non-Gaussianity of the a posteriori distribution in the system state. On the one hand, the Gaussian assumption only derives an approximate result, while on the other hand, exact results can be obtained by numerical integration but with excessive computational complexity. To this end, in this article, we propose a stochastic ETS based on acknowledgment information for remote state estimation with smart sensors and packet drops. The transmission decision is jointly driven by the holding time at the remote end and the accumulated innovative information. Then, we inductively derive the exact probability density function of the augmented innovative information vector by the Bayesian rule, which is used to obtain the explicit form of the estimation error covariance. These exact theoretical results mean that the design of scheduling parameter sequences no longer relies on experience. Finally, numerical simulations are provided to demonstrate that the empirical results agree with the theoretical results.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1756-1768"},"PeriodicalIF":4.0,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331542","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}