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

A Distributed SOC Balance Control Strategy in the DC Microgrid Based on the Virtual DC Machine Control

学校读者我要写书评

暂无评论

A Distributed SOC Balance Control Strategy in the DC Microgr...

International Conference on Information Systems and Computer Aided Education (ICISCAE)

作者： Yiwei Guo Senhao Song Chang Guan Northeast Electric Power University Jilin China

ISBN: (数字)9798350350760

ISBN: (纸本)9798350350777

The virtual DC motor (VDCM) control strategy can simulate the dynamic response of DC motors, enhance system stability and controllability, and has received widespread attention. However, a key challenge in the efficient operation of DC microgrids is the state of charge (SOC) balance of energy storage units, which is crucial for improving the utilization efficiency of energy storage units. This paper introduces an innovative control method that uses VDCM as the basic control layer and combines dynamic consensus algorithm to design SOC balance controller. The proposed method not only maintains the stability of the DC bus voltage, but also achieves SOC consistency among multiple energy storage units. This article validated the effectiveness of the control strategy through a simulation platform built using Matlab/Simulink. The results indicate that the controller can optimize the output of energy storage units, thereby improving the overall efficiency and lifespan of DC microgrid systems.

关键词： Heuristic algorithms Microgrids consensus algorithm Power system stability DC motors Stability analysis State of charge MATLAB Voltage control Energy storage

LARGE GRAPH LIMITS OF LOCAL MATCHING algorithmS ON UNIFORM RANDOM GRAPHS

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Aoudi, Mohamed Habib Aliou Diallo Moyal, Pascal Robin, Vincent

In this work, we propose a large-graph limit estimate of the matching coverage for several matching algorithms, on general graphs generated by the configuration model. For a wide class of local matching algorithms, namely, algorithms that only use information on the immediate neighborhood of the explored nodes, we propose a joint construction of the graph by the configuration model, and of the resulting matching on the latter graph. This leads to a generalization in infinite dimension of the differential equation method of Wormald: We keep track of the matching algorithm over time by a measure-valued CTMC, for which we prove the convergence, to the large-graph limit, to a deterministic hydrodynamic limit, identified as the unique solution of a system of ODE’s in the space of integer measures. Then, the asymptotic proportion of nodes covered by the matching appears as a simple function of that solution. We then make this solution explicit for three particular local algorithms: the classical greedy algorithm, and then the uni-min and uni-max algorithms, two variants of the greedy algorithm that select, as neighbor of any explored node, its neighbor having the least (respectively largest) residual *** Codes 05C80, 60J25, 91B68 Copyright © 2024, The Authors. All rights reserved.

关键词： consensus algorithm

New results for the detection of bicliques

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Manoussakis, George LI-PARAD Université de Versailles Saint-Quentin-En-Yvelines Paris Saclay France

Building on existing algorithms and results, we offer new insights and algorithms for various problems related to detecting maximal and maxi- mum bicliques. Most of these results focus on graphs with small maximum degree, providing improved complexities when this parameter is constant;a common characteristic in real-world graphs. © 2024, CC BY.

关键词： consensus algorithm

Distributed weak independent sets in hypergraphs: Upper and lower bounds

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Adamson, Duncan Rosenbaum, Will Spirakis, Paul G. School of Computer Science University of St Andrews United Kingdom Department of Computer Science University of Liverpool United Kingdom

