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

An enhanced consensus-based distributed secondary control for voltage regulation and proper current sharing in a DC islanded microgrid

引用

FRONTIERS IN ENERGY RESEARCH 2023年 11卷

作者： Mosaad, Nada Abdel-Rahim, Omar Megahed, Tamer F. Rohouma, Wesam Asano, Tanemasa Abdelkader, Sobhy M. Egypt Japan Univ Sci & Technol E JUST Elect Power Engn New Borg El Arab City 21934 Alexandria Egypt Aswan Univ Fac Engn Elect Engn Dept Aswan Egypt Mansoura Univ Fac Engn Elect Engn Dept Mansoura Egypt Univ Doha Sci & Technol Elect Power & Renewable Energy Doha Qatar Kyushu Univ Fac Informat Sci & Elect Engn Fukuoka Japan

A centralized secondary control is utilized in a DC islanded microgrid to fine-tune voltage levels following the implementation of droop control. This is done to avoid conflicts between current allocation and voltage adjustments. However, because it introduces a single point of failure, a distributed secondary control is preferred. This paper introduces a consensus-based secondary distributed control approach to restore critical bus voltages to their nominal values and properly distribute current among converters. The critical bus takes the lead in voltage adjustments, with only connected energy resources contributing to regulation. The microgrid is represented as an undirected graph to facilitate consensus building. Two adjustment terms, delta v and delta i, are generated to assist in returning voltage to its nominal level and correctly allocating current among energy resources. To enhance consistency and improve controller performance compared to those reported in existing literature, all buses are connected to a leader node. In the event of the failure of all converters except one, voltage can still be effectively restored. MATLAB-Simulink simulations are conducted on two medium-voltage DC (MVDC) microgrids to validate the efficiency of the proposed control method. The results confirmed that the proposed control method can effectively maintain voltage stability and enhance the precise distribution of current among agents by 8%.

关键词： DC microgrid distributed secondary control consensus algorithm voltage stability current sharing

来源：评论

学校读者我要写书评

暂无评论

Proof of X: Experimental Insights on Blockchain consensus algorithms in Energy Markets

Proof of X: Experimental Insights on Blockchain Consensus Al...

引用

Innovative Smart Grid Technologies (ISGT)

作者： Travis Machacek Milan Biswal Satyajayant Misra The MITRE Corporation New Mexico State University

ISBN: (数字)9781728188973

ISBN: (纸本)9781728188980

The current centralized model of the electricity market is not efficient in performing distributed energy transactions required for the transactive smart grid. One of the prominent solutions to this issue is to integrate blockchain technologies, which promise transparent, tamper-proof, and secure transaction systems specifically suitable for the decentralized and distributed energy markets. Blockchain has already been shown to successfully operate in a microgrid peer-to-peer (P2P) energy market. The prime determinant of different blockchain implementations is the consensus algorithm they use to reach consensus on which blocks/transactions to accept as valid in a distributed environment. Although different blockchain implementations have been proposed independently for P2P energy market in the microgrid, quantitative experimental analyses and comparison of the consensus algorithms that the different blockchains may use for energy markets, has not been studied. Identifying the right consensus algorithm to use is essential for scalability and operation of the energy market. To this end, we evaluate three popular consensus algorithms: (i) proof of work (PoW), (ii) proof of authority (PoA), and (iii) Istanbul Byzantine fault tolerance (IBFT), running them on a network of nodes set up using a network of docker nodes to form a microgrid energy market. Using a series of double auctions, we assess each algorithm's viability using different metrics, such as time to reach consensus and scalability. The results indicate that PoA is the most efficient and scalable consensus algorithm to hold double auctions in the smart grid. We also identified the minimum hardware specification necessary for devices such as smart meters, which may run these consensus algorithms.

关键词： Scalability consensus algorithm Microgrids Blockchain Smart meters Peer-to-peer computing Smart grids

来源：评论

学校读者我要写书评

暂无评论

Distributed Small Cuts using Semigroups 25

Distributed Small Cuts using Semigroups

引用

26th International Conference on Distributed Computing and Networking, ICDCN 2025

作者： Augustine, John Daga, Mohit Department of Computer Science and Engineering IIT Madras Tamil Nadu Chennai India KTH - Royal Institute of Technology Stockholm Sweden

ISBN: (纸本)9798400710629

