{"title":"Optimal Robust Network Design: Formulations and Algorithms for Maximizing Algebraic Connectivity","authors":"Neelkamal Somisetty;Harsha Nagarajan;Swaroop Darbha","doi":"10.1109/TCNS.2024.3431408","DOIUrl":"10.1109/TCNS.2024.3431408","url":null,"abstract":"This article focuses on designing edge-weighted networks, whose robustness is characterized by maximizing algebraic connectivity, or the second smallest eigenvalue of the Laplacian matrix. This problem is motivated by cooperative vehicle localization, where accurately estimating relative position measurements and establishing communication links are essential. We also examine an associated problem where every robot is limited by payload, budget, and communication to pick no more than a specified number of relative position measurements. The basic underlying formulation for these problems is nonlinear and is known to be NP-hard. Our approach formulates this problem as a mixed-integer semidefinite program, later reformulated into a mixed-integer linear program for obtaining optimal solutions using cutting plane algorithms. We introduce a novel upper bounding algorithm based on the principal minor characterization of positive semidefinite matrices and discuss a degree-constrained lower bounding formulation inspired by robust network structures. In addition, we propose a maximum cost heuristic with low computational complexity to identify high-quality feasible solutions for instances involving up to 100 nodes. We show extensive computational results corroborating our proposed methods.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"918-929"},"PeriodicalIF":4.0,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737398","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":"Strategic Interaction Over Age of Incorrect Information for False Data Injection in Cyber-Physical Systems","authors":"Valeria Bonagura;Stefano Panzieri;Federica Pascucci;Leonardo Badia","doi":"10.1109/TCNS.2024.3431389","DOIUrl":"10.1109/TCNS.2024.3431389","url":null,"abstract":"Ambient monitoring through remote sensing is the first required step of many control operations in cyber-physical systems to enable accurate decision-making by network intelligence. We consider a controller that sends status updates about a process to a receiver, incurring a cost when doing so. The process is dynamic, implying that the information the receiver has may become outdated due to a natural drift of the process. To determine the correctness of the information at the receiver, we model this interaction using a Markov chain with two states, namely, right (<italic>R</i>) and wrong (<italic>W</i>). The controller can restore the receiver status to <italic>R</i> by performing a new transmission, which comes at a cost. The staleness of information, when the system state is erroneous, is quantified through the average value of the age of incorrect information metric. Moreover, an adversary may inject false data at a price to make the information available at the receiver less fresh, which can only be contrasted by additional measurements by the controller. This results in a game played by strategic agents, namely, the controller and the adversary. The adversary's objective is to maximize the time the receiver is in the <italic>W</i> state of the Markov chain, while the controller's objective is to minimize it. We provide a mathematical formulation of this strategic interaction using game-theory, demonstrating the existence of a Nash equilibrium. In our analysis, we discuss the role of different system parameters and the implications on the resulting system performance, providing a quantitative evaluation of the parameter ranges where an adversary can be effectively counteracted is an important guideline to improve the security of cyber-physical systems.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"872-881"},"PeriodicalIF":4.0,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10605055","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737400","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":"Data Valuation From Data-Driven Optimization","authors":"Robert Mieth;Juan M. Morales;H. Vincent Poor","doi":"10.1109/TCNS.2024.3431415","DOIUrl":"10.1109/TCNS.2024.3431415","url":null,"abstract":"With the ongoing investment in data collection and communication technology in power systems, data-driven optimization has been established as a powerful tool for system operators to handle stochastic system states caused by weather-dependent and behavior-dependent resources. However, most methods are ignorant to data quality, which may differ based on measurement and underlying privacy-protection mechanisms. This article addresses this shortcoming by proposing a practical data quality metric based on Wasserstein distance, leveraging a novel modification of distributionally robust optimization using information from multiple datasets with heterogeneous quality to valuate data, applying the proposd optimization framework to an optimal power flow problem, and, finally, showing a direct method to valuate data from the optimal solution. We conduct numerical experiments to analyze and illustrate the proposed model and publish the implementation open source.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"954-966"},"PeriodicalIF":4.0,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737393","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":"Formation Control in Agents' Local Coordinate Frames for Arbitrary Initial Attitudes","authors":"Chinmay Garanayak;Dwaipayan Mukherjee","doi":"10.1109/TCNS.2024.3431416","DOIUrl":"10.1109/TCNS.2024.3431416","url":null,"abstract":"In this article, we address formation tracking control in agents' body coordinate frames while imposing no assumptions, such as positive definiteness on agents' initial attitude matrix. Difficulty in achieving formation control is exacerbated when agents are unable to access their absolute attitudes relative to a common frame of reference, and initial attitude matrices are required to be restricted to special sets. Addressing this issue, we present a distributed fixed-time attitude synchronization law, which utilizes only relative attitude measurements to align the agents' coordinate frames almost globally in finite time and locally in fixed time. The proposed law ensures the global asymptotic convergence of formation tracking error for displacement-based formation control in a leader–follower topology. We also establish global uniformly asymptotic stability for bearing-only formation tracking. A Lyapunov-based attitude estimation algorithm is proposed to estimate the attitudes up to a common reference frame in finite time without using Gram–Schmidt orthogonalization. For nonholonomic agents, formation stabilization in agents' local coordinate frame is studied using these attitude estimates and bearing-only measurements. Finally, to illustrate the applicability of our results, simulations are presented.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"993-1005"},"PeriodicalIF":4.0,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737401","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":"Losing Control of Your Linear Network? Try Resilience Theory","authors":"Jean-Baptiste Bouvier;Sai Pushpak Nandanoori;Melkior Ornik","doi":"10.1109/TCNS.2024.3431409","DOIUrl":"10.1109/TCNS.2024.3431409","url":null,"abstract":"Resilience of cyber-physical networks to unexpected failures is a critical need widely recognized across domains. For instance, power grids, telecommunication networks, transportation infrastructures, and water treatment systems have all been subject to disruptive malfunctions and catastrophic cyberattacks. Following such adverse events, we investigate scenarios where a node of a <italic>linear</i> network suffers a loss of control authority over some of its actuators. These actuators are not following the controller's commands and are instead producing undesirable outputs. The repercussions of such a loss of control can propagate and destabilize the whole network despite the malfunction occurring at a single node. To assess system vulnerability, we establish resilience conditions for networks with a subsystem enduring a loss of control authority over some of its actuators. Furthermore, we quantify the destabilizing impact on the overall network when such a malfunction perturbs a nonresilient subsystem. We illustrate our resilience conditions on two academic examples, on an islanded microgrid and on the linearized IEEE 39-bus system.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"980-992"},"PeriodicalIF":4.0,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737402","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":"A Time-Invariant Network Flow Model for Ride-Pooling in Mobility-on-Demand Systems","authors":"Fabio Paparella;Leonardo Pedroso;Theo Hofman;Mauro Salazar","doi":"10.1109/TCNS.2024.3431411","DOIUrl":"10.1109/TCNS.2024.3431411","url":null,"abstract":"In this article, we present a framework to incorporate ride-pooling from a mesoscopic point of view, within time-invariant network flow models of Mobility-on-Demand systems. The resulting problem structure remains identical to a standard network flow model, a linear problem, which can be solved in polynomial time. In order to compute the ride-pooling assignment, which is the matching between two or more users so that they can be pooled together, we devise a polynomial-time knapsack-like algorithm that is optimal w.r.t. the minimum vehicle travel time with users on-board. Finally, we conduct two case studies of Sioux Falls and Manhattan, where we validate our models against state-of-the-art results, and we quantitatively highlight the effects that maximum waiting time and maximum delay thresholds have on the vehicle hours traveled, overall pooled rides, and actual delay experienced. Last, we show that allowing four people ride-pooling can significantly boost the performance of the system.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"906-917"},"PeriodicalIF":4.0,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737394","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":"PDE-Based Leader-Following Coordination Control for Flexible Manipulators With Event-Triggered Communication Over Directed Graphs","authors":"Le Li;Qingzhen Zhang;Jinkun Liu","doi":"10.1109/TCNS.2024.3431414","DOIUrl":"10.1109/TCNS.2024.3431414","url":null,"abstract":"In this article, we address the leader-following coordination control issue for flexible manipulators modeled by fourth-order partial differential equations (PDEs) within an event-triggered communication framework. Most of the existing research on the coordination control of multiple PDE systems assumes that the communication topology is undirected and that communication between neighboring agents is continuous, leading to significant consumption of communication resources. However, in this study, the communication topology among the virtual leader and followers is described by a directed graph, where the leader's reference signal is accessible only to a subset of the followers. Moreover, an event-triggering mechanism is proposed to avoid continuous signal transmission among agents, effectively mitigating the communication burden. An adaptive boundary control scheme based on filters is designed for each following flexible manipulator to track the leader's angle and eliminate unexpected vibrations in the presence of unknown external disturbances. All the signals of the closed-loop system are uniformly bounded. Simulation results show that the presented control scheme is effective.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"894-905"},"PeriodicalIF":4.0,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737396","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":"Dynamic-Memory Event-Based Adaptive Sliding-Mode Control for Networked Nonlinear Implicit Hybrid Systems Under Random Spoofing Attacks and Data-Buffer- Aided Mechanism","authors":"Jingjuan Zhu;Guangming Zhuang;Jianwei Xia;Xiangpeng Xie","doi":"10.1109/TCNS.2024.3431410","DOIUrl":"10.1109/TCNS.2024.3431410","url":null,"abstract":"In this article, we investigates the issue of dynamic-memory event-based adaptive sliding-mode control for fuzzy-model-based nonlinear implicit Markov jump systems. The communication networks are deemed to be invaded by spoofing attacks in a probabilistic manner, where normally transmitted data may be replaced. Depending on the data-buffer-aided mechanism, a novel dynamic-memory event-triggered protocol is proposed to modulate the transmission frequency by drawing into historically released packets and two auxiliary internal dynamic variables. Then, a suitable event-triggered adaptive sliding-mode control strategy is developed to actualize the reachability of the specified integral sliding surface, which is capable of diminishing the impacts of model uncertainties. Stochastic admissibility and strict dissipativity conditions of closed-loop fuzzy implicit Markov jump systems are derived under the framework of linear matrix inequalities. Finally, a networked truck–trailer reversing system is exploited to verify the validity of developed strategies.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"967-979"},"PeriodicalIF":4.0,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737392","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":"Traffic Models of Dynamic Periodic Event-Triggered Control Systems","authors":"Shaobudao Yang;Anqi Fu;Xinyu Wei;Junfei Qiao","doi":"10.1109/TCNS.2024.3425714","DOIUrl":"10.1109/TCNS.2024.3425714","url":null,"abstract":"Dynamic periodic event-triggered control (DPETC) is a type of event-triggered control (ETC) that inherits the excellent properties of ETC to avoid unnecessary communication and further extends the interevent intervals by introducing a dynamic variable. Despite their beneficiary effects, matters, such as communication scheduling, have been proposed due to the aperiodic execution manner. In this work, we focus on constructing an abstracted system, named traffic model. This model can capture the sampling behaviors generated by a DPETC system and is equivalent to a timed automaton. During the construction, we first confine the infinite state space to a finite number of regions. Then, the interevent interval related to each region is calculated by the linear matrix inequality technique. Finally, the reachability analysis is used to locate state transitions between different regions. A numerical example demonstrates the validity of the proposed construction approach.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"860-871"},"PeriodicalIF":4.0,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141571778","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":"State Estimation of Networked Switched Systems via Event-Triggered Zonotopes","authors":"Zhen Wu;Weizhong Chen;Zhongyang Fei;Xudong Zhao","doi":"10.1109/TCNS.2024.3425641","DOIUrl":"10.1109/TCNS.2024.3425641","url":null,"abstract":"In this article, the state estimation issue is investigated for networked switched systems via an event-triggered zonotope method, and the general asynchronism is considered between subsystems and observers. First, the event-triggered zonotope is proposed to enclose the system state, where the observer gain only updates with the switching signal at triggering instants. The restriction on the switching signal is removed such that system switchings can happen more than once over each interevent interval. Then, specific iteration procedures are provided for the generator matrix in synchronous and asynchronous intervals. Solvable conditions are proposed to jointly optimize the event-triggered parameters and observer gains by constructing observer-mode-dependent radius functions. The boundedness and <inline-formula><tex-math>${mathcal {L}}_{infty }$</tex-math></inline-formula> performance are analyzed for the radius of the zonotope under restricted switchings. Finally, an implementation to the H-bridge rectifier is presented, which validates the merits of the proposed method.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"838-846"},"PeriodicalIF":4.0,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141571781","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}