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

distributed robust operational optimization of networked microgrids embedded interconnected energy hubs

ENERGY 2020年 199卷 117440-117440页

作者： Nikmehr, Nima SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA

An interconnected energy hubs (EHs) framework aims to enhance the efficiency of the multicarrier energy system through realizing optimal coordination among existing players. In this paper, EH concept is studied in networked microgrids (MGs) structure to exploit the potential capabilities of microgrids in satisfying various types of energy demands. In the proposed model, MGs and distribution network are independent entities which have their local scheduling problem. To coordinate the operation of entities, a distributed algorithm based on the alternating direction method of multipliers (ADMM) is exploited to resolve the conflict of exchanged power between multi-MGs and distribution network. Considering the uncertainties, a distributed robust model is employed to precisely analyze the performance of multicarrier energy networked MGs in different robustness levels. The efficiency of the ADMM model on integrated energy systems is tested on a networked MGs. The achieved results can ensure the light computational burden and convergence of proposed distributed algorithm. The proposed EH optimization problem is solved via Gurobi optimizer packages. According to the results, the ADMM converges to the final solution after 5 iterations, and with increasing the robustness level, the operation costs of EHs increases. The obtained results by Gurobi is more optimal than heuristic algorithms. (C) 2020 Elsevier Ltd. All rights reserved.

关键词： Networked microgrids Energy hub distributed algorithm Alternating direction method of multipliers (ADMM) Robust optimization

来源：评论

学校读者我要写书评

暂无评论

A Dual Splitting Method for distributed Economic Dispatch in Multi-energy Systems

引用

IFAC-PapersOnLine 2020年第2期53卷 12566-12571页

作者： Zhibin Wang Jinming Xu Shanying Zhu Cailian Chen Department of Automation Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai 200240 China College of Control Science and Engineering Zhejiang University Hangzhou 310027 China

Multi-energy systems which bring together different forms of energy, such as electricity, gas and heat, to coordinate in the process of supply, transmission and consumption provide much higher flexibility over traditional energy systems in energy utilization. This paper deals with the economic dispatch problem in multi-energy systems in a distributed manner. Each agent optimizes its local objective function with regard to local coupled limits and a global constraint via local communications only. A distributed algorithm is proposed based on duality analysis and splitting *** algorithm adopts a non-linear mapping method to linearize the nonlinearity arisen from coupling relationship among energy carriers. We show that the proposed algorithm converges at a nonergodic rate of O(1/k). Simulations are demonstrated to show the effectiveness of the algorithm.

关键词： Multi-energy systems economic dispatch distributed algorithm duality splitting method

来源：评论

学校读者我要写书评

暂无评论

Optimal distributed Leader Election without Decoding

引用

Procedia Computer Science 2020年 174卷 535-542页

作者： Dongxiao Yu Yifei Zou Yong Zhang Feng Li Shikun Shen Falko Dressler School of Computer Science and Technology Shandong University Qingdao P.R. China Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen P.R. China Department of Computer Science The University of Hong Kong Hong Kong P.R. China School of Computer Science Wuhan University Wuhan P.R. China Heinz Nixdorf Institute and the Dept. of Computer Science Paderborn University Paderborn Germany

In the past decades, with the exponential implementation of large-scale wireless networks such as Internet-of-Things, an enormous demand on designing the relative algorithms and protocols has come into our sight. As an important primitive function in wireless communication, the problem of leader election has attracted much attention in research. In this paper, we pursue efficient distributed solutions for leader election in large-scale wireless networks. Specifically, a simple but optimal distributed leader election algorithm in wireless networks with asynchronous wakeup nodes is proposed, under the practical Signal-to-Interference-plus-Noise (SINR) interference-depicting model. Our algorithm is randomized and can elect a leader in an asymptotically optimal time bound of Θ(log n ) with high probability, where n is the number of nodes in network. The algorithm does not rely on any information about the network topology, needs only simple node capability to implement, and uses no encoding and decoding functions. Hence, the algorithm is efficient and energy-saving, which makes it possible to be implemented in a wide range of scenarios, and become a building block for many higher-level operations, like consensus, broadcast and so on.

关键词： Leader election distributed algorithm Physical carrier sensing

来源：评论

学校读者我要写书评

暂无评论

distributed Self-Reconfiguration using a Deterministic Autonomous Scaffolding Structure 18

Distributed Self-Reconfiguration using a Deterministic Auton...

引用

18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS)

作者： Thalamy, Pierre Piranda, Benoit Bourgeois, Julien Univ Bourgogne Franche Comte FEMTO ST Inst CNRS Montbeliard France

ISBN: (纸本)9781450363099

