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

A two-layer energy management for islanded microgrid based on inverse reinforcement learning and distributed ADMM

ENERGY 2024年 301卷

作者： Huang, Lei Sun, Wei Li, Qiyue Mu, Daoming Li, Weitao Hefei Univ Technol Tunxi Rd 193 Hefei 230009 Peoples R China

The development of a scheduling strategy for an islanded microgrid (IMG) is critical for ensuring the system's stability and economic efficiency. Traditional scheduling strategies for IMGs predominantly utilize centralized management by the microgrid central controller (MGCC), which introduces a vulnerability to a single point of failure. To address this limitation, this paper presents a two-layer energy management strategy for IMGs based on the improved alternating direction method of multipliers (ADMM) and inverse reinforcement learning (IRL). First, the framework of the proposed strategy, comprising a scheduling layer and a real-time dispatch layer, is outlined. Next, the problem formulation of the scheduling layer is analyzed, and the proposed IRLbased management strategy for the energy storage system (ESS) is presented. Then, a distributed optimization algorithm based on the improved ADMM is proposed for the management of controllable distributed generators (CDGs) in the real-time dispatch layer. Lastly, the case study demonstrates the efficacy of the proposed strategy in diminishing MGCC dependency. The comparative analysis indicates that the proposed strategy outperforms existing scheduling strategies in terms of cost-effectiveness when the forecast error exceeds 3%. Moreover, in contrast to existing scheduling strategies, the proposed strategy mitigates the risk associated with a single point of failure.

关键词： Islanded microgrid Energy management Optimization methods distributed algorithms Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

distributed Nash equilibrium seeking for quadratic games in discrete-time systems with bounded control inputs

引用

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS 2024年第17期361卷

作者： Dai, Shuoye Zhang, Yu Lu, Guoping Sun, Jitao Tongji Univ Sch Math Sci Key Lab Intelligent Comp & Applicat Minist Educ Shanghai 200092 Peoples R China Nantong Univ Sch Elect Engn Nantong 226019 Peoples R China Nantong Univ Sch Math & Stat Nantong 226019 Peoples R China

This paper considers the distributed Nash equilibrium seeking problem for quadratic games in discrete-time systems with bounded control inputs. First, a saturation gradient algorithm is proposed to seek the Nash equilibrium without considering the limitations of communication. Then the case that players can only communicate with their neighbors is considered, a distributed Nash equilibrium seeking algorithm is designed where a consensus protocol is adapted for information sharing. In the proposed distributed algorithm, each player has an estimate on others' actions and the consensus of players' estimates is achieved. By Lyapunov stability theory for discrete-time systems, it is shown that the Nash equilibrium of the game is globally asymptotically stable under certain conditions. Moreover, distributed Nash equilibrium seeking problem in hybrid systems with bounded control inputs is solved. Finally, two numerical examples are presented to verify the effectiveness of the proposed algorithms.

关键词： Nash equilibrium Bounded control inputs distributed algorithms Games Discrete-time systems

来源：评论

学校读者我要写书评

暂无评论

Deterministic Leader Election for Stationary Programmable Matter with Common Direction 31st

Deterministic Leader Election for Stationary Programmable Ma...

引用

31st International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Chalopin, Jeremie Das, Shantanu Kokkou, Maria Aix Marseille Univ LIS CNRS Marseille France

ISBN: (纸本)9783031606021;9783031606038

Leader Election is an important primitive for programmable matter, since it is often an intermediate step for the solution of more complex problems. Although the leader election problem itself is well studied even in the specific context of programmable matter systems, research on fault tolerant approaches is more limited. We consider the problem in the previously studied Amoebot model on a triangular grid, when the configuration is connected but contains nodes the particles cannot move to (e.g., obstacles). We assume that particles agree on a common direction (i.e., the horizontal axis) but do not have chirality (i.e., they do not agree on the other two directions of the triangular grid). We begin by showing that an election algorithm with explicit termination is not possible in this case, but we provide an implicitly terminating algorithm that elects a unique leader without requiring any movement. These results are in contrast to those in the more common model with chirality but no agreement on directions, where explicit termination is always possible but the number of elected leaders depends on the symmetry of the initial configuration. Solving the problem under the assumption of one common direction allows for a unique leader to be elected in a stationary and deterministic way, which until now was only possible for simply connected configurations under a sequential scheduler.

关键词： programmable matter leader election distributed algorithms Amoebot stationary common direction

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Reconfiguration of Spanning Trees 24th

Brief Announcement: Distributed Reconfiguration of Spanning ...

引用

24th International Symposium on Stabilization, Safety, and Security of distributed Systems (SSS)

作者： Gupta, Siddharth Kumar, Manish Pai, Shreyas Univ Warwick Coventry W Midlands England Ben Gurion Univ Negev Beer Sheva Israel Aalto Univ Espoo Finland

