检索结果-内蒙古大学图书馆

Real-Time Coordinated Operation of Electric Vehicle Fast Charging Stations With Energy Storage: An Efficient Spatiotemporal Decomposition Approach

引用

IEEE TRANSACTIONS ON SMART GRID 2025年第3期16卷 2464-2477页

作者： Zhu, Zhen Zhang, Hongcai Univ Macau Dept Elect & Comp Engn State Key Lab Internet Things Smart City Macau Peoples R China

Fast charging stations (FCSs) have been widely adopted to meet the increasing charging demands of electric vehicles. The intermittent and impulsive nature of fast charging might significantly deteriorate the safe and efficient operation of the distribution power grid. Integrating battery energy storage systems (BES) in FCSs presents a promising option to mitigate these challenges. However, it is nontrivial to effectively coordinate multiple BES-equipped FCSs due to the highly stochastic charging demand and the spatio-temporal coupling nature of FCS operation. To address these challenges, this paper proposes a two-layer approach for real-time stochastic scheduling of multiple BES-equipped FCSs in a distribution grid. In the upper layer, we propose a computationally efficient dynamic programming method to determine the total power of all BESs at FCSs based on observed real-time fast charging loads and electricity price. Specifically, we derive analytical expressions for efficient offline training and online scheduling of the dynamic programming problem. This approach allows for direct training of value functions without iterative updating and obtaining scheduling decisions without redundant calculations. In the lower layer, we design a consensus-based power allocation strategy to coordinate power dispatch among individual FCSs following the reference power determined in the upper layer. In this way, real-time responses for each BES-equipped FCS can be given sequentially and distributedly. The superiority of the proposed method is validated via numerical simulations in comparison with state-of-the-art benchmarks.

关键词： Uncertainty Real-time systems Electricity Fast charging Costs Dynamic programming Resource management Processor scheduling Fluctuations Energy management Electric vehicle fast charging station battery energy storage dynamic programming consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Solving the shortest path Problem in an interval-valued Neutrosophic Pythagorean environment using an enhanced A* search algorithm

引用

Neutrosophic Sets and Systems 2025年 76卷 360-374页

作者： Raut, Prasanta Kumar Satapathy, Sakya Singh Behera, Siva Prasad Broumi, Said Sahoo, Ajay Kumar Department of Mathematics C.V. Raman Global University Odisha Bhubaneswar India Department of Mathematics Trident Academy of Technology Odisha Bhubaneswar India Laboratory of Information Processing Faculty of Science Ben M’Sik University Hassan II Casablanca Morocco Department of Mathematics Indira Gandhi Institute of Technology Dhenkanal Odisha Sarang759146 India

The A* search algorithm is widely utilized to evaluate the shortest path in a given network. However, in a traditional A* search algorithm, the nodes are assumed to have crisp values, i.e., a single value. This assumption may not hold in many real-world scenarios where uncertainty or ambiguity is involved. In such cases, an interval-valued Neutrosophic Pythagorean (IVNP) environment can provide a more sound and accurate representation. Interval-valued Neutrosophic Pythagorean sets (IVNPS) are an effective way to model vague and imprecise data, which is prevalent in executive problems. These sets provide a more flexible way to capture uncertainty by allowing the values of nodes in the graph to vary within certain intervals rather than having fixed values. This interval representation can effectively handle imprecise or incomplete information and is a powerful tool in executive processes. In this research paper, we proposed an improved A* search algorithm that takes advantage of the interval-valued neutrosophic Pythagorean environment. This algorithm aims to evaluate the shortest path in a graph under uncertainty and ambiguity. The proposed algorithm incorporates the IVNPS theory into the A* search framework to handle the uncertainty in node values and edge weights. It utilizes the concept of neutrosophic Pythagorean distance to calculate the heuristic function and make informed decisions on the next node to expand. © 2025, University of New Mexico. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Semisteady-State Jaya algorithm With a Control Coefficient and a Self-Adaptive Multipopulation Strategy

引用

JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING 2025年第1期2025卷

作者： Ankrah, Joshua Churchill Effah, Francis Boafo Twumasi, Elvis Kwame Nkrumah Univ Sci & Technol Elect Engn Dept Kumasi Ghana

