Antônio Sobrinho Campolina Martins;Leandro Ramos de Araujo;Débora Rosana Ribeiro Penido
{"title":"Quasi-Convex NoC Optimization in the Active Multiphase Probabilistic Power Flow","authors":"Antônio Sobrinho Campolina Martins;Leandro Ramos de Araujo;Débora Rosana Ribeiro Penido","doi":"10.1109/JSYST.2025.3532508","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3532508","url":null,"abstract":"This article proposes a new method to optimize the number of clusters (NoC) in the active distance-based clustering multiphase probabilistic power flow (MPPF). The objective is to determine a NoC that highly accurately promotes output variables without overloading the computational time. The method is based on intracluster and intercluster distance evaluations to achieve a good partition. A quasi-convex curve is formed to select the optimal NoC, ensuring an excellent computational time to converge. Tests are carried out using K-means, and simulations are conducted using IEEE unbalanced test feeders. Different input random variables are tested, including correlated and noncorrelated variables, with and without renewable distributed generators. The results prove that the input conditions significantly affect the optimal NoC. Comparisons are made with Monte Carlo simulation to justify the proposed application, showing that the computational time reduction provided by the clustering algorithm reaches up to ∼99% . Since the optimal NoC increases dramatically with the size of the input database, guidelines are proposed to reduce the MPPF dimensionality for more effective probabilistic procedures.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"294-304"},"PeriodicalIF":4.0,"publicationDate":"2025-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645228","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":"Security Offloading Scheduling and Caching Optimization Algorithm in UAV Edge Computing","authors":"Jianli Qiu;Zhufang Kuang;Zhenqi Huang;Siyu Lin","doi":"10.1109/JSYST.2025.3531837","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3531837","url":null,"abstract":"Mobile edge computing, a prospective wireless communication framework, can contribute to offload a large number of tasks to unmanned aerial vehicle (UAV) mobile edge servers. Besides, the demand for server computational resources increasingly ascends as the volume of processing tasks grows. However, in reality, many devices have similar computing tasks and require the same computing data. Therefore, servers can effectively reduce server computing latency and bandwidth costs by caching task data. This investigation explores task security offloading and data caching optimization strategies in scenarios with multiple interfering devices. With the goal of minimizing the total energy consumption, the UAV trajectories, transmission power, task offloading scheduling strategies, and caching decisions is jointly optimized. The corresponding optimization problem, which consists of mixed integer nonlinear programming problem, is formulated. To make this problem solved, the original problem is decomposed into three tiers, and an iterative algorithm named CDSFS which is based on the coordinate descent, successive convex approximation, and flow shop scheduling is proposed. Simulation results demonstrate the stability and superiority of the proposed algorithm.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"96-106"},"PeriodicalIF":4.0,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143637913","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":"Data-Driven Fault-Tolerant Bipartite Consensus for Multiagent Systems With Directed Topology","authors":"Yuan Wang;Zhenbin Du","doi":"10.1109/JSYST.2025.3540722","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3540722","url":null,"abstract":"This article investigates the model-free fault-tolerant bipartite consensus of multiagent systems under directed topology. The radial basis function neural network (RBFNN)-based fault estimation technique is constructed for acquiring unknown actuator faults information directly, in which the topology structure and the information interaction among agents are adequately considered. Compared with the existing method, updating weights using RBFNN estimation is avoided. By utilizing the obtained fault estimation, a distributed model-free adaptive fault-tolerant control (FTC) strategy is developed to achieve bipartite consensus. Unlike other bipartite consensus control techniques, the constructed FTC mechanism does not require accurate system model and structure information, and uses solely the agents' input/output data. Finally, a simulation is performed to verify the proposed mechanism's efficacy.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 2","pages":"425-434"},"PeriodicalIF":4.0,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144308421","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}
Jhonathan Prieto Rojas;Rayan Almazyad;Abdulaziz Al Hayyah;Ahmed Alruhaiman;Mohammed Almusharraf;Suhail Al-Dharrab;Hussein Attia
{"title":"Self-Powered End-to-End Wireless Sensor Network for Geophysical Explorations","authors":"Jhonathan Prieto Rojas;Rayan Almazyad;Abdulaziz Al Hayyah;Ahmed Alruhaiman;Mohammed Almusharraf;Suhail Al-Dharrab;Hussein Attia","doi":"10.1109/JSYST.2025.3532698","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3532698","url":null,"abstract":"The underground layers of the Earth contain immense resources that require geophysical surveys. This article presents an end-to-end, self-powered wireless sensor network (WSN) for geophysical surveys. The WSN conducts geophysical surveys in an energy-efficient, portable manner. It includes a sensing element, advanced electronics, data processing and digitization, and wireless transmission with networking capabilities between sensing nodes. The system is equipped with a power management module with solar-powered charging capabilities, allowing for at least six days of effective operation on a few hours' worth of charge. The electronic circuitry performing amplification and filtering provides cut-off frequencies of 8.2–108 Hz, and the sensor node exhibits a sampling frequency of 600 SPS. Furthermore, the system implements power modes (active/sleep) to reduce power consumption, with a nominal power usage of only 650 mW at its maximum. The WSN comprises a multihop implementation with smart routing to ensure power-efficient and reliable data transmission. In addition, message encryption is implemented for enhanced wireless security. A field test was conducted to validate the proposed geophysical data acquisition system. Geophysical signals were detected and wirelessly transmitted over a 200 m<sup>2</sup> area employing a network of six nodes to a storage unit, where they were successfully reconstructed and remained stored for later processing and analysis.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"107-118"},"PeriodicalIF":4.0,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143637883","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":"Data Compression-Based Model-Free PI Algorithm for Sparse LQT Control in Interconnected Multimachine Power Systems","authors":"Zihan Chen;Shengda Tang","doi":"10.1109/JSYST.2025.3533880","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3533880","url":null,"abstract":"This study delves into the distributed linear quadratic tracking (LQT) problem within interconnected multimachine power systems (IMMPSs), and proposes a model-free policy iteration (PI) algorithm based on data compression technology for designing sparse controllers that align with the actual communication links in IMMPSs. Specifically, to address the practical limitation that communication links between subsystems of IMMPSs may be unavailable, we first formulate a sparse LQT problem in which the sparse patterns of controllers match the actual communication links. Meanwhile, in order to be applicable to real-time applications while overcoming model uncertainty caused by parameter variability common in IMMPSs models, we subsequently develop a data compression-based model-free PI algorithm for the abovementioned sparse LQT problem. The main advantages of this algorithm over existing algorithms for IMMPSs control are threefold: first, it has the ability to operate without a prior knowledge of system model, second, its embedded data compression significantly reduces the time consumption for controller design, making it suitable for real-time applications, and third, it designs controllers based on actual communication links, making it practical for applications where communication infrastructure may be constrained. Finally the efficacy of the proposed algorithm is verified through the IEEE 39-bus New England Power System.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"176-187"},"PeriodicalIF":4.0,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143637951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Consensus of Double-Integrator Multiagent Systems Under Disturbances: Two Types of PI-Based Protocols","authors":"Wenfeng Hu;Yulong Jiang;Biao Luo;Tingwen Huang","doi":"10.1109/JSYST.2025.3532511","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3532511","url":null,"abstract":"This article analyzes the consensus of double-integrator multiagent systems subjected to constant disturbances. First, we propose a proportional–integral (PI)-based consensus protocol with a linear integrator, under which the system can achieve consensus without any steady-state error. By directly analyzing the closed-loop system matrix, a necessary and sufficient condition for parameter selection is derived. Subsequently, to overcome the phase lag defect of the linear integrator, we propose a new PI-based protocol with a split-path nonlinear integrator. The nonlinear consensus protocol can not only ensure that the system achieves asymptotic consensus, but also enhance the transient performance with respect to overshoot. Finally, some simulation comparisons are conducted to validate the effectiveness of the proposed protocols.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"87-95"},"PeriodicalIF":4.0,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143637970","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}
Jianquan Zhu;Haojiang Huang;Wenmeng Zhao;Qiyuan Zheng;Wenhao Liu;Jiajun Chen;Yuhao Luo
{"title":"Bi-Layer Decentralized Optimization Algorithm for Peer-to-Peer Energy Trading in Multimicrogrids","authors":"Jianquan Zhu;Haojiang Huang;Wenmeng Zhao;Qiyuan Zheng;Wenhao Liu;Jiajun Chen;Yuhao Luo","doi":"10.1109/JSYST.2025.3527627","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3527627","url":null,"abstract":"The growth of distributed renewable energy in microgrids (MGs) raises challenges in energy management and consumption. As an innovative approach, peer-to-peer (P2P) energy trading offers a promising solution to address these problems. In this article, we propose a bi-layer decentralized (BLD) optimization algorithm for P2P energy trading in multimicrogrids (MMG). Compared with traditional optimization algorithms that are single-layer decentralized (i.e., decentralizing solely at inter-MG trading and typically centralizing prosumers within the MG), the proposed algorithm achieves bi-layer decentralization (i.e., decentralization extends to both inter-MG and intra-MG trading). In this way, the BLD algorithm can significantly preserve the information privacy and decision independence of prosumers. In addition, the proposed algorithm can efficiently manage power flow in a decentralized manner at both layers, whereas existing decentralized algorithms frequently neglect this critical feature. Furthermore, an accelerated BLD (ABLD) algorithm is proposed to address time-consuming issues in this nested P2P trading for MMG. Numerical simulations on various test systems demonstrate the effectiveness of the proposed algorithm. The results indicate that the error of the proposed algorithm is below 0.1%. In addition, BLD requires 15602.03 s to converge with 560 prosumers, while ABLD only requires 228.05 s.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"282-293"},"PeriodicalIF":4.0,"publicationDate":"2025-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645242","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}
Weiwei Liu;Wenxuan Hu;Wei Jing;Lanxin Lei;Lingping Gao;Yong Liu
{"title":"Learning to Model Diverse Driving Behaviors in Highly Interactive Autonomous Driving Scenarios With Multiagent Reinforcement Learning","authors":"Weiwei Liu;Wenxuan Hu;Wei Jing;Lanxin Lei;Lingping Gao;Yong Liu","doi":"10.1109/JSYST.2025.3528976","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3528976","url":null,"abstract":"Autonomous vehicles trained through multiagent reinforcement learning (MARL) have shown impressive results in many driving scenarios. However, the performance of these trained policies can be impacted when faced with diverse driving styles and personalities, particularly in highly interactive situations. This is because conventional MARL algorithms usually operate under the assumption of fully cooperative behavior among all agents and focus on maximizing team rewards during training. To address this issue, we introduce the personality modeling network (PeMN), which includes a cooperation value function and personality parameters to model the varied interactions in high-interactive scenarios. The PeMN also enables the training of a background traffic flow with diverse behaviors, thereby improving the performance and generalization of the ego vehicle. Our extensive experimental studies, which incorporate different personality parameters in high-interactive driving scenarios, demonstrate that the personality parameters effectively model diverse driving styles and that policies trained with PeMN demonstrate better generalization than traditional MARL methods.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"317-326"},"PeriodicalIF":4.0,"publicationDate":"2025-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645182","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}
Elham Hojati;Alan Sill;Susan Mengel;Sayed Mohammad Bagher Sayedi;Argenis Bilbao;Konrad Schmitt
{"title":"A Comprehensive Monitoring, Visualization, and Management System for Green Data Centers","authors":"Elham Hojati;Alan Sill;Susan Mengel;Sayed Mohammad Bagher Sayedi;Argenis Bilbao;Konrad Schmitt","doi":"10.1109/JSYST.2025.3528748","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3528748","url":null,"abstract":"Maintaining service reliability, achieving sustainability, and ensuring energy efficiency are crucial for green high-performance computing systems. Balancing these factors is a key challenge for modern green data centers. In this research, we propose a monitoring, visualization, and management system for green data centers (MVMS-GDC). Our comprehensive automated platform includes “monitoring system” and “rules and policy management” modules. The “monitoring system” gathers and visualizes time series data from all resources of a green data center, tracking essential metrics and measurements. It audits green energy, microgrid, climate conditions, workloads, hardware, CPU and memory usage, cluster component health, computing node activities, and network health and quality metrics. The “rules and policy management” module defines and enforces policies to balance resources, ensuring a reliable, sustainable, scalable, and efficient computing environment. We implemented, tested, and evaluated the MVMS-GDC system using green energy at the Zephyr data center located at the GLEAMM site. Our results demonstrate at least a 4.9% improvement in performance, at least a 4% increase in energy efficiency, and a reduction of at least 4% in job losses. The MVMS-GDC system also enhances scalability by employing a policy machine for each compute node, which automates power state control (<sc>on</small>, <sc>off</small>, or hibernation) based on monitoring observations. This automated approach ensures efficient and dynamic scaling, making MVMS-GDC suitable for large and highly distributed data centers. Overall, MVMS-GDC provides a robust solution for balancing energy availability and computational needs, optimizing performance, and maintaining energy efficiency in green data centers.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"119-129"},"PeriodicalIF":4.0,"publicationDate":"2025-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645229","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":"Affine Formation Maneuver Control of Multiagent Systems With Disturbances Based on RISE Controller","authors":"Liwen Weng;Zhitao Li;Lixin Gao","doi":"10.1109/JSYST.2025.3529502","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3529502","url":null,"abstract":"In the affine formation maneuver control for multiagent systems with a leader-follower structure, external disturbances easily cause deformation of the formation shape, thereby affecting a series of cascading reactions. Hence, robustness against disturbances in affine formation control has been a subject remaining to be determined. To address this problem, a continuous robust controller is introduced in this study, leveraging the robust integral of the sign of the error (RISE) approach, aiming to suppress external disturbances while ensuring efficient convergence speed of the system under various collective formation maneuvers determined by the leader. The controller is designed to handle two types of disturbance models: one involving general disturbances and the other considering time-delay disturbances. It consists of formation tracking terms based on stress matrices and graph theory, as well as disturbance suppression terms utilizing RISE. Sufficient conditions for the stability of affine formations under both types of disturbances are derived. By designing a Lyapunov function that integrates a class-P function, the exponential stability of the closed-loop system is rigorously demonstrated. Finally, simulation results are provided to verify the performance and effectiveness of the proposed control strategy.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"142-151"},"PeriodicalIF":4.0,"publicationDate":"2025-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143637865","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}