In the distributed edge-connectivity problem, every node in the distributed graph (the CONGEST model) needs to find what is the minimum number of edges required to be removed to disconnect the graph. This work addresses edge connectivity of constant size. Here, the first significant result was by [Pritchard and Thurimella, ACM TALG'2011], who gave a randomized algorithm that finds all the small sized cuts in O(D) time. Their algorithm is restrictive and finds cuts of size only one and two. The technique used here is binary random circulation. In this work, we resolve an open problem mentioned in Pritchard and Thurimella giving a deterministic algorithm for finding all cuts of size two in O(D) time. Our algorithm also improves results by Parter [DISC'19], who provided a fault-tolerant based approach to finding min-cuts poly(D, log n) (polynomial in the size of min-cut). © 2025 Copyright held by the owner/author(s).

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Photovoltaic MPPT Based on Improved Whale-Conductance Increment Method 2nd

Research on Photovoltaic MPPT Based on Improved Whale-Conduc...

引用

2nd International Conference on Smart Electrical Grid and Renewable Energy, SEGRE 2024

作者： Wang, Min Li, Ke Zheng, Xiaoyu Zhang, Heng Tan, Qingshan Southwest University of Science and Technology Mianyang621000 China Hydrogen Energy and Multi-energy Complementary Microgrid Engineering Technology Research Center of Sichuan Province Mianyang62100 China

ISBN: (纸本)9789819624553

When the traditional whale-conductance increment method is applied to photovoltaic system under complex condition, the P-U characteristic curve has the problems of large vibration amplitude and long convergence time, which restricts the energy conversion efficiency and working stability of the system. In view of the above problems, an improved compound MPPT algorithm combining whale algorithm and conductance increment method is proposed. In this algorithm, nonlinear convergence factor containing adaptive weight is introduced to replace the linear convergence factor of the original whale algorithm, so as to ensure that the algorithm can leap out of local optimal and enhance global search ability. Meanwhile, the algorithm adds a screening perturbation mechanism to improve the optimization speed while accurately optimizing. The simulation results show that the proposed algorithm can converge faster than the traditional whale-conductance increment algorithm. The optimization speed is significantly faster, and the output curve is smoother. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A Piecewise Approach for the Analysis of Exact algorithms 19th

A Piecewise Approach for the Analysis of Exact Algorithms

引用

19th International Conference and Workshops on algorithms and Computation, WALCOM 2025

作者： Clinch, Katie Gaspers, Serge He, Zixu Saffidine, Abdallah Zhang, Tiankuang School of Computer Science and Engineering UNSW Sydney Sydney Australia

ISBN: (纸本)9789819628445

To analyze the worst-case running time of branching algorithms, the majority of work in exponential time algorithms focuses on designing complicated branching rules over developing better analysis methods for simple algorithms. In the mid-2000s, Fomin et al. introduced measure & conquer, an advanced general analysis method, sparking widespread adoption for obtaining tighter worst-case running time upper bound s for many fundamental NP-complete problems. Yet, much potential in this direction remains untapped, as most subsequent work applied it without further advancement. Motivated by this, we present piecewise analysis, a new general method that analyzes the running time of branching algorithms. Our approach is to define a similarity ratio that divides instances into groups and then analyze the running time within each group separately. The similarity ratio is a scale between two parameters of an instance. Instead of relying on a single measure and a single analysis for the whole instance space, our method allows us to take advantage of different intrinsic properties of instances with different similarity ratio s. To showcase its potential, we reanalyze two 17-year-old algorithms by Fomin et al. from 2007, solving 4-Coloring and #3-Coloring, respectively. The original analysis in their paper gave running times of O(1.7272n) and O(1.6262n), respectively, for these algorithms. Our analysis improves these running times to O(1.7207n) and O(1.6225n). © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Level Planarity Is More Difficult Than We Thought 32

Level Planarity Is More Difficult Than We Thought

引用

32nd International Symposium on Graph Drawing and Network Visualization, GD 2024

作者： Fink, Simon D. Pfretzschner, Matthias Rutter, Ignaz Stumpf, Peter Algorithms and Complexity Group Technische Universität Wien Austria Faculty of Computer Science and Mathematics Universität Passau Germany Charles University Prague Czech Republic

We consider three simple quadratic-time algorithms for Level Planarity and give a level-planar instance that they either falsely classify as negative or for which they output a non-planar drawing. © Simon D. Fink... 详细信息

ISBN: (纸本)9783959773430

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Mitigating Partial Shading Condition in PV System for MPPT Using Evolutionary algorithms 4th

Mitigating Partial Shading Condition in PV System for MPPT U...

引用

4th International Conference on Data, Engineering, and Applications, IDEA 2022

作者： Ritu, K.R. University Institute of Technology RGPV Gandhi Nagar Madhya Pradesh Bhopal462033 India

ISBN: (纸本)9789819700363