This paper introduces the enhanced semisteady-state Jaya (ESJaya) algorithm, an improved version of the semisteady-state Jaya (SJaya) algorithm. The ESJaya algorithm uses a control coefficient to regulate the influence of the best solution, achieving a better balance between exploration and exploitation. It also features a self-adaptive multipopulation strategy and removes absolute value operators in its update equation for improved performance. Using 20 benchmark functions, the ESJaya algorithm is compared with the traditional Jaya, SJaya, and elitism-based self-adaptive multipopulation Jaya (SAMPEJaya) algorithms. The ESJaya algorithm ranks first in obtaining optimum values, mean accuracy, and stability, showing better overall performance than the others. The ESJaya algorithm ranks first with an average overall rank of 1.750, followed by Jaya, SAMPEJaya, and SJaya with average overall ranks of 2.650, 2.700, and 2.900, respectively. The Wilcoxon signed-rank test confirms the statistical significance of the overall rankings. When compared with the Snow Geese algorithm (SGA), Big Bang-Big Crunch algorithm (BBBCA), firefly algorithm (FA), bat algorithm (BA), cuckoo search algorithm (CSA), and flower pollination algorithm (FPA), the ESJaya algorithm gives competitive results in terms of obtaining optimum values, mean accuracy, and stability. Using four real-world engineering problems, the ESJaya algorithm is compared with the recently proposed piranha predation optimization algorithm (PPOA) and four state-of-the-art algorithms, namely, the COLSHADE algorithm, the sCMAgES algorithm, the SASS algorithm, and the EnMODE algorithm. The ESJaya algorithm finds optimum solutions with good accuracy, consistency, and stability. Overall, it has a slower convergence and longer run time due to its multipopulation strategy and its search for the best solution after each solution update. However, it consistently finds more optimal solutions than other improved algorithms.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

The Coherence and Robustness Analysis for a Family of Unbalanced Networks

引用

IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS 2025年 11卷 378-387页

作者： Liu, Jia-Bao Wang, Xu Hua, Liang Cao, Jinde Chen, Liping Anhui Jianzhu Univ Sch Math & Phys Hefei 230601 Peoples R China Anhui Jianzhu Univ Sch Elect & Informat Engn Hefei 230601 Peoples R China Nantong Univ Sch Elect Engn Nantong 226019 Jiangsu Peoples R China Southeast Univ Sch Math Nanjing 211189 Peoples R China Purple Mt Labs Nanjing 211111 Peoples R China Hefei Univ Technol Sch Elect Engn & Automat Hefei 230009 Peoples R China

This study focuses on the coherence in a class of unbalanced networks, emphasizing the investigation of the impact of leader selection and network parameters on coherence. We discuss three different categories of consensus algorithms: leaderless algorithms of first and second orders, and first-order leader-follower algorithm. Firstly, we derive exact solutions for leaderless network coherence in the first and second orders. Secondly, we design various leader allocation schemes for the first-order leader-follower networks, obtaining expressions correlated with the network scale N, the double-ring cardinalities p and q, and the number of leaders k. Thirdly, we conduct numerical simulations and robustness analyses to explore the impact of leader quantity and topology structure on network coherence. Specifically, the conclusions are as follows: (1) When N decreases, an increase in k demonstrates improved network coherence. (2) The smaller the difference between p and q, the better the coherence. (3) The smaller the sum of p and q, the stronger the robustness. (4) Uniform distribution of k1 and k2 leads to optimal coherence. Finally, the Laplacian energy and Kirchhoff index of the network are analyzed.

关键词： Coherence Robustness Laplace equations Topology Eigenvalues and eigenfunctions Symmetric matrices Numerical simulation consensus algorithm Vectors Stability analysis Unbalanced networks coherence leader selection robustness

来源：评论

学校读者我要写书评

暂无评论

Inversion algorithm determining sharp boundaries in electrical resistivity tomography

引用

Geophysics 2025年第3期90卷 WA221-WA233页

作者： Ishizu, Keiichi Goto, Tada-Nori Fukahata, Yukitoshi Koike, Katsuaki Vachiratienchai, Chatchai Siripunvaraporn, Weerachai University of Hyogo Graduate School of Science Himeji Japan Kyushu University Department of Earth Resources Engineering Fukuoka Japan University of Hyogo Graduate School of Science Himeji Japan Kyoto University Disaster Prevention Research Institute Kyoto Japan Kyoto University Graduate School of Engineering Kyoto Japan Curl-E Geophysics Co. Ltd. Nakhon Pathom Thailand Mahidol University Department of Physics Faculty of Science Bangkok Thailand