In the context of large distributed modular robots, self-reconfiguration is the process of having modules, seen as autonomous agents, acting together and moving to transform the morphology of their physical arrangement to produce a desired shape. However, due to motion constraints, the number of modules that can move concurrently is greatly limited, thus making self-reconfiguration a very slow process. In this paper, we propose an approach for accelerating self-reconfiguration to build a porous version of the desired shape, using scaffolding. We expand this idea and propose a method for constructing a parametric scaffolding model that increases the parallelism of the reconfiguration, supports its mechanical stability, and simplifies planning and coordination between agents. Each agent has a set of basic rules using only four states which guarantees that module movements and the construction of the scaffold are deterministic. Coupled with an underneath reserve of modules that allows the introduction of rotating quasi-spherical modules at various ground locations of the growing porous structure, our method is able to build the scaffolding structure in O(N-2/3) time with N the number of modules composing the structure. Furthermore, we provide simulation results showing that our method uses O(N-4/3) messages with no congestion.

关键词： Self-Reconfiguration Autonomous Robots distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

k-Immediate Snapshot and x-Set Agreement: How Are They Related? 1

引用

22nd International Symposium on Stabilization, Safety, and Security of distributed Systems

作者： Delporte, Carole Fauconnier, Hugues Rajsbaum, Sergio Raynal, Michel Univ Paris Diderot IRIF Paris France Univ Nacl Autonoma Mexico Inst Matemat Mexico City 04510 DF Mexico Univ Rennes IRISA INRIA CNRS Rennes France Polytech Univ Hong Kong Kowloon Hong Kong Peoples R China

ISBN: (数字)9783030643485

ISBN: (纸本)9783030643478;9783030643485

An immediate snapshot object is a high level communication object, built on top of a read/write distributed system in which all except one processes may crash. This object provides the processes with a single operation, denoted write_snapshot(), which allows the invoking process to write a value and obtain a set of pairs 'process id, value' satisfying some set containment properties, that represent a snapshot of the values written to the object, occurring immediately after the write step. Considering an n-process model in which up to t processes may crash, this paper introduces first the k-resilient immediate snapshot object, which is a natural generalization of the basic immediate snapshot (which corresponds to the case k = t = n - 1). In addition to the set containment properties of the basic immediate snapshot, a k-resilient immediate snapshot object requires that each set returned to a process contains at least (n - k) pairs. The paper first shows that, for k, t < n - 1, k-resilient immediate snapshot is impossible in asynchronous read/write systems. Then it investigates a model of computation where the processes communicate with each other by accessing k-immediate snapshot objects, and shows that this model is stronger than the t-crash model. Considering the space of x-set agreement problems (which are impossible to solve in systems such that x <= t), the paper shows then that x-set agreement can be solved in read/write systems enriched with k-immediate snapshot objects for x = max(1, t + k-(n - 2)). It also shows that, in these systems, k-resilient immediate snapshot and consensus are equivalent when 1 <= t < n/2 and t <= k <= (n - 1) - t. Hence, the paper establishes strong relations linking fundamental distributed computing objects (one related to communication, the other to agreement), which are impossible to solve in pure read/write systems.

关键词： Asynchronous system Atomic read/write register Computability distributed algorithm Immediate snapshot Impossibility k-set agreement Linearizability Lower/upper bounds Process crash Snapshot object t-resilience

来源：评论

学校读者我要写书评

暂无评论

distributed QUICKEST DETECTION OF SIGNIFICANT EVENTS IN NETWORKS 44

DISTRIBUTED QUICKEST DETECTION OF SIGNIFICANT EVENTS IN NETW...

引用

44th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

作者： Zou, Shaofeng Veeravalli, Venugopal V. Li, Jian Towsley, Don Swami, Ananthram SUNY Buffalo Buffalo NY 14260 USA Univ Illinois Champaign IL USA Univ Massachusetts Amherst MA 01003 USA US Army Res Lab Adelphi MD USA

ISBN: (纸本)9781479981311

The problem of quickest detection of significant events in networks is studied. A distributed setting is investigated, where there is no fusion center, and each node only communicates with its neighbors. After an event occurs in the network, a number of nodes are affected, which changes the statistics of their observations. The nodes may possibly perceive the event at different times. The goal is to design a distributed sequential detection rule that can detect when the event is "significant", i.e., the event has affected no less than eta nodes, as quickly as possible, subject to false alarm constraints. A distributed algorithm is proposed, which is based on a novel combination of the alternating direction method of multipliers (ADMM) and average consensus approaches. Numerical results are provided to demonstrate the performance of the proposed algorithm.

关键词： ADMM average consensus distributed algorithm network event detection quickest change detection

来源：评论

学校读者我要写书评

暂无评论

A Consensus-based Approach for distributed Quickest Detection of Significant Events in Networks 53

A Consensus-based Approach for Distributed Quickest Detectio...

引用

53rd Asilomar Conference on Signals, Systems, and Computers (ACSSC)

作者： Li, Jian Towsley, Don Zou, Shaofeng Veeravalli, Venugopal V. Ciocarlie, Gabriela SUNY Binghamton Binghamton NY 13902 USA Univ Massachusetts Amherst Amherst MA USA SUNY Buffalo Buffalo NY USA Univ Illinois Urbana IL 61801 USA SRI Int 333 Ravenswood Ave Menlo Pk CA 94025 USA

ISBN: (纸本)9781728143002

