Pub Date : 2025-03-16DOI: 10.1109/JSYST.2025.3565659
Long Qi;Xiang Li
The weighted $k$-path vertex cover (WVCP$_{k}$) problem is a main branch of covering problems on dynamic networks with many numerous instances in real-world complex systems. A pivotal challenge in distributed systems for network covering optimization is designing decentralized schemes for autonomous decision-making agents. This article focuses on the distributed optimization of the WVCP$_{k}$ problem, where individual vertices, acting as rational agents, make decisions independently based on incomplete information. We formulate a Bayesian game model to capture the interactions among agents, who face the uncertainty to the statuses of their $k$-path neighbors and rely on communications to enhance their individual beliefs on the actual cover state. Our analysis delves into the Bayesian Nash equilibrium and the ex-post Pareto optimal cover state (POCS) within this framework. In addition, a Bayesian game-based perturbation parallel algorithm (BGPPA) is developed and shown to converge to the ex-post POCS set, even when agents are restricted to using only estimated expected utility. A series of numerical simulations indicate that the BGPPA delivers superior performance with rapid convergence across various networks.
{"title":"Bayesian Game for Distributed Weighted K-Path Vertex Cover of Dynamic Networks","authors":"Long Qi;Xiang Li","doi":"10.1109/JSYST.2025.3565659","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3565659","url":null,"abstract":"The weighted <inline-formula><tex-math>$k$</tex-math></inline-formula>-path vertex cover (WVCP<inline-formula><tex-math>$_{k}$</tex-math></inline-formula>) problem is a main branch of covering problems on dynamic networks with many numerous instances in real-world complex systems. A pivotal challenge in distributed systems for network covering optimization is designing decentralized schemes for autonomous decision-making agents. This article focuses on the distributed optimization of the WVCP<inline-formula><tex-math>$_{k}$</tex-math></inline-formula> problem, where individual vertices, acting as rational agents, make decisions independently based on incomplete information. We formulate a Bayesian game model to capture the interactions among agents, who face the uncertainty to the statuses of their <inline-formula><tex-math>$k$</tex-math></inline-formula>-path neighbors and rely on communications to enhance their individual beliefs on the actual cover state. Our analysis delves into the Bayesian Nash equilibrium and the ex-post Pareto optimal cover state (POCS) within this framework. In addition, a Bayesian game-based perturbation parallel algorithm (BGPPA) is developed and shown to converge to the ex-post POCS set, even when agents are restricted to using only estimated expected utility. A series of numerical simulations indicate that the BGPPA delivers superior performance with rapid convergence across various networks.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 2","pages":"624-635"},"PeriodicalIF":4.0,"publicationDate":"2025-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144339019","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}
The current Internet struggles to meet the deterministic transmission requirements in terms of end-to-end delay. Time-sensitive networking (TSN) provides a solution by offering deterministic forwarding services for critical flows, ensuring strict latency requirements. However, the costs and complexity of hardware associated with TSN increases the barriers for researchers to build prototype for validating newly proposed queue scheduling algorithms. To address this dilemma, software-based simulation platforms are widely used for reduction of simulation expenses. However, these platforms cannot flexibly simulate various queue scheduling algorithms. Although existing programmable packet scheduling methods can adapt to TSN queue scheduling algorithms for common hardware base, they cannot be directly applied to software-based TSN simulation platforms. In response, we propose a novel lightweight software-defined packet scheduling primitive—first-in-pick-out (FIPO), based on the programmable switch behavior-model-version-2 (BMV2). FIPO is capable of expressing customized queue scheduling algorithms to support current TSN algorithms and can be flexibly extended to future algorithms. Particularly, FIPO consists only of multipriority queues and eligible time comparator to implement TSN queue scheduling with minimal computational and management overhead. We also propose a fine-grained logical queue-based flow queue mechanism to enhance FIPO. Finally, a lightweight prototype system for the FIPO is established, incorporating four customized deterministic scheduling algorithms. Extensive experimental results show that FIPO can quickly implement customized queue scheduling algorithms and simulate network conditions that closely resemble real environments. It also demonstrates increased implementation flexibility, achieving millisecond-level configuration times with only a moderate increase in CPU utilization (less than 10%).
{"title":"FIPO: A Lightweight and Customized Software-Defined Programmable Packet Scheduling Primitive","authors":"Shang Liu;Shuai Gao;Jia Chen;Jing Chen;Wentao Cui;Shangbing Qiao;Hongke Zhang","doi":"10.1109/JSYST.2025.3567017","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3567017","url":null,"abstract":"The current Internet struggles to meet the deterministic transmission requirements in terms of end-to-end delay. Time-sensitive networking (TSN) provides a solution by offering deterministic forwarding services for critical flows, ensuring strict latency requirements. However, the costs and complexity of hardware associated with TSN increases the barriers for researchers to build prototype for validating newly proposed queue scheduling algorithms. To address this dilemma, software-based simulation platforms are widely used for reduction of simulation expenses. However, these platforms cannot flexibly simulate various queue scheduling algorithms. Although existing programmable packet scheduling methods can adapt to TSN queue scheduling algorithms for common hardware base, they cannot be directly applied to software-based TSN simulation platforms. In response, we propose a novel lightweight software-defined packet scheduling primitive—first-in-pick-out (FIPO), based on the programmable switch behavior-model-version-2 (BMV2). FIPO is capable of expressing customized queue scheduling algorithms to support current TSN algorithms and can be flexibly extended to future algorithms. Particularly, FIPO consists only of multipriority queues and eligible time comparator to implement TSN queue scheduling with minimal computational and management overhead. We also propose a fine-grained logical queue-based flow queue mechanism to enhance FIPO. Finally, a lightweight prototype system for the FIPO is established, incorporating four customized deterministic scheduling algorithms. Extensive experimental results show that FIPO can quickly implement customized queue scheduling algorithms and simulate network conditions that closely resemble real environments. It also demonstrates increased implementation flexibility, achieving millisecond-level configuration times with only a moderate increase in CPU utilization (less than 10%).","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 2","pages":"690-700"},"PeriodicalIF":4.0,"publicationDate":"2025-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144339018","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}
Virtual power plants (VPP) may face the risk of economic losses arising from the deviation between day-ahead schedule and real-time energy delivery. This article introduces a novel profit-oriented attack by some greedy VPP (G-VPP) for the first time, which aims to transfer its risk of economic losses to other normal VPPs (N-VPPs) and obtain a risk-free profit. Particularly, the G-VPP launches the load-altering attack (LAA) on N-VPPs to fail their real-time (RT) generation schedule via modifying the generation instructions of the managed resources. The optimal LAA strategy considering stealthiness is proposed to avoid priori detection and the optimal bidding strategy using CVaR is proposed to quantify bidding risk and maximize profit. To defend against such profit-oriented attacks, this article constitutes the first attack traceability research. A defense scheme with attack detection and attacker identification is proposed, which is executed by VPPs and the independent system operator (ISO). VPPs employ an attack detection algorithm based on complex features, and if any, report it to the ISO. The ISO constructs a knowledge graph of electricity market transactions and embeds a rules-based identification algorithm to identify suspected attackers. Simulation results show the effectiveness of the defense scheme and Neo4j is used to visualize.
{"title":"A Profit-Oriented Attack by Virtual Power Plants for Economic Risk Transfer: Profitability Analysis and Defense Strategy","authors":"Luyu Wang;Jiping Wu;Zhetong Ding;Kaifeng Zhang;Biplab Sikdar","doi":"10.1109/JSYST.2025.3566018","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3566018","url":null,"abstract":"Virtual power plants (VPP) may face the risk of economic losses arising from the deviation between day-ahead schedule and real-time energy delivery. This article introduces a novel profit-oriented attack by some greedy VPP (G-VPP) for the first time, which aims to transfer its risk of economic losses to other normal VPPs (N-VPPs) and obtain a risk-free profit. Particularly, the G-VPP launches the load-altering attack (LAA) on N-VPPs to fail their real-time (RT) generation schedule via modifying the generation instructions of the managed resources. The optimal LAA strategy considering stealthiness is proposed to avoid priori detection and the optimal bidding strategy using CVaR is proposed to quantify bidding risk and maximize profit. To defend against such profit-oriented attacks, this article constitutes the first attack traceability research. A defense scheme with attack detection and attacker identification is proposed, which is executed by VPPs and the independent system operator (ISO). VPPs employ an attack detection algorithm based on complex features, and if any, report it to the ISO. The ISO constructs a knowledge graph of electricity market transactions and embeds a rules-based identification algorithm to identify suspected attackers. Simulation results show the effectiveness of the defense scheme and Neo4j is used to visualize.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 2","pages":"507-517"},"PeriodicalIF":4.0,"publicationDate":"2025-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144308383","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-03-16DOI: 10.1109/JSYST.2025.3567254
Licheng Wang;Zidong Wang;Wei Qian;Shuxin Du
This article addresses the consensus control problem for a specific class of discrete-time stochastic multiagent systems (MASs). When transmitting the local measurement output to the local controller and neighboring agents, a multiple description coding (MDC) scheme is introduced to reduce the communication burden and enhance data transmission reliability in a resource-constrained environment. The MDC scheme encodes each signal into two descriptions, which are then transmitted through separate channels, and decoding schemes are employed to address the different characteristics of the arrival of the two descriptions, ensuring the boundedness of the decoding error. The proposed consensus control scheme uses the relative decoded measurement errors between local agents and their neighbors. The aim is to design an output-feedback control scheme that ensures the error dynamics of the controlled MAS reach exponentially mean-square boundedness. Sufficient conditions are established for the existence of the controllers through stochastic analysis techniques, and the desired controller gains are parameterized using the feasibility of certain matrix inequalities. The effectiveness of the proposed coding-decoding-based consensus control scheme is verified through a numerical simulation.
{"title":"Consensus Control for Discrete-Time Stochastic Multiagent Systems Under a Multiple Description Coding Mechanism","authors":"Licheng Wang;Zidong Wang;Wei Qian;Shuxin Du","doi":"10.1109/JSYST.2025.3567254","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3567254","url":null,"abstract":"This article addresses the consensus control problem for a specific class of discrete-time stochastic multiagent systems (MASs). When transmitting the local measurement output to the local controller and neighboring agents, a multiple description coding (MDC) scheme is introduced to reduce the communication burden and enhance data transmission reliability in a resource-constrained environment. The MDC scheme encodes each signal into two descriptions, which are then transmitted through separate channels, and decoding schemes are employed to address the different characteristics of the arrival of the two descriptions, ensuring the boundedness of the decoding error. The proposed consensus control scheme uses the relative decoded measurement errors between local agents and their neighbors. The aim is to design an output-feedback control scheme that ensures the error dynamics of the controlled MAS reach exponentially mean-square boundedness. Sufficient conditions are established for the existence of the controllers through stochastic analysis techniques, and the desired controller gains are parameterized using the feasibility of certain matrix inequalities. The effectiveness of the proposed coding-decoding-based consensus control scheme is verified through a numerical simulation.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 2","pages":"659-669"},"PeriodicalIF":4.0,"publicationDate":"2025-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144339023","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-03-15DOI: 10.1109/JSYST.2025.3562732
Shiv Kumar;Brijesh Kumbhani;Sam Darshi
Simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) and nonorthogonal multiple access (NOMA) are promising solutions for next-generation wireless networks with massive connectivity, ultra-low latency, ultra-high reliability, and spectral efficiency. This article analyzes the performance of the downlink STAR-RIS-aided short-packet (SP)-NOMA (STAR-RIS-SP-NOMA) network under the constraint of imperfect successive interference cancellation (ipSIC) and imperfect channel state information (ipCSI) by using a Nakagami-$m$ fading environment. To characterize the system performance, first, we derive the statistical distribution of cascaded Nakagami-$m$ channels using the Laguerre polynomial series approximation. Second, the approximate closed-form expressions in terms of average block error rate (ABLER), system throughput, goodput, latency, and reliability are derived. Third, the asymptotic analysis is also done at a high signal-to-noise ratio to gain further insights. Finally, the Monte Carlo simulations are performed to verify the correctness of the theoretical results. Numerical results validate the superiority of STAR-RIS-SP-NOMA over STAR-RIS-SP-orthogonal multiple access (OMA) (STAR-RIS-SP-OMA) and the conventional cooperative communication scenarios, such as decode and forward relay-assisted half-duplex-SP-OMA and fixed-gain amplify and forward relay-assisted half-duplex-SP-OMA. We have compared the ABLER expression for all three STAR-RIS operating protocols. Also, the effect of various parameters, such as the ipCSI correlation factor, ipSIC factor, blocklength, information bits, and number of STAR-RIS elements on the system performance is examined.
{"title":"Performance Analysis of STAR-RIS Aided Short-Packet NOMA Network Under Imperfect SIC and CSI","authors":"Shiv Kumar;Brijesh Kumbhani;Sam Darshi","doi":"10.1109/JSYST.2025.3562732","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3562732","url":null,"abstract":"Simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) and nonorthogonal multiple access (NOMA) are promising solutions for next-generation wireless networks with massive connectivity, ultra-low latency, ultra-high reliability, and spectral efficiency. This article analyzes the performance of the downlink STAR-RIS-aided short-packet (SP)-NOMA (STAR-RIS-SP-NOMA) network under the constraint of imperfect successive interference cancellation (ipSIC) and imperfect channel state information (ipCSI) by using a Nakagami-<inline-formula><tex-math>$m$</tex-math></inline-formula> fading environment. To characterize the system performance, first, we derive the statistical distribution of cascaded Nakagami-<inline-formula><tex-math>$m$</tex-math></inline-formula> channels using the Laguerre polynomial series approximation. Second, the approximate closed-form expressions in terms of average block error rate (ABLER), system throughput, goodput, latency, and reliability are derived. Third, the asymptotic analysis is also done at a high signal-to-noise ratio to gain further insights. Finally, the Monte Carlo simulations are performed to verify the correctness of the theoretical results. Numerical results validate the superiority of STAR-RIS-SP-NOMA over STAR-RIS-SP-orthogonal multiple access (OMA) (STAR-RIS-SP-OMA) and the conventional cooperative communication scenarios, such as decode and forward relay-assisted half-duplex-SP-OMA and fixed-gain amplify and forward relay-assisted half-duplex-SP-OMA. We have compared the ABLER expression for all three STAR-RIS operating protocols. Also, the effect of various parameters, such as the ipCSI correlation factor, ipSIC factor, blocklength, information bits, and number of STAR-RIS elements on the system performance is examined.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 2","pages":"600-611"},"PeriodicalIF":4.0,"publicationDate":"2025-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144339024","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}
This article investigates the problem of joint transmit and receive beamforming for a colocated multiple-input multiple-output radar network with multiple targets and signal-dependent interferences. At first, a distributed beamforming design scheme is developed using noncooperative game theory. The basis of this scheme is to minimize the maximum transmit power of antennas for each radar while adhering to the constraint of signal-to-interference-plus-noise ratio for the targets. By transforming the formulated optimization problem into a convex problem, the Lagrangian duality theory is utilized to decompose the original problem into two sub-problems. Then, a subgradient projection method and an equivalent receive beamforming optimization method are developed to tackle the two sub-problems, yielding the optimal transmit beamformers for the radars. After obtaining the transmit and receive beamformers iteratively, the game relationship among radars is then formulated as a power control game, and the paper proves the existence and uniqueness of the Nash equilibrium. Furthermore, a centralized beamforming design problem is explored for comparative analysis, where the beamformers of all radars are jointly optimized to suppress power fluctuations among transmit antennas. Simulation results are provided to validate the effectiveness of the proposed schemes.
{"title":"Distributed Design of Joint Transmit and Receive Beamforming for MIMO Radar Networks Using Game Theory","authors":"Jiale Wu;Chenguang Shi;Jianjiang Zhou;Jinhai Huang","doi":"10.1109/JSYST.2025.3565289","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3565289","url":null,"abstract":"This article investigates the problem of joint transmit and receive beamforming for a colocated multiple-input multiple-output radar network with multiple targets and signal-dependent interferences. At first, a distributed beamforming design scheme is developed using noncooperative game theory. The basis of this scheme is to minimize the maximum transmit power of antennas for each radar while adhering to the constraint of signal-to-interference-plus-noise ratio for the targets. By transforming the formulated optimization problem into a convex problem, the Lagrangian duality theory is utilized to decompose the original problem into two sub-problems. Then, a subgradient projection method and an equivalent receive beamforming optimization method are developed to tackle the two sub-problems, yielding the optimal transmit beamformers for the radars. After obtaining the transmit and receive beamformers iteratively, the game relationship among radars is then formulated as a power control game, and the paper proves the existence and uniqueness of the Nash equilibrium. Furthermore, a centralized beamforming design problem is explored for comparative analysis, where the beamformers of all radars are jointly optimized to suppress power fluctuations among transmit antennas. Simulation results are provided to validate the effectiveness of the proposed schemes.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 2","pages":"459-470"},"PeriodicalIF":4.0,"publicationDate":"2025-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144308407","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-03-12DOI: 10.1109/JSYST.2025.3545815
Mohamed Mogahed;Mo Mansouri
The healthcare delivery system exhibits inherent complexities stemming from its composition of multiple autonomous constituent systems with intricate interdependencies, characterized by dynamic and often decentralized operations. In this context, systems of systems (SoS) governance emerges as a promising paradigm to address these multifaceted challenges and optimize system-wide performance. This article conducts a comprehensive scoping review of SoS governance frameworks, focusing on their applicability to healthcare systems. Through a rigorous review process, 45 studies were selected from three major databases, yielding 37 distinct governance frameworks. The review analyzes publication trends, research objectives, applied frameworks, domains of application, and methodologies, providing a multifaceted understanding of the SoS governance landscape. The study highlights one framework that aligns closely with our proposed construct for healthcare system governance, and the alignment is discussed. In addition, technical components and variations across frameworks are identified and discussed, revealing the complexity and diversity of approaches in SoS governance.
{"title":"Systems of Systems Governance Frameworks: A Thorough Scoping Review and Synthesis Towards Enhancing Healthcare Delivery","authors":"Mohamed Mogahed;Mo Mansouri","doi":"10.1109/JSYST.2025.3545815","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3545815","url":null,"abstract":"The healthcare delivery system exhibits inherent complexities stemming from its composition of multiple autonomous constituent systems with intricate interdependencies, characterized by dynamic and often decentralized operations. In this context, systems of systems (SoS) governance emerges as a promising paradigm to address these multifaceted challenges and optimize system-wide performance. This article conducts a comprehensive scoping review of SoS governance frameworks, focusing on their applicability to healthcare systems. Through a rigorous review process, 45 studies were selected from three major databases, yielding 37 distinct governance frameworks. The review analyzes publication trends, research objectives, applied frameworks, domains of application, and methodologies, providing a multifaceted understanding of the SoS governance landscape. The study highlights one framework that aligns closely with our proposed construct for healthcare system governance, and the alignment is discussed. In addition, technical components and variations across frameworks are identified and discussed, revealing the complexity and diversity of approaches in SoS governance.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 2","pages":"648-658"},"PeriodicalIF":4.0,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144339020","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-03-11DOI: 10.1109/JSYST.2025.3544320
Reza M. Kia;Mahsan Tavakoli-Kakhki
This research investigates a supervisory interval type-2 fuzzy predictive control (SIT2FPC) technique to propose a novel control method for the automatic generation control (AGC) problem in interconnected power systems. The proposed control method comprises two main components: the interval type-2 fuzzy control (IT2FC) technique, employing a proportional integral derivative approach, and a supervisory predictive controller. IT2FC sets are considered for a multiarea interconnected power network, followed by the implementation of a supervisory predictive control method for the entire system. It is demonstrated that the SIT2FPC method effectively addresses the challenges within the overall system. By incorporating a predictive controller as a robust supervisory control technique, the proposed method can effectively handle unexpected problems that may arise within the IT2FC units. In order to evaluate the efficiency and validity of the proposed robust SIT2FPC technique, it is applied to address the AGC problem in a four-area interconnected power grid. Also, the IEEE 39-bus power system is considered as a case study to validate the proposed AGC method. The outcomes of six different simulation scenarios clearly illustrate the effectiveness of the proposed robust control method.
{"title":"Robust Interval Type-2 Fuzzy Predictive Automatic Generation Control of Multiarea Interconnected Power Systems","authors":"Reza M. Kia;Mahsan Tavakoli-Kakhki","doi":"10.1109/JSYST.2025.3544320","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3544320","url":null,"abstract":"This research investigates a supervisory interval type-2 fuzzy predictive control (SIT2FPC) technique to propose a novel control method for the automatic generation control (AGC) problem in interconnected power systems. The proposed control method comprises two main components: the interval type-2 fuzzy control (IT2FC) technique, employing a proportional integral derivative approach, and a supervisory predictive controller. IT2FC sets are considered for a multiarea interconnected power network, followed by the implementation of a supervisory predictive control method for the entire system. It is demonstrated that the SIT2FPC method effectively addresses the challenges within the overall system. By incorporating a predictive controller as a robust supervisory control technique, the proposed method can effectively handle unexpected problems that may arise within the IT2FC units. In order to evaluate the efficiency and validity of the proposed robust SIT2FPC technique, it is applied to address the AGC problem in a four-area interconnected power grid. Also, the IEEE 39-bus power system is considered as a case study to validate the proposed AGC method. The outcomes of six different simulation scenarios clearly illustrate the effectiveness of the proposed robust control method.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 2","pages":"541-552"},"PeriodicalIF":4.0,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144308381","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}
This article explores the distributed containment control problem under dynamic directed topologies in discrete-time nonlinear multiagent systems (MASs) subject to parameter uncertainties that are nonlinearly coupled with the agents' states. Specifically, a parameter estimation algorithm is first adopted to deal with the parametric uncertainty. Then, based on the estimated parameters, a distributed adaptive containment control protocol is proposed in a distributed fashion for nonlinear and uncertain MASs over dynamic digraphs. To tackle the challenges caused by the dynamic topology, the evolution of the dynamic topology of MASs is transformed into time-varying Markov chains. By analyzing the characteristics of time-varying Markov chains, the properties of some key matrices related to the dynamic topology are derived, which benefits the convergence analysis of containment control. By applying the proposed control protocol, the reference signals can be tracked by the leaders, while the followers' states are driven into the convex hull formed by leaders. Finally, simulation results and performance analysis are discussed to demonstrate the effectiveness of developed methods.
{"title":"Distributed Containment Control for Discrete-Time Nonlinear Multiagent Systems Over Dynamic Topology With System Uncertainties","authors":"Changkun Du;Nannan Li;Zhen Li;Samson Shenglong Yu;Chee Peng Lim","doi":"10.1109/JSYST.2025.3554233","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3554233","url":null,"abstract":"This article explores the distributed containment control problem under dynamic directed topologies in discrete-time nonlinear multiagent systems (MASs) subject to parameter uncertainties that are nonlinearly coupled with the agents' states. Specifically, a parameter estimation algorithm is first adopted to deal with the parametric uncertainty. Then, based on the estimated parameters, a distributed adaptive containment control protocol is proposed in a distributed fashion for nonlinear and uncertain MASs over dynamic digraphs. To tackle the challenges caused by the dynamic topology, the evolution of the dynamic topology of MASs is transformed into time-varying Markov chains. By analyzing the characteristics of time-varying Markov chains, the properties of some key matrices related to the dynamic topology are derived, which benefits the convergence analysis of containment control. By applying the proposed control protocol, the reference signals can be tracked by the leaders, while the followers' states are driven into the convex hull formed by leaders. Finally, simulation results and performance analysis are discussed to demonstrate the effectiveness of developed methods.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 2","pages":"483-494"},"PeriodicalIF":4.0,"publicationDate":"2025-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144308408","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-03-09DOI: 10.1109/JSYST.2025.3563693
Yun Chen;Qian Zhang;Xueyang Meng;Yunfei Guo
This article makes one of the first few attempts to investigate the multisensor distributed fusion filtering problem for a special type of time-varying nonlinear stochastic cyber-physical systems (CPSs) via encoding–decoding strategy (EDS) within the finite-horizon probability constraint framework. The random EDS is employed to orchestrate the data transmissions between sensors and remote local filters to enhance the resource-utilization efficiency and data security. A novel probability-constrained distributed fusion filtering (DFF) scheme is established such that the prescribed probabilistic ellipsoidal constraints and stochastic $H_{infty }$ disturbance attenuation index are satisfied for the resultant local and fusion filtering errors. Sufficient conditions are firstly presented to guarantee the existence of desired local filters by iteratively solving a sequence of matrix inequalities. Subsequently, the derived multisensor distributed fusion filter is designed by means of a certain optimization problem to maximize the ellipsoidal set constraint probability of the fused filtering error. Finally, a numerical example demonstrates the validity of the proposed distributed fusion filtering approach.
{"title":"Probability-Constrained Multisensor Distributed Fusion Filtering for Cyber-Physical Systems","authors":"Yun Chen;Qian Zhang;Xueyang Meng;Yunfei Guo","doi":"10.1109/JSYST.2025.3563693","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3563693","url":null,"abstract":"This article makes one of the first few attempts to investigate the multisensor distributed fusion filtering problem for a special type of time-varying nonlinear stochastic cyber-physical systems (CPSs) via encoding–decoding strategy (EDS) within the finite-horizon probability constraint framework. The random EDS is employed to orchestrate the data transmissions between sensors and remote local filters to enhance the resource-utilization efficiency and data security. A novel probability-constrained distributed fusion filtering (DFF) scheme is established such that the prescribed probabilistic ellipsoidal constraints and stochastic <inline-formula><tex-math>$H_{infty }$</tex-math></inline-formula> disturbance attenuation index are satisfied for the resultant local and fusion filtering errors. Sufficient conditions are firstly presented to guarantee the existence of desired local filters by iteratively solving a sequence of matrix inequalities. Subsequently, the derived multisensor distributed fusion filter is designed by means of a certain optimization problem to maximize the ellipsoidal set constraint probability of the fused filtering error. Finally, a numerical example demonstrates the validity of the proposed distributed fusion filtering approach.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 2","pages":"589-599"},"PeriodicalIF":4.0,"publicationDate":"2025-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144339025","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
扫码关注我们
求助内容：
应助结果提醒方式：