{"title":"Event-Based Optimal Containment Control for Constrained Multiagent Systems Using Integral Reinforcement Learning","authors":"Zijie Guo;Hongru Ren;Hongyi Li;Tingwen Huang","doi":"10.1109/TCNS.2024.3510353","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3510353","url":null,"abstract":"An optimal event-driven containment control problem is studied for partially unknown nonlinear multiagent systems with input constraints and state constraints. Its novelty lies in the optimization of the performance index while ensuring constraints handling abilities on states and inputs. First, an improved discounted cost function is constructed, and the state and input constraint information are encoded into the cost function by barrier functions and nonquadratic utility functions, respectively. Then, the approximate distributed optimal containment control policy is derived by an integral reinforcement learning (IRL)-based adaptive critic design, where the IRL technique can overcome the limitation of known drift dynamics in previous results. In critic neural networks learning, the weight tuning law is presented by virtue of the concurrent learning technique, which relaxes the persistence of excitation conditions by storing appropriate historical data. In order to reduce the amount of information transmitted through the controller-to-actuator channel, a containment error-dependent dynamic event-triggered mechanism is defined. Theoretical results indicate that signals in closed-loop systems driven by event-triggered optimal controllers are uniformly ultimately bounded, and Zeno behavior is avoided. Finally, the effectiveness of the developed method is illustrated by a simulation example on multiple single-link robot manipulators.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"609-619"},"PeriodicalIF":4.0,"publicationDate":"2024-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143688098","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":"Nussbaum-Based Distributed Containment Control for Nonlinear Multiagent Systems With Quantized Inputs","authors":"Yang Liu;Jiaming Zhang","doi":"10.1109/TCNS.2024.3510573","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3510573","url":null,"abstract":"This article explores the distributed containment control problem for uncertain nonlinear multiagent systems subject to external disturbances and input quantization, where the constant control gains and the upper bounds of the external disturbances are unknown. First, the reference generator is constructed for each follower agent to generate the virtual tracking signal, confining to the convex hull spanned by the leaders. Meanwhile, the unmeasurable state variable of each follower is estimated by adopting the <inline-formula><tex-math>$K$</tex-math></inline-formula>-filters based on the available output/input signals and known system function matrices. Then, a distributed adaptive output feedback controller with only one updating parameter is designed for each follower by introducing a logarithmic quantization to quantize the control inputs under the framework of prescribed performance control. The lack of a priori knowledge for the control gain and the quantization gain is counteracted effectively by employing the Nussbaum function method in the adaptive backstepping design process. It is proved that the outputs of followers can enter into the convex hull of multiple leaders and the relevant tracking errors satisfy the prescribed performance index. Finally, the validity of the proposed schemes is illustrated through simulation studies on robotic systems.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1290-1299"},"PeriodicalIF":4.0,"publicationDate":"2024-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331800","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":"Output Regulation of Boolean Control Networks Under Probabilistic Outputs","authors":"Jie Zhong;Qinyao Pan;Die Xu;Bowen Li;Ning Li","doi":"10.1109/TCNS.2024.3510578","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3510578","url":null,"abstract":"In this article, the output regulation problem (ORP) of Boolean control networks (BCNs) is studied via the semitensor product of matrices, with consideration of probabilistic outputs from the reference Boolean networks (BNs). We first define the concept of mean square error (MSE) between outputs of two BNs, establishing several theoretical results on the solvability of the ORP. Subsequently, state feedback controllers are designed to address the ORP of BCNs under different scenarios. In the first scenario, ORP is addressed by developing control strategies that ensure the system's output remains within a predefined MSE threshold. In the second scenario, we focus on achieving the minimum MSE through the optimization of control strategies. The final scenario extends the second by conducting a detailed analysis to maintain this minimum MSE uniformly across all state pairs. To conclude, several numerical examples are provided to verify the effectiveness of the proposed theoretical results.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"28-37"},"PeriodicalIF":4.0,"publicationDate":"2024-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676102","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":"Distributed Finite-Time Observer for Rapid Detection of Multiple Line Outages in Transmission Networks With Uncertain Parameters","authors":"Yu Chen;Zhi-Wei Liu;Guanghui Wen;Yan-Wu Wang","doi":"10.1109/TCNS.2024.3510364","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3510364","url":null,"abstract":"Fast line outages detection is crucial for the safe operation of power systems. This article proposes a novel algorithm for detecting multiple line outages (MLOs) using a distributed finite-time observer, which overcomes the limitations of existing methods that rely on difficult-to-obtain information, such as rotor inertia and damping ratio. The proposed algorithm relies solely on local measurements and information from neighbors to update each node's local observer. Rigorous mathematical analysis validates that the finite-time observer can converge in finite time, facilitating rapid identification of MLOs. Numerical experiments demonstrate the algorithm's rapidity and scalability.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"596-608"},"PeriodicalIF":4.0,"publicationDate":"2024-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143688082","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":"Opinion Dynamics for Utility Maximizing Agents: Exploring the Impact of the Resource Penalty","authors":"Prashil Wankhede;Nirabhra Mandal;Sonia Martínez;Pavankumar Tallapragada","doi":"10.1109/TCNS.2024.3510590","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3510590","url":null,"abstract":"We propose a continuous-time nonlinear model of opinion dynamics with utility-maximizing agents connected via a social influence network. A distinguishing feature of the proposed model is the inclusion of an opinion-dependent resource-penalty term in the utilities, which limits the agents from holding opinions of large magnitude. This model is applicable in scenarios where the opinions pertain to the usage of resources, such as money, time, computational resources, etc. Each agent myopically seeks to maximize its utility by revising its opinion in the gradient ascent direction of its utility function, thus leading to the proposed opinion dynamics. We show that for any arbitrary social influence network, opinions are ultimately bounded. For networks with <italic>weak antagonistic relations</i>, we show that there exists a globally exponentially stable equilibrium using contraction theory. We establish conditions for the existence of consensus equilibrium and analyze the relative dominance of the agents at consensus. We also conduct a game-theoretic analysis of the underlying opinion formation game, including on Nash equilibria and on prices of anarchy in terms of <italic>satisfaction ratios</i>. In addition, we also investigate the oscillatory behavior of opinions in a two-agent scenario. Finally, simulations illustrate our findings.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"5-17"},"PeriodicalIF":4.0,"publicationDate":"2024-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675669","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}
Jun Li;Huaqing Li;Dawen Xia;Tingwen Huang;Lifeng Zheng;Liang Ran;Lianghao Ji
{"title":"Constraint-Projection-Based Actor–Critic Algorithm for Dynamic Distributed Economic Dispatch With Nonconvex Nonsmooth Cost","authors":"Jun Li;Huaqing Li;Dawen Xia;Tingwen Huang;Lifeng Zheng;Liang Ran;Lianghao Ji","doi":"10.1109/TCNS.2024.3510598","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3510598","url":null,"abstract":"Out of consideration for the dynamic demand of energy dispatching with local affine constraints and globally shared nonconvex nonsmooth hybrid cost arising from highly prevalent intermittent renewable energy sources, load effects, and multiple fuel resources, the constraint-projection-based actor–critic algorithm is investigated to solve the dynamic distributed economic dispatch problem in microgrids. To characterize the generation power against the fuel cost, we denote various fuel choices by segmented nonconvex costs. To help address the lack of prior knowledge of the system model, we propose a novel distributed actor–critic algorithm to find the feasible power. The algorithm combines the actor policy network with the multiplier splitting approach and projected gradient method, maps the action's policy distribution to a feasible power interval, and finally realizes real-time dispatching in continuous action space by approximating the evaluation function from the critic network. The convergence of the algorithm is theoretically analyzed. The effectiveness of the approach is verified by several simulations.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"1102-1114"},"PeriodicalIF":4.0,"publicationDate":"2024-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143667718","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":"Certifying Stability and Performance of Uncertain Differential–Algebraic Systems: A Dissipativity Framework","authors":"Emily Jensen;Neelay Junnarkar;Murat Arcak;Xiaofan Wu;Suat Gumussoy","doi":"10.1109/TCNS.2024.3510585","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3510585","url":null,"abstract":"This article presents a novel framework for characterizing the dissipativity of uncertain systems whose dynamics evolve according to differential–algebraic equations. Sufficient conditions for dissipativity (specializing to, e.g., stability or <inline-formula><tex-math>$L_{2}$</tex-math></inline-formula> gain bounds) are provided in the case that uncertainties are characterized by integral quadratic constraints. For polynomial or linear dynamics, these conditions can be efficiently verified through sum-of-squares or semidefinite programming. The performance analysis of the IEEE 39-bus power network with a set of potential line failures modeled as an uncertainty set provides an illustrative example that highlights the computational tractability of this approach; conservatism introduced in this example is shown to be quite minimal.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"18-27"},"PeriodicalIF":4.0,"publicationDate":"2024-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676146","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}
Zhen-Hua Zhu;Huaiyu Wu;Han Wu;Zhi-Hong Guan;Xiujuan Zheng;Zhi-Wei Liu
{"title":"Necessary and Sufficient Conditions for Finite-Time and Fixed-Time Bipartite Containment Control of Cooperative–Antagonistic Networks","authors":"Zhen-Hua Zhu;Huaiyu Wu;Han Wu;Zhi-Hong Guan;Xiujuan Zheng;Zhi-Wei Liu","doi":"10.1109/TCNS.2024.3496653","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3496653","url":null,"abstract":"This article addresses the problems of finite-time and fixed-time bipartite containment control for single-integrator cooperative-antagonistic networks with multiple leaders over arbitrary weakly connected signed digraphs. The leaders can be either stationary or evolving dynamically through interacting with other leaders in their neighborhood. Based on the nearest neighbor rule, a unified distributed nonlinear control scheme is proposed. With rigorous Lyapunov-based analysis, it is shown that under the proposed control scheme, all followers can converge toward the convex hull formed by each leader's trajectory and its symmetrical trajectory having the same amplitude but different sign in a finite time or fixed time if and only if the underlying weakly connected signed digraph contains at least one structurally balanced closed strong component. As a byproduct, necessary and sufficient criteria are established for single-integrator cooperative-antagonistic networks to achieve finite-time and fixed-time bipartite consensuses, interval bipartite consensus, and stability. The effectiveness of the presented control scheme is illustrated via simulations.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"571-583"},"PeriodicalIF":4.0,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143688083","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":"Pinning Control Strategy for Prescribed-Time Synchronization of Stochastic Complex Dynamical Networks","authors":"Xiaotong Liu;Ying Guo;Jin Li;Mingzhu Li","doi":"10.1109/TCNS.2024.3488515","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3488515","url":null,"abstract":"In this article, a new type of pinning control (PC) is proposed to investigate the prescribed-time synchronization (PTS) of stochastic complex dynamical networks (SCDNs) with or without time-varying delays (TVDs). It is worth noting that this article introduces stochastic perturbations in general complex dynamical networks, and investigates the properties of SCDNs with or without TVDs, respectively. Besides, using the Lyapunov method and graph theory, SCDNs with or without TVDs under PC can reach the PTS at the given settling time, where only some of the nodes of SCDNs need to be controlled. Furthermore, the theoretical results are applied to Chua's circuits and some numerical simulations are offered to support the validity of the theoretical results.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"510-520"},"PeriodicalIF":4.0,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676043","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 New Framework on Controllability of the Second-Order Multiagent Systems Under Fixed and Switching Topologies","authors":"Hao Long;Yuanchao Si","doi":"10.1109/TCNS.2024.3488562","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3488562","url":null,"abstract":"This article presents a new framework for the controllability of the second-order multiagent systems under fixed and switching topologies. With the neighbor-based protocol adopted, the multiagent systems under fixed topology are transformed into a second-order time-invariant system. The solution of the system is obtained by using the Wronskian technique and a series of criteria for the controllability of the system are established. For the multiagent systems under switching topologies, a second-order switched system is obtained by applying the time-varying protocol. An explicit solution of the system is presented by constructing a new nested function and a Gramian-type criterion on the controllability of the system is established. On this basis, a new nested subspace is constructed, which turns out to be equivalent to the controllable state set of the system. Several examples are provided to demonstrate the effectiveness of the theoretical results.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"546-557"},"PeriodicalIF":4.0,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676145","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}