ISBN: (纸本)9783031210167;9783031210174

In a reconfiguration problem, given a problem and two feasible solutions of the problem, the task is to find a sequence of transformations to reach from one solution to the another such that every intermediate state is also a feasible solution to the problem. In this paper, we study the distributed spanning tree reconfiguration problem and we define a new reconfiguration step, called k-simultaneous add and delete, in which every node is allowed to add at most k edges and delete at most k edges such that multiple nodes do not add or delete the same edge. We first show that, if the two input spanning trees are rooted then we can transform one into another in one round using a single 1-simultaneous add and delete step in the CONGEST model. Therefore, we focus our attention towards unrooted spanning trees and show that transforming an unrooted spanning tree into another using a single 1-simultaneous add and delete step requires Omega(n) rounds in the LOCAL model. We additionally show that transforming an unrooted spanning tree into another using a single 2-simultaneous add and delete step can be done in O(log n) rounds in the CONGEST model.

关键词： Spanning trees Reconfiguration distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed Complementary Fusion for Connected Vehicles 11

Distributed Complementary Fusion for Connected Vehicles

引用

11th International Conference on Control, Automation and Information Sciences (ICCAIS)

作者： Klupacs, James Gostar, Amirali Khodadadian Bab-Hadiashar, Alireza Palmer, Jennifer Hoseinnezhad, Reza RMIT Univ Melbourne Vic Australia

ISBN: (数字)9781665452489

ISBN: (纸本)9781665452489

We present a random finite set-based method for achieving comprehensive situation awareness by each vehicle in a distributed vehicle network. Our solution is designed for labeled multi-Bernoulli filters running in each vehicle. It involves complementary fusion of sensor information locally running through consensus iterations. We introduce a novel label merging algorithm to eliminate double counting. We also extend the label space to incorporate sensor identities. This helps to overcome label inconsistencies. We show that the proposed algorithm is able to outperform the standard LMB filter using a distributed complementary approach with limited fields of view.

关键词： Random Finite Sets Intelligent Transport Systems Multi-Object Tracking Information Fusion distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Meet in the air: distributed neighbor discovery in 3D networks with directional transceivers

引用

COMPUTER NETWORKS 2024年 241卷

作者： Chen, Lin Wang, Weijia Song, Yichuan Yu, Jihong Wang, Kehao Zhang, Shurong Yang, Weihua Wu, Celimuge Sun Yat Sen Univ Sch Comp Sci & Engn Guangzhou Peoples R China AVIC Flight Automatic Control Res Inst Xian Peoples R China Beijing Inst Technol Sch Informat & Elect Beijing Peoples R China Wuhan Univ Technol Dept Informat Engn Wuhan Peoples R China Taiyuan Univ Technol Coll Math Taiyuan Peoples R China Univ Electro Commun Grad Sch Informat & Engn Tokyo Japan

We formulate and analyze a generic neighbor discovery problem in three-dimensional wireless networks with directional transceivers, where any pair of neighbor nodes in 3D Euclidean space need to steer their transceivers towards each other simultaneously to discover each other. This problem, termed as 3D directional neighbor discovery, arises in a variety of emerging networked systems such as flying ad hoc networks composed of drones and distributed space systems composed of spacecrafts. Compared to the omni-directional 2D neighbor discovery problem extensively investigated in the literature, the 3D directional neighbor discovery problem is intuitively more challenging. Motivated by this observation, we establish an algorithmic framework on the 3D directional neighbor discovery problem. We first mathematically formulate the problem and derive the worst -case discovery delay of any neighbor discovery algorithm. Guided by the performance limit, we then design distributed neighbor discovery algorithms achieving bounded and minimal worst -case discovery delay. We further demonstrate how our algorithmic framework can be generalized to solve generic multi -dimensional rendezvous problems. Extensive numerical analysis is then presented to empirically evaluate of our neighbor discovery algorithms.

关键词： Neighbor discovery Directional transceivers distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Computing Replacement Paths in the CONGEST Model 31st

Computing Replacement Paths in the CONGEST Model

引用

31st International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Manoharan, Vignesh Ramachandran, Vijaya Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9783031606021;9783031606038

We present several results on the round complexity of Replacement Paths and Second Simple Shortest Path which are basic graph problems that can address fault tolerance in distributed networks. These are well-studied in the sequential setting, and have algorithms [18, 20,30,34] that nearly match their fine-grained complexity [3,33]. But very little is known about either problem in the distributed setting. We present algorithms and lower bounds for these problems in the CONGEST model, with many of our results being close to optimal.

关键词： distributed algorithms Graph algorithms Shortest Paths

来源：评论

学校读者我要写书评

暂无评论

distributed Connected Dominating Sets in Unit Square and Disk Graphs 17th