In this paper, we consider the problem of finding weak independent sets in a distributed network represented by a hypergraph. In this setting, each edge contains a set of r vertices rather than simply a pair, as in a standard graph. A k-weak independent set in a hypergraph is a set where no edge contains more than k vertices in the independent set. We focus two variations of this problem. First, we study the problem of finding k-weak maximal independent sets, k-weak independent sets where each vertex belongs to at least one edge with k vertices in the independent set. Second we introduce a weaker variant that we call (α, β)-independent sets where the independent set is β-weak, and each vertex belongs to at least one edge with at least α vertices in the independent set. Finally, we consider the problem of finding a (2, k)-ruling set on hypergraphs, i.e. independent sets where no vertex is a distance of more than k from the nearest member of the set. Given a hypergraph H of rank r and maximum degree ∆, we provide a LLL formulation for finding an (α, β)-independent set when (β−α)2/(β+α) ≥ 6 log(16r∆), an O(∆r/(β−α+1)+log∗ n) round deterministic algorithm finding an (α, β)-independent set, and a O(∆2(r − k) log r + ∆ log r log∗ r + log∗ n) round algorithm for finding a k-weak maximal independent set. Additionally, we provide zero round randomized algorithms for finding (α, β) independent sets, when (β−α)2/(β+α) ≥ 6clog n+6 for some constant c, and finding an m-weak independent set for some m ≥ r/2k where k is a given parameter. Finally, we provide lower bounds of Ω(∆ + log∗ n) and Ω(r + log∗ n) on the problems of finding a k-weak maximal independent sets for some values of k. © 2024, CC BY.

关键词： consensus algorithm

Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Behnezhad, Soheil Ghafari, Alma Northeastern University United States

We study the fully dynamic maximum matching problem. In this problem, the goal is to efficiently maintain an approximate maximum matching of a graph that is subject to edge insertions and deletions. Our focus is particularly on algorithms that maintain the edges of a (1 − Ε)-approximate maximum matching for an arbitrarily small constant Ε > 0. Until recently, the fastest known algorithm for this problem required Θ(n) time per update where n is the number of vertices. This bound was slightly improved to n/(log∗ n)Ω(1) by Assadi, Behnezhad, Khanna, and Li [STOC’23] and very recently to n/2Ω(√log n) by Liu [FOCS’24]. Whether this can be improved to n1−Ω(1) remains a major open problem. In this paper, we introduce Ordered Ruzsa-Szemerédi (ORS) graphs (a generalization of Ruzsa-Szemerédi graphs) and show that the complexity of dynamic matching is closely tied to them. For δ > 0, define ORS(δn) to be the maximum number of matchings M1, . . ., Mt, each of size δn, that one can pack in an n-vertex graph such that each matching Mi is an induced matching in subgraph M1 ∪ . . . ∪ Mi. We show that there is a randomized algorithm that maintains a (1 − Ε)-approximate maximum matching of a fully dynamic graph in Õ(√ n 1+Ε · ORS(ΘΕ(n)) ) amortized update-time. While the value of ORS(Θ(n)) remains unknown and is only upper bounded by n1−o(1), the densest construction known from more than two decades ago only achieves ORS(Θ(n)) ≥ n1/Θ(log log n) = no(1) [Fischer et al. STOC’02]. If this is close to the right bound, then our algorithm achieves an update-time of √n1+O(Ε), resolving the aforementioned longstanding open problem in dynamic algorithms in a strong sense. Copyright © 2024, The Authors. All rights reserved.

关键词： consensus algorithm

Vehicular Localization Enhancement via consensus

学校读者我要写书评

暂无评论

SENSORS 2020年第22期20卷 6506页

作者： Kim, Hong Ki Kim, Minji Lee, Sang Hyun Korea Univ Sch Elect Engn Seoul 02841 South Korea

This paper presents a strategy to cooperatively enhance the vehicular localization in vehicle-to-everything (V2X) networks by exchanges and updates of local data in a consensus-based manner. Where each vehicle in the network can obtain its location estimate despite its possible inaccuracy, the proposed strategy takes advantage of the abundance of the local estimates to improve the overall accuracy. During the execution of the strategy, vehicles exchange each other's inter-vehicular relationship pertaining to measured distances and angles in order to update their own estimates. The iteration of the update rules leads to averaging out the measurement errors within the network, resulting in all vehicles' localization error to retain similar magnitudes and orientations with respect to the ground truth locations. Furthermore, the estimate error of the anchor-the vehicle with the most reliable localization performance-is temporarily aggravated through the iteration. Such circumstances are exploited to simultaneously counteract the estimate errors and effectively improve the localization performance. Simulated experiments are conducted in order to observe the nature and its effects of the operations. The outcomes of the experiments and analysis of the protocol suggest that the presented technique successfully enhances the localization performances, while making additional insights regarding performance according to environmental changes and different implementation techniques.

