arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1801.01658eess.SYcs.SY
收藏

无需初始化的隐私保障分布式算法用于经济调度问题

Initialization-free Privacy-guaranteed Distributed Algorithm for Economic Dispatch Problem

Samsung Electronics Co., Ltd.(三星电子株式会社);Seoul National University(首尔国立大学);Gwangju Institute of Science and Technology(光州科学技术院)

Hyeonjun Yun, Hyungbo Shim, Hyo-Sung Ahn

AI总结:

本文提出了一种无需初始化且能保证隐私的分布式算法,用于解决电力网络中的经济调度问题,通过双梯度连续时间分布式算法在不泄露节点私有信息的情况下,实现总发电成本最小化,并支持在线调整网络结构、需求、发电约束及参与节点。

摘要:

本文考虑了电力网络中发电厂和客户组成的经济调度问题。特别地,我们的目标是在满足供需平衡和个体发电容量约束的前提下,最小化总发电成本。该问题通过分布式方式进行解决,即提出了一种双梯度连续时间分布式算法,其中仅需与邻居通信一个双变量,且不泄露节点的私有信息。所提出的算法简单且无需特定初始化,从而允许在线调整网络结构、需求、发电约束以及参与节点。此外,当问题变得不可行时,该算法表现出特殊行为,使每个节点能够检测到电力网络中的供大于求或供不应求情况。在IEEE 118节点系统上的仿真结果证实了该算法对电力网络变化的鲁棒性。

英文摘要:

This paper considers the economic dispatch problem for a network of power generators and customers. In particular, our aim is to minimize the total generation cost under the power supply-demand balance and the individual generation capacity constraints. This problem is solved in a distributed manner, i.e., a dual gradient-based continuous-time distributed algorithm is proposed in which only a single dual variable is communicated with the neighbors and no private information of the node is disclosed. The proposed algorithm is simple and no specific initialization is necessary, and this in turn allows on-line change of network structure, demand, generation constraints, and even the participating nodes. The algorithm also exhibits a special behavior when the problem becomes infeasible so that each node can detect over-demand or under-demand situation of the power network. Simulation results on IEEE 118 bus system confirm robustness against variations in power grids.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