{"title":"Worst-Case Integrity Attacks and Resilient State Estimation With Partially Secured Measurements","authors":"Jing Zhou;Jun Shang;Tongwen Chen","doi":"10.1109/TCNS.2025.3534459","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3534459","url":null,"abstract":"This article examines the problem of optimal deception attacks against state estimation with partially secured measurements, where smart sensors transmit innovation sequences to the remote end for information fusion. Due to resource limitations or defensive countermeasures, the adversary can only modify data packets transmitted through unreliable channels. Meanwhile, the attack should be synthesized with sophistication to deceive an anomaly detector. To investigate the vulnerabilities of such estimation systems without feedback links and enhance security performance, the optimal attack policy is derived by formulating and explicitly solving a convex optimization problem, with the goal of maximizing the sum of estimation errors. Subsequently, a novel attack detection and resilient state estimation algorithm is proposed to ensure an acceptable level of estimation accuracy. The theoretical performance metrics, including false alarm rates for the proposed detector, are provided. Finally, the effectiveness of the results is confirmed through numerical examples.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1769-1779"},"PeriodicalIF":4.0,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331709","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":"Convergence of Backward/Forward Sweep for Power Flow Solution in Radial Networks","authors":"Bohang Fang;Changhong Zhao;Steven H. Low","doi":"10.1109/TCNS.2025.3534557","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3534557","url":null,"abstract":"Solving power flow is a fundamental problem in power systems. The normally radial (tree) topology of a distribution network induces a spatially recursive structure in ac power flow, which enables a class of efficient solution methods—backward/forward sweep (BFS). In this article, we revisit BFS from the perspective of its convergence, which was rarely addressed before. We introduce three variants of BFS algorithms: the first one calculates voltages and line currents in a single-phase network model; the second algorithm extends the first one to an unbalanced three-phase network with <inline-formula><tex-math>$Y$</tex-math></inline-formula> and <inline-formula><tex-math>$Delta$</tex-math></inline-formula> configurations; the third one calculates voltages and line power flows in the classical dist-flow model. We prove a sufficient condition, under which the first algorithm is a contraction mapping on a closed set of voltages and thus converges geometrically to a unique solution. This proof is extended to the second algorithm for three-phase networks. We then use the monotone convergence theorem to prove convergence of the third algorithm. We verify the convergence conditions, solution accuracy, and computational efficiency of BFS algorithms through simulations in IEEE test systems.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1780-1792"},"PeriodicalIF":4.0,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331747","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":"Adaptive Prescribed-Time Distributed Nash Equilibrium Seeking for Networked Games With Heterogeneous Dynamics and Unknown Uncertainties","authors":"Yiyang Chen;Yongzhao Hua;Zhi Feng;Xiwang Dong","doi":"10.1109/TCNS.2025.3528094","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3528094","url":null,"abstract":"This article investigates the adaptive prescribed-time distributed Nash equilibrium (NE) seeking problems for networked games with heterogeneous dynamics and unknown uncertainties. The proposed algorithms are based on the two-layer structure, namely, the NE seeking part and the tracking control part. For players without uncertainties, adaptive parameters are utilized in the seeking part to avoid the use of global information. Auxiliary variables are constructed to seek the NE point within the prescribed time and serve as reference signals for the tracking control part. Then, state feedback control is designed to drive the strategies of all the players to the expected NE point in the prescribed time. Furthermore, the approximation theory is introduced to deal with unknown nonlinear uncertainties. Exponential parameters are involved in the designed estimates to accelerate the convergence rate. The Lyapunov method is utilized to show the prescribed-time convergence property of the algorithms. Besides, although the time-varying piecewise function is involved in the algorithms, the uniform boundedness of the control input can be ensured by carefully selecting the initial values of the auxiliary parameters. Finally, a simulation is given to show the effectiveness of the proposed algorithms.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1744-1755"},"PeriodicalIF":4.0,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331752","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":"Fixed-Time Formation Tracking for Heterogeneous Linear Multiagent Systems With a Nonautonomous Leader","authors":"Shiyu Zhou;Dong Sun;Gang Feng","doi":"10.1109/TCNS.2025.3528095","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3528095","url":null,"abstract":"This article studies the fixed-time time-varying formation (TVF) tracking control problem for heterogeneous multiagent systems with a nonautonomous leader under a directed communication network. The primary objective is to design a TVF tracking protocol enabling the followers to form the desired TVF while simultaneously tracking the output of the nonautonomous leader in a fixed time. First, a distributed fixed-time observer is proposed to estimate the state of the nonautonomous leader under a directed communication network. Then, utilizing coordinate transformation and sliding mode techniques, a fixed-time observer-based TVF tracking protocol is developed without requiring the full row rank assumption on the input matrix of the follower. It is proved via the Lyapunov stability theory that the fixed-time TVF tracking problem with a nonautonomous leader can be solved under the proposed protocol. Finally, the effectiveness of the proposed fixed-time TVF tracking control protocol is demonstrated by numerical examples.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1733-1743"},"PeriodicalIF":4.0,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331757","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}
Liping Chen;Chuang Liu;António M. Lopes;Zhiqiang Zhang;YangQuan Chen
{"title":"Nonfragile Consensus Strategy for Variable Fractional-Order Multiagent Systems Based on Disturbance Observer","authors":"Liping Chen;Chuang Liu;António M. Lopes;Zhiqiang Zhang;YangQuan Chen","doi":"10.1109/TCNS.2025.3527254","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3527254","url":null,"abstract":"This article proposes nonfragile leader–follower consensus control for variable fractional-order multiagent systems under disturbance generated by an exogenous system. The developed technique is directly applicable to fixed fractional-order and integer-order multiagent systems. First, a nonfragile variable fractional-order disturbance observer is introduced, which is able to tolerate a certain degree of parameter uncertainty. Second, by employing the disturbance observer, a novel robust nonfragile consensus control scheme is developed, which not only ensures asymptotic stability of the consensus error system, but also accommodates parameter uncertainty in the physical controller's implementation. Third, new suffi cient conditions for the desired consensus protocol are derived using linear matrix inequalities (LMIs), as well as graph and Lyapunov theory. Finally, simulation examples are presented to illustrate the validity of the theoretical results. The proposed order-dependent LMI condition is less conservative than existing order-independent alternatives.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1709-1720"},"PeriodicalIF":4.0,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331540","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":"Parallel Momentum Methods Under Biased Gradient Estimations","authors":"Ali Beikmohammadi;Sarit Khirirat;Sindri Magnússon","doi":"10.1109/TCNS.2025.3527255","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3527255","url":null,"abstract":"Parallel stochastic gradient methods are gaining prominence in solving large-scale machine learning problems that involve data distributed across multiple nodes. However, obtaining unbiased stochastic gradients, which have been the focus of most theoretical research, is challenging in many distributed machine learning applications. The gradient estimations easily become biased, for example, when gradients are compressed or clipped, when data are shuffled, and in meta-learning and reinforcement learning. In this work, we establish worst-case bounds on parallel momentum methods under biased gradient estimation on both general nonconvex and <inline-formula><tex-math>$mu$</tex-math></inline-formula>-Polyak–Łojasiewicz problems. Our analysis covers general distributed optimization problems, and we work out the implications for special cases where gradient estimates are biased, i.e., in meta-learning and when the gradients are compressed or clipped. Our numerical experiments verify our theoretical findings and show faster convergence performance of momentum methods than traditional biased gradient descent.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1721-1732"},"PeriodicalIF":4.0,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331755","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":"Differentially Private Opinion Dynamics of Influence Networks","authors":"Guanglei Wu;Wenbing Zhang;Shuai Mao;Xiaotai Wu;Yang Tang","doi":"10.1109/TCNS.2025.3526720","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526720","url":null,"abstract":"In this article, a unified influence network model incorporating differential privacy mechanisms (DPMs), called the differentially private opinion dynamics (DPODs) model, is proposed. In this model, each individual uses protected opinions rather than the private opinions of his/her neighbors to update his/her private opinions, where the protected opinion of an individual is a blend of private opinions and random noise following Laplace distribution. Building on stochastic analysis techniques and matrix theory, we show that the influence network under consideration converges under specific conditions governing individual sensitivities and interaction weights. In addition, the statistical properties related to convergence accuracy are established by utilizing the Markov inequality to estimate a lower bound on the probability of all individuals' final opinions converging to a neighborhood formed by their initial opinions' convex hull. We further conduct a differential privacy analysis to validate the efficacy of the proposed DPMs in safeguarding the private opinions of all individuals. Finally, two examples, including one of the Karate-Club networks, are provided to shed new light on the effectiveness of the theoretical results.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1662-1673"},"PeriodicalIF":4.0,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331756","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":"Robust Quantized Consensus of Multiagent Systems Under Disturbance and DoS Attacks","authors":"Xinhe Wang;Guanghui Wen;Dan Zhao;Tingwen Huang","doi":"10.1109/TCNS.2025.3526716","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526716","url":null,"abstract":"External disturbances and denial-of-service (DoS) attacks pose significant challenges to the quantized control of multiagent systems (MASs). Most of the existing quantized control strategies primarily focus on designing scaling factors and constructing auxiliary systems without considering external disturbances. Note that these strategies require a highly accurate system model and will lead to the saturation of the quantizer if there exist external disturbances. To overcome the aforementioned shortcomings, a new scaling function is developed in this article by incorporating robustness factors into the scaling function design, significantly enhancing the robustness of the quantization mechanism. Based on this, a robust quantized control strategy is designed to achieve the bounded consensus of linear MASs in the presence of disturbance and DoS attacks, where the tradeoff among quantization level, consensus performance, and resilience to DoS attacks is explored. Besides, the robust design framework shows significant flexibility and efficiency in addressing the resilient control of nonlinear MASs subject to DoS attacks. Numerical simulations are provided to validate the theoretical results.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1626-1637"},"PeriodicalIF":4.0,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331748","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}
Alexander Engelmann;Sungho Shin;François Pacaud;Victor M. Zavala
{"title":"Scalable Primal Decomposition Schemes for Large-Scale Infrastructure Networks","authors":"Alexander Engelmann;Sungho Shin;François Pacaud;Victor M. Zavala","doi":"10.1109/TCNS.2025.3526709","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526709","url":null,"abstract":"The operation of large-scale infrastructure networks requires scalable optimization schemes. To guarantee safe system operation, a high degree of feasibility in a small number of iterations is important. Decomposition schemes can help to achieve scalability. In terms of feasibility, however, classical approaches, such as the alternating direction method of multipliers (ADMMs), often converge slowly. In this work, we present primal decomposition schemes for hierarchically structured strongly convex quadratic programs. These schemes offer high degrees of feasibility in a small number of iterations in combination with global convergence guarantees. We benchmark their performance against the centralized off-the-shelf interior-point solver Ipopt and ADMM on problems with up to 300 000 decision variables and constraints. We find that the proposed approaches solve problems as fast as Ipopt, but with reduced communication and without requiring a full model exchange. Moreover, the proposed schemes achieve a higher accuracy than ADMM.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1687-1698"},"PeriodicalIF":4.0,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331754","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":"Consensus of Multiagent Systems Under Unbounded Communication Delays via Adaptive Distributed Observers","authors":"Cong Bi;Xiang Xu;Lu Liu;Gang Feng","doi":"10.1109/TCNS.2025.3526704","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526704","url":null,"abstract":"This article considers the leader-following consensus problem of multiagent systems subject to unbounded distributed communication delays under the condition that only the neighboring agents of the leader have access to the information on both the system matrix and the state of the leader. A novel <italic>adaptive</i> distributed observer is proposed to estimate both the system matrix and the state of the leader under unbounded distributed communication delays, without requiring that the information of the unbounded delays is known a priori. A key technical result is first established, and a novel distributed controller is then developed based on the proposed distributed observer. It is shown that the resulting closed-loop system achieves the desired consensus. Finally, the effectiveness of the theoretical results is validated by two simulation examples.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1613-1625"},"PeriodicalIF":4.0,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331572","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}