OAK

Coordination and control for energy distribution in distributed grid networks: Theory and application to power dispatch problem

Metadata Downloads
Abstract
This paper presents a new framework considering decentralized energy coordination and generation, and flow control for supply-demand balance in distributed grid networks. Consensus schemes using only local information are employed to produce energy coordination, generation, and flow control signals. For the supply-demand balance, it is required to determine the amount of energy needed at each distributed resource. Also, due to the different generation capacities of each energy resource, coordination of energy flows among distributed energy resources is essentially required. Thus, this paper proposes a new framework which gives decentralized energy coordination scheme, generation, and flow control method considering these constraints based on distributed consensus algorithms. The proposed framework in this paper can be nicely utilized in energy dispatch or energy flow scheduling. Furthermore, it can be applied to various engineering problems including water irrigation systems, traffic networks, and building automation systems since it deals with attributed distribution and resource allocation in large scale distributed systems. Through illustrative examples, the effectiveness of the proposed approaches is illustrated. A possible application to power dispatch problem in the IEEE-14bus is also addressed for more detailed and realistic evaluation. (C) 2015 Elsevier Ltd. All rights reserved.
Author(s)
Kim, Byeong-YeonOh, Kwang-KyoAhn, Hyo-Sung
Issued Date
2015-10
Type
Article
DOI
10.1016/j.conengprac.2015.06.004
URI
https://scholar.gist.ac.kr/handle/local/14554
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Citation
Control Engineering Practice, v.43, pp.21 - 38
ISSN
0967-0661
Appears in Collections:
Department of Mechanical and Robotics Engineering > 1. Journal Articles
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.