Loading…

Multi-Agent Systems for Resource Allocation and Scheduling in a Smart Grid

With the increasing integration of Distributed Energy Resources (DER) in the power grid, a decentralized approach becomes essential for scheduling and allocation of resources in a smart grid. Economic Dispatch (ED) and Unit Commitment (UC) are the two major resource allocation problems that play cri...

Full description

Saved in:
Bibliographic Details
Published in:Technology and economics of smart grids and sustainable energy 2018-12, Vol.3 (1), p.1, Article 15
Main Authors: Nair, Arun Sukumaran, Hossen, Tareq, Campion, Mitch, Selvaraj, Daisy Flora, Goveas, Neena, Kaabouch, Naima, Ranganathan, Prakash
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With the increasing integration of Distributed Energy Resources (DER) in the power grid, a decentralized approach becomes essential for scheduling and allocation of resources in a smart grid. Economic Dispatch (ED) and Unit Commitment (UC) are the two major resource allocation problems that play critical role in the safe and stable operation of a grid system. The uncertainty associated with renewable energy sources have made the resource allocation problems even more challenging for grid operators. The future grid will have a higher generation mix of renewable energy sources and a large load of Electrical vehicles, with the possibility of bi-directional power flow. This complex smart grid system necessitates the development of a decentralized approach to resource allocation problem, which allows inter-node communication and decision making. Multi-agent systems (MAS) is a promising platform to decentralize the traditional centralized resource allocation aspects of smart grid. This paper presents a comprehensive literature review on the application of MAS to Economic Dispatch (ED) and Unit Commitment (UC) in smart grids.
ISSN:2199-4706
2199-4706
DOI:10.1007/s40866-018-0052-y