Distributed Connected Dominating Sets in Unit Square and Dis...

引用

17th Annual Conference on Theory and Applications of Models of Computation (TAMC)

作者： Gorain, Barun Mondal, Kaushik Pandit, Supantha Indian Inst Technol Bhilai Raipur Chattisgarh India Indian Inst Technol Ropar Rupnagar Punjab India Dhirubhai Ambani Inst Informat & Commun Technol Gandhinagar Gujarat India

ISBN: (纸本)9783031203497;9783031203503

The Minimum Dominating Set (MDS) and Minimum Connected Dominating set (MCDS) problems are well-studied problems in the distributed computing communities due to their numerous applications across the field. We study these problems in axis-parallel unit square and unit disk graphs. We exploit the underlying geometric structures of these graph classes and present constant round distributed algorithms in the LOCAL communication model. Our results are distributed constant factor approximation algorithms for the MCDS problem in unit square graphs that run in 18 rounds and in unit disk graphs that run in 44 rounds. The message complexity is linear for both the algorithms.

关键词： Minimum dominating set Minimum connected dominating set distributed algorithms Axis-parallel unit square graphs Unit disk graphs Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Communication-efficient Massively distributed Connected Components 36

Communication-efficient Massively Distributed Connected Comp...

引用

36th IEEE International Parallel and distributed Processing Symposium (IEEE IPDPS)

作者： Lamm, Sebastian Sanders, Peter Karlsruhe Inst Technol Inst Theoret Informat Karlsruhe Germany

ISBN: (纸本)9781665481069

Finding the connected components of an undirected graph is one of the most fundamental graph problems. Connected components are used in a wide spectrum of applications including VLSI design, machine learning and image analysis. Sequentially, one can easily find all connected components in linear time using breadth-first traversal. However, in a massively distributed setting, finding connected components in a scalable way becomes much harder due to data irregularities and the overhead associated with the increased need for communication. In this work, we present a communication-efficient distributed graph algorithm for finding connected components that scales to massively parallel machines. Our algorithm is based on a recent linear-work shared-memory parallel algorithm by Blelloch et al. [1] and refines it for a distributed memory setting. This includes a communication-efficient graph contraction procedure, as well as a distributed variant of the low diameter decomposition by Miller et al. [2]. We tackle the data irregularities introduced by high degree vertices by using an efficient procedure for distributing their incident edges. Our experimental evaluation on up to 16 384 cores indicates a good weak scaling behavior that outperforms current state-of-the-art algorithms.

关键词： graph algorithms distributed algorithms communication efficiency graph connectivity

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Almost Universally Optimal distributed Laplacian Solver 22

Brief Announcement: Almost Universally Optimal Distributed L...

引用

ACM Symposium on Principles of distributed Computing (PODC)

作者： Anagnostides, Ioannis Lenzen, Christoph Haeupler, Bernhard Zuzic, Goran Gouleakis, Themis Carnegie Mellon Univ Pittsburgh PA 15213 USA CISPA Helmholtz Ctr Informat Secur Saarbrucken Germany Swiss Fed Inst Technol Zurich Switzerland Natl Univ Singapore Singapore Singapore

ISBN: (纸本)9781450392624

This paper refines the distributed Laplacian solver recently developed by Forster, Goranci, Liu, Peng, Sun, and Ye (FOCS '21) via the Ghaffari-Haeupler framework (SODA '16) of low-congestion shortcuts. Specifically, if is an element of > 0 is the error of the Laplacian solver, we obtain two main results. First, in the supported version of the CONGEST model, we establish an almost universally optimal Laplacian solver. Namely, we show that any Laplacian system on an..-node graph with shortcut quality SQ(G) can be solved after n(o)( 1) SQ(G) log(1/is an element of) rounds, almost matching our lower bound of e Omega( SQ(G)) rounds on any graph G Our techniques also imply almost universally optimal Laplacian solvers in the full generality of CONGEST, conditional on the efficient construction of shortcuts. In particular, they unconditionally imply a novel Dn(o)(1) log( 1/is an element of) Laplacian solver for excluded-minor graphs with hop-diameter... Moreover, following a recent line of work in distributed algorithms, we consider a hybrid communication model which enhances CONGEST with limited global power in the form of the nodecapacitated clique (NCC) model. In this model, we show the existence of a Laplacian solver with round complexity Dn(o)(1) log( 1/is an element of). The unifying thread of these results, and our main technical contribution, is the development of nearly-optimal distributed algorithms for a novel congested generalization of the standard part-wise aggregation problem. This primitive accelerates the Laplacian solver of Forster, Goranci, Liu, Peng, Sun, and Ye, and we believe it will find further applications in the future.

关键词： distributed algorithms Laplacian solvers universal optimality Hybrid model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：