This paper studies the problem of quickest detection of significant events in networks, where nodes undergo a change in the data generating the distributions of their observations due to events that occurred at some unknown time. Events can propagate dynamically along edges in the network to affect more nodes over time;however, the propagation dynamics are assumed to be unknown. A consensus-based distributed-detection algorithm is proposed to detect a "significant" event, i.e., at least eta nodes have been affected by the event, as quickly as possible, subject to false alarm constraints. It is shown that the proposed distributed algorithm achieves an equivalent performance to that of a centralized algorithm, which was shown to be firstorder asymptotically optimal, as the false alarm rate goes to zero. Finally, numerical experiments are provided to evaluate the efficiency of the proposed algorithm.

关键词： Anomaly detection consensus algorithm distributed algorithm quickest change detection sequential change detection

来源：评论

学校读者我要写书评

暂无评论

Economical Analysis of distributed Joint Energy and Reserve Markets

Economical Analysis of Distributed Joint Energy and Reserve ...

引用

IEEE PES Innovative Smart Grid Technologies Europe (IEEE ISGT-Europe)

作者： Guo, Zhenwei Yang, Qinmin Chen, Shibo Yang, Zaiyue Zhejiang Univ Coll Control Sci & Engn Hangzhou Peoples R China Southern Univ Sci & Technol Dept Mech & Energy Engn Shenzhen Peoples R China

ISBN: (纸本)9781538682180

The deep and ever increasing penetration of renewable generation requires a large amount of reserve to compensate the random fluctuation and uncertainty, which makes the reserve becoming a commodity as equally important as the energy in the future smart grid. As reserve and energy are tightly coupled, we are interested in revealing their inherent characteristics in electricity market from an economics point of view, which, however, is forbidden by the current electricity marker structures. To this end, this paper proposes a novel, yet simple, distributed joint electricity market, which consists of conventional generator, renewable generator and user, and intends to balance energy and reserve simultaneously. The simple market structure enables rigorous analysis of individual behavior regarding the prices and quantities of energy and reserve. Then, we prove the existence and uniqueness of the market equilibrium, according to which, we reveal the prices and quantities at equilibrium as explicit functions of system parameters, which brings great insights to the joint energy and reserve markets.

关键词： distributed joint energy and reserve markets market equilibrium distributed algorithm first order optimal condition

来源：评论

学校读者我要写书评

暂无评论

distributed Core Decomposition in Probabilistic Graphs 8th

Distributed Core Decomposition in Probabilistic Graphs

引用

8th International Conference on Computational Data and Social Networks (CSoNet)

作者： Luo, Qi Yu, Dongxiao Li, Feng Dou, Zhenhao Cai, Zhipeng Yu, Jiguo Cheng, Xiuzhen Shandong Univ Sch Comp Sci & Technol Qingdao Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA Qilu Univ Technol Sch Comp Sci & Technol Jinan Peoples R China

ISBN: (纸本)9783030349806;9783030349790

This paper initializes distributed algorithm studies for core decomposition in probabilistic graphs. Core decomposition has been proven to be a useful primitive for a wide range of graph analyses, but it has been rarely studied in probabilistic graphs, especially in a distributed environment. In this work, under a distributed model underlying Pregel and live distributed systems, we present the first known distributed solutions for core decomposition in probabilistic graphs, where there is an existence probability for each edge. In the scenario that the existence probability of edges are known to nodes, the proposed algorithm can get the exact coreness of nodes with a high probability guarantee. In the harsher case that the existence probability is unknown, we present a novel method to estimate the existence probability of edges, based on which the coreness of nodes with small approximation ratio guarantee can be computed. Extensive experiments are conducted on different types of real-world graphs and synthetic graphs. The results illustrate that the proposed algorithms exhibit good efficiency, stability and scalability.

关键词： Uncertain graph Core decomposition distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed Self-Healing Method for Active Distribution Systems 8

A Distributed Self-Healing Method for Active Distribution Sy...

引用

International Conference on Renewable Energy Research and Applications

作者： Monadi, Mehdi Farzin, Hossein Rodriguez, Pedro Shahid Chamran Univ Ahvaz Ahvaz Iran Loyola Univ LOYOLA TECH Seville Spain

ISBN: (纸本)9781728135878

This paper proposes a self-healing method for active and smart distribution systems. The method uses a distributed algorithm for Fault Location, Isolation, and Service Restoration (FLISR) to enhance the reliability of active distribution systems. The proposed FLISER method is designed to be implemented in the relays of the circuit breakers (CBs) of distribution lines. The same algorithm is executed for all the CBs and each CB only communicates with the adjacent CBs. Therefore, the proposed method takes advantages of the benefits of distributed methods. To provide a fast service restoration, especially when a zone of the distribution grid is disconnected from the upstream transmission system, the method uses a five-step process to provide the required power for loads of the faulted feeder by use of tie lines and the available capacity of distributed generators (DGs). In comparison with the previous works, in the proposed method the minimum number of CBs are opened. The exchanged data between the network elements can be transferred by use of the IEC61850 protocol and in the form of standard GOOSE messages.

关键词： Active distribution networks distributed algorithm FLISR self-healing smart grid

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：