Cuckoo search which is an algorithm used to track (MPPT) maximum power point tracking of photovoltaic (PV) systems is discussed in this article. Cuckoo search (CS) has numerous advantages, including a simple tuning procedure with great efficiency and quick convergence. In the search procedure, cuckoo employs a random walk based on Lévy flight. All the three techniques like CS, P&O, PSO of MPPT. Direct duty cycle control is used with a boost converter (DC-DC). In comparison to the other techniques, the findings demonstrate that CS is able to identify maximum power point during partial shading condition with fewer power losses. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithms for the Minimum Weight Cycle/Path Partition Problem 1

引用

18th International Conference on algorithmic Aspects in Information and Management, AAIM 2024

作者： Li, Yaqi Yu, Wei Liu, Zhaohui School of Mathematics East China University of Science and Technology Shanghai200237 China

ISBN: (数字)9789819777983

ISBN: (纸本)9789819777976

Let G=(V,E) be an undirected complete graph on kn vertices. Each edge is associated with a non-negative weight. The edge weights satisfies the triangle inequality. A k-cycle partitioning is a set of n vertex-disjoint k-cycles, i.e. cycles containing exactly k vertices (and thus k-1 edges). The minimum weight k-cycle partition problem (MinWkCP) aims to compute a k-cycle partition with minimum total edge weight. The minimum weight k-path partition problem (MinWkPP) is obtained by replacing cycles with paths in the MinWkCP. In this paper, we first devise a tight 32-approximation algorithm for the MinW4CP, improving on the best-known 3-approximation algorithm by Goemans and Williamson. Then we deal with a special case of the MinWkCP and MinWkPP, where the edge weights are either 1 or 2, and devise approximation algorithms with ratios 8k2+14k-87k2 and 8(k+1)7k, respectively. For the MinW3PP and MinW3CP on {1,2}-edge-weighted graphs, we propose two matching based algorithms with tight approximation ratios 32 and 53, respectively. Finally, for the {1,2}-edge-weighted MinW3CP, we design a local search algorithm to further improve the ratio to 85. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Nearly Optimal Local algorithms for Constructing Sparse Spanners of Clusterable Graphs 27

Nearly Optimal Local Algorithms for Constructing Sparse Span...

引用

27th International Conference on Approximation algorithms for Combinatorial Optimization Problems, APPROX 2024 and the 28th International Conference on Randomization and Computation, RANDOM 2024

作者： Levi, Reut Medina, Moti Tubul, Omer Efi Arazi School of Computer Science Reichman University Herzliya Israel Faculty of Engineering Bar-Ilan University Ramat Gan Israel

ISBN: (纸本)9783959773485

In this paper, we study the problem of locally constructing a sparse spanning subgraph (LSSG), introduced by Levi, Ron, and Rubinfeld (ALGO’20). In this problem, the goal is to locally decide for each e ∈ E if it is in G′ where G′ is a connected subgraph of G (determined only by G and the randomness of the algorithm). We provide an LSSG that receives as a parameter a lower bound, , on the conductance of G whose query complexity is Õ(√n/2). This is almost optimal when is a constant since Ω(√n) queries are necessary even when G is an expander. Furthermore, this improves the state of the art of Õ(n2/3) queries for = Ω(1/n1/12). We then extend our result for (k, in, out)-clusterable graphs and provide an algorithm whose query complexity is Õ(√n + outn) for constant k and in. This bound is almost optimal when out = O(1/√n). © Reut Levi, Moti Medina, and Omer Tubul.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Forward-Forward algorithm on Morphological-Linear Neural Networks 21

Forward-Forward Algorithm on Morphological-Linear Neural Net...

引用

21st International Conference on Electrical Engineering, Computing Science and Automatic Control, CCE 2024

作者： Hernandez-Hernandez, Gerardo Rodriguez-Molina, Alejandro Sanchez-Gutierrez, Maximo E. Villafuerte-Bante, Mario College of Science and Technology Autonomous University of Mexico City Mexico City Mexico

ISBN: (纸本)9798350377545

This paper proposes using the Forward-Forward (FF) algorithm to train hybrid neural networks. We implement the FF algorithm in Morphological-Linear Neural Networks (MLNNs), which consist of two layers. The first layer is made up of morphological neurons and the second consists of perceptron-type neurons. For this we adapt the FF training algorithm in the calculation of the goodness and loss functions derived from the morphological neuron layer. The calculation of the goodness and the loss functions was not modified for the perceptron-type neuron layer. The experimental results show that it is possible to train morphological-linear neural networks with the FF algorithm, obtaining results similar to those obtained with the original FF algorithm. The comparison between the original training algorithm and the proposed one is carried out with low-dimensionality and binary classification datasets from the IMDB natural language processing dataset. Likewise, the ability of the FF algorithm is analyzed and compared in terms of its ability to disentangle patterns for classification tasks. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：