Blurred resistivity boundaries resulting from smoothness-regularized inversions of electrical resistivity tomography (ERT) data can lead to inaccurate interpretations of sharp boundary structures. To address this issue, various ERT inversion algorithms have introduced localized adjustments (localized discontinuities) in the regularization operator at positions where sharp boundaries are anticipated. Current approaches rely on prior information about sharp boundary locations, obtained from complementary geophysical, geologic, and drilling data, to determine the positions and weights for these regularization adjustments. However, such prior information is frequently insufficient, limiting the application of localized regularization adjustments. Accordingly, we develop a sharp boundary inversion (SBI) algorithm using the Akaike Bayesian information criterion (ABIC) that determines the optimal positions and weights for localized regularization adjustments by testing various configurations and selecting the one that minimizes ABIC. A synthetic modeling study demonstrates that the SBI algorithm correctly delineated the sharp boundaries of a conductor. Its application to field data demonstrates that it delineated the sharp boundaries of a utility tunnel, and the size and horizontal position of the recovered tunnel were consistent with the estimated dimensions from the blueprint. As it does not rely heavily on prior information, the SBI algorithm can be applied to a wide range of geophysical survey data, even when prior knowledge of sharp boundary locations is limited. © 2025 The Authors.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Design of Routing algorithm for Communication of Power Wireless Sensor Networks Based on Improved Harmony Search

Journal of ICT Standardization

引用

Journal of ICT Standardization 2024年第2期12卷 189-214页

作者： Li, Guo Wang, Ming Hua College of Intelligent Manufacturing and electrical engineering Nanyang Normal University Henan Nanyang473000 China Shandong Gete Aviation Technology Co. Ltd. ShanDong Jinan250000 China

In this paper, a routing algorithm for the communication of power wireless sensor networks based on improved harmony search is proposed to reduce the communication routing delay and energy consumption of power wireless sensor networks. Firstly, according to the composition of communication routing delay and energy consumption of power wireless sensor networks, the delay model and energy consumption model are constructed respectively, and the objective function is constructed by assigning different weights. Then, artificial bee colony algorithm and Levy flight mechanism improved harmony search algorithm are adopted for solving the objective function. Experiment results reveal that the algorithm can meet different users’ different demands on delay and energy consumption. If the user needs low delay, set the low delay weight to 1 and the power consumption weight to 0, then the average delay is 7s, and the average power consumption is 3203J. When user demand is low energy consumption, set the delay weight to 0 and the energy consumption weight to 1, so that the average energy consumption is 2667J and the average delay is 15s, which can meet the needs of users. © 2023 River Publishers.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

ITERATIVE algorithmS WITH SELF-ADAPTIVE RULE AND KM METHOD FOR SOLVING SPLIT FIXED POINT PROBLEMS

引用

UPB Scientific Bulletin, Series A: Applied Mathematics and Physics 2025年第1期87卷 15-28页

作者： Zheng, Lu Gogoasa, Alexandru Department of Business Administration Personnel Management Cheongju University Korea Republic of Department of Mathematics and Informatics National University of Science and Technology Politehnica Bucharest Bucharest060042 Romania

In this paper, we investigate the split fixed point problem regarding pseudocontractive operators and demicontractive operators in Hilbert spaces. We propose an iterative algorithm with self-adaptive rule and the Krasnoselskii-Mann method for finding a solution of this split problem. The self-adaptive rule does not require the a priori knowledge of the Lipschitz constant of pseudocontractive operators. Under several additional conditions, we prove that the presented algorithm converges strongly to a solution of the considered split problem. © 2025, Politechnica University of Bucharest. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed Economic Dispatch for Microgrids Tracking Ramp Power Commands

引用

IEEE TRANSACTIONS ON SMART GRID 2023年第1期14卷 94-111页

作者： Tu, Hao Du, Yuhua Yu, Hui Meena, Shweta Lu, Xiaonan Lukic, Srdjan North Carolina State Univ Dept Elect & Comp Engn Raleigh NC 27606 USA Northwestern Polytech Univ Coll Automat Xian 710129 Shaanxi Peoples R China Temple Univ Coll Engn Philadelphia PA 19122 USA

When in grid-connected mode of operation, distributed generators (DGs) within the microgrid (MG) can coordinate to act as a single entity to provide services to the bulk grid. The DGs can coordinate their power production to minimize the total operating cost, which is known as the distributed economic dispatch. Various methods have been proposed to solve the MG economic dispatch problem (EDP) in a distributed fashion, under the assumption that DGs' power output, in aggregate, follows a constant or slowly varying power command. However, when the MG is providing frequency regulation service, or the internal load is highly dynamic, the MG EDP becomes dynamic, and the state-of-the-art distributed approaches cannot guarantee optimality. In this paper, we propose a distributed economic dispatch algorithm for MGs providing frequency regulation service, as an example of a dispatch profile with ramp commands. A consensus protocol guaranteeing zero steady-state error for ramp inputs is integrated into the EDP to find the optimal solution in a distributed way. With the proposed algorithm, the MG is able to tightly follow a time-varying regulation signal while maintaining an optimal economic dispatch for all the DGs within. We validate the proposed method using regulation signals from PJM and demonstrate the algorithm on a hardware-in-the-loop testbed.

