IEEE Systems Journal最新文献_第3页

Adaptive Consensus Tracking Control for Nonlinear Multiagent Systems With Unknown Dynamics: A State Observer-Based Framework 未知动态非线性多智能体系统的自适应一致性跟踪控制：一个基于状态观测器的框架

IF 4 3区计算机科学

IEEE Systems Journal Pub Date : 2025-03-21 DOI: 10.1109/JSYST.2025.3562957

Xiao Chen;Jinsha Li;Jiaxi Chen;Junmin Li;Weisheng Chen

{"title":"Adaptive Consensus Tracking Control for Nonlinear Multiagent Systems With Unknown Dynamics: A State Observer-Based Framework","authors":"Xiao Chen;Jinsha Li;Jiaxi Chen;Junmin Li;Weisheng Chen","doi":"10.1109/JSYST.2025.3562957","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3562957","url":null,"abstract":"In this study, we introduce an observer-based adaptive output-feedback tracking consensus approach designed for a class of uncertain nonlinear leader–follower multiagent systems. Each follower agent exhibits second-order unknown nonlinear dynamics, incorporates unmeasured states, and possesses an unknown control direction. To tackle these challenges, fuzzy logic system is integrated with an observer, and a Nussbaum-type item is integrated into the protocol for each agent to adaptively and cooperatively determine the control direction. Subsequently, we have developed adaptive fuzzy distributed control protocols for each follower agent. The proposed consensus protocols have been demonstrated to ensure semiglobally uniformly ultimate boundedness for all system signals. Furthermore, we extend the control gain from constant to a state-dependent gain, delving into the globally uniformly ultimate boundedness of multiagent systems. To mitigate the intricacies arising from virtual control differentiation, command filtering is integrated with backstepping techniques, thereby streamlining the control process and enhancing overall system performance. The efficacy of the proposed method has been validated through simulation examples.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 2","pages":"447-458"},"PeriodicalIF":4.0,"publicationDate":"2025-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144308403","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}

引用次数: 0

Safety Analysis and Prediction of UAVs Aerial Refueling Docking Based on Deep Learning Data-Driven Method 基于深度学习数据驱动的无人机空中加油对接安全分析与预测

IF 4 3区计算机科学

IEEE Systems Journal Pub Date : 2025-03-18 DOI: 10.1109/JSYST.2025.3546476

Bin Hang;Shuai Liang;Pengjun Guo;Bin Xu

引用次数: 0

IEEE Systems Journal Information for Authors IEEE 系统期刊作者信息

IF 4 3区计算机科学

IEEE Systems Journal Pub Date : 2025-03-17 DOI: 10.1109/JSYST.2024.3525313

引用次数: 0

IEEE Systems Council Information 电气和电子工程师学会系统理事会信息

IF 4 3区计算机科学

IEEE Systems Journal Pub Date : 2025-03-17 DOI: 10.1109/JSYST.2024.3525315

引用次数: 0

IEEE Systems Journal Publication Information IEEE系统期刊出版信息

IF 4 3区计算机科学

IEEE Systems Journal Pub Date : 2025-03-17 DOI: 10.1109/JSYST.2024.3525309

引用次数: 0

Bayesian Game for Distributed Weighted K-Path Vertex Cover of Dynamic Networks 动态网络分布加权k路径顶点覆盖的贝叶斯博弈

IF 4 3区计算机科学

IEEE Systems Journal Pub Date : 2025-03-16 DOI: 10.1109/JSYST.2025.3565659

Long Qi;Xiang Li

{"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}

引用次数: 0

FIPO: A Lightweight and Customized Software-Defined Programmable Packet Scheduling Primitive FIPO：一种轻量级的自定义软件定义可编程包调度原语

IF 4 3区计算机科学

IEEE Systems Journal Pub Date : 2025-03-16 DOI: 10.1109/JSYST.2025.3567017

Shang Liu;Shuai Gao;Jia Chen;Jing Chen;Wentao Cui;Shangbing Qiao;Hongke Zhang

{"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}

引用次数: 0

A Profit-Oriented Attack by Virtual Power Plants for Economic Risk Transfer: Profitability Analysis and Defense Strategy 面向经济风险转移的虚拟电厂盈利攻击：盈利能力分析与防御策略

IF 4 3区计算机科学

IEEE Systems Journal Pub Date : 2025-03-16 DOI: 10.1109/JSYST.2025.3566018

Luyu Wang;Jiping Wu;Zhetong Ding;Kaifeng Zhang;Biplab Sikdar

{"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}

引用次数: 0

Consensus Control for Discrete-Time Stochastic Multiagent Systems Under a Multiple Description Coding Mechanism 多描述编码机制下离散时间随机多智能体系统的一致性控制

IF 4 3区计算机科学

IEEE Systems Journal Pub Date : 2025-03-16 DOI: 10.1109/JSYST.2025.3567254

Licheng Wang;Zidong Wang;Wei Qian;Shuxin Du

{"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}

引用次数: 0

Performance Analysis of STAR-RIS Aided Short-Packet NOMA Network Under Imperfect SIC and CSI 不完全SIC和CSI条件下STAR-RIS辅助短包NOMA网络性能分析

IF 4 3区计算机科学

IEEE Systems Journal Pub Date : 2025-03-15 DOI: 10.1109/JSYST.2025.3562732

Shiv Kumar;Brijesh Kumbhani;Sam Darshi

{"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}

引用次数: 0