关键词： autonomous vehicular networks cooperative localization vehicle-to-everything (V2X) consensus algorithm

Sampled-data self-triggered consensus-based economic dispatch problem under switching graph

学校读者我要写书评

暂无评论

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 2020年第2期491卷

作者： Jin, Kaiqi Yu, Mei Hou, Guolian North China Elect Power Univ Sch Control & Comp Engn Beijing 102206 Peoples R China China South Ind Grp Corp Beijing 100089 Peoples R China

To reduce the frequency of data exchange in power grid, a novel self-triggered consensus-based optimization algorithm for economic dispatch problem (EDP) is proposed for switching topologies, which guarantees that the increment cost converges to an optimal consensus value after iterations. In this brief, sampled-data framework is employed to complete the implementation of algorithm digitally. Based on that, self-triggered mechanism based approach can also avoid infinite number of communication in finite time, which can save communication cost between generators. Further, a time-varying gain function is designed to derive a tradeoff between convergence rate and triggering performance. Finally, some simulation examples are given to illustrate the effectiveness of the relevant theoretical results. (C) 2020 Elsevier Inc. All rights reserved.

关键词： Sampled-data Self-triggered consensus algorithm Economic dispatch problem Power grid Switching graph

Global Fuzzy Adaptive consensus Control of Unknown Nonlinear Multiagent Systems

学校读者我要写书评

暂无评论

IEEE TRANSACTIONS ON FUZZY SYSTEMS 2020年第3期28卷 510-522页

作者： Chen, Jiaxi Li, Junmin Yuan, Xinxin Xidian Univ Sch Math & Stat Xian 710071 Peoples R China

This paper investigates the global consensus problems for the first-order and second-order unknown nonlinear multiagent systems (MASs) with uncertain input disturbance. Fuzzy logic systems are applied to solve the global consensus problem for unknown nonlinear MASs. A fully distributed adaptive fuzzy control is designed to enable followers asymptotically to track the leader without using any dynamics of the leader. The global consensus conditions are also derived for the first-order and second-order unknown MASs, which overcomes the drawback of the semiglobal consensus in existing literature. It is worth mentioning that the proposed approach can greatly alleviate the computation burden because it only needs to update a few parameters. An efficient framework is also given to achieve the global formation control of the second-order unknown nonlinear MAS with an undirected connected graph. Finally, four simulated examples are given to illustrate the effectiveness of the proposed control protocols.

关键词： Protocols Symmetric matrices Artificial neural networks Adaptive control Fuzzy control Uncertainty Adaptive fuzzy control consensus algorithm formation control fuzzy logic systems (FLSs) multiagent systems (MAS)

Fixed-Time Bipartite consensus Tracking of Fractional-Order Multi-Agent Systems With a Dynamic Leader

学校读者我要写书评

暂无评论

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2020年第10期67卷 2054-2058页

作者： Gong, Ping Han, Qing-Long South China Normal Univ Sch Math Sci Guangzhou 510631 Peoples R China Swinburne Univ Technol Sch Software & Elect Engn Melbourne Vic 3122 Australia

This brief considers the fixed-time bipartite consensus tracking problem of a fractional-order multiagent system (FOMAS) with a dynamic leader in a general directed signed network. Firstly, by introducing a neighborhood-based variable, the FOMAS is transformed into an integer-order MAS. Then, a distributed protocol with heterogeneous coupling gains is proposed to ensure that the fixed-time bipartite consensus tracking can be achieved within a settling time. The upper bound of the settling time can be estimated explicitly, which is irrelevant to any initial conditions. Finally, the effectiveness of the proposed distributed protocol is illustrated by numerical simulation.

关键词： Topology consensus algorithm Protocols Laplace equations Couplings Convergence Circuits and systems Fixed-time control fractional-order multi-agent system bipartite consensus tracking signed directed graph