关键词： consensus algorithm distributed control economic dispatch microgrid ramp input regulation service

来源：评论

学校读者我要写书评

暂无评论

Lightweight Blockchain-Based Architecture for 5G Enabled IoT

引用

IEEE ACCESS 2023年 11卷 60223-60239页

作者： Maroufi, Mohammad Abdolee, Reza Tazekand, Behzad Mozaffari Mortezavi, Seyed Amir Univ Tabriz Dept ECE Wireless Lab Tabriz 51666 Iran Calif State Univ Channel Isl IoT Lab Camarillo CA 93012 USA Univ Tabriz Dept ECE Tabriz 51666 Iran Univ Tabriz Dept ECE Cryptog Lab Tabriz 51666 Iran

This paper introduces a lightweight Blockchain-based architecture for 5G-enabled Internet-of-Thing (IoT) networks that employs a low-complexity consensus algorithm suitable for resource-constrained IoT devices. By combining 5G technology with a lightweight Blockchain consensus algorithm, the proposed architecture guarantees high availability, real-time data delivery, security, reliability, and low-latency connectivity. Two transaction types are considered in this architecture, i.e., local and public. Local transactions are exchanged within devices located in the same Small Cell (SC) or Macro Cell (MC) private Blockchains, while public transactions exchange data among different MCs in the public Blockchain and store verified data in the distributed ledger. Performance evaluation reveals that the proposed architecture outperforms conventional 5G (without Blockchain) regarding security against data manipulation and fraud. The proposed architecture improves hashing and encryption protocols compared to conventional 5G but slightly reduces the data traffic rate and increases local transaction processing time. In contrast, the proposed architecture reduces the consensus processing time in the public Blockchain compared to Proof of Elapsed Time (PoET) by about thirty percent due to adding a Distributed Trust algorithm (DTA). We evaluate the proposed architecture's performance against conventional 5G and PoET in terms of processing time and power consumption. The results indicate that the proposed architecture provides superior performance, and the DTA algorithm's addition enhances the public transaction's consensus processing time.

关键词： Internet of Things Blockchains Computer architecture 5G mobile communication Security Scalability consensus algorithm Blockchain DTA IoT lightweight PoET scalability security transaction

来源：评论

学校读者我要写书评

暂无评论

引用

Informatica (Slovenia) 2025年第13期49卷 13-32页

作者： Tian, Chuan Wan, Huan Wu, Ye Department of Economic Management Jiangxi Tourism & Commerce Vocational College Nanchang330100 China

In the field of user feature segmentation, the currently adopted segmentation methods have the defect of low segmentation accuracy. To address this problem, the study introduces the K-prototypes algorithm for user feature segmentation to improve the segmentation accuracy of user feature segmentation. The study first improves the traditional K-prototypes algorithm using fuzzy similarity matrix. The improved K-prototypes algorithm can effectively select the initial clustering center and fuzzy coefficients and weight coefficients, and pre-set the number of clusters in order to realize the accurate segmentation of user feature. After that, user feature segmentation model is constructed based on the improved K-prototypes algorithm to plan the best marketing methods for users with different characteristics. The study selected 605, 3200, and 684 data objects from the R15, D13, and credit approval datasets as experimental subject. Moreover, it compared the improved K-prototypes algorithm with the fuzzy C-means clustering algorithm and the density peak clustering algorithm in terms of clustering accuracy, root mean square error, mean absolute error, and clustering recall rate to evaluate the performance of the three algorithms. The performance advantages and disadvantages of the three algorithms were evaluated by accuracy, root mean square error, mean absolute error, and recall. The accuracy of the improved K-prototypes algorithm reached 0.9438, which was significantly higher than the other two algorithms. Moreover, the mean square error and mean absolute error of this algorithm were significantly lower than the other two algorithms, indicating that the clustering effect of this algorithm was significantly better than the other two algorithms. The recall of the improved K-prototypes algorithm reached 0.953, and the variation of recall was small, indicating the efficiency of this algorithm in dividing user features. All three algorithms were able to select the correct initial

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：