Electrical Engineering and Systems Science > Systems and Control
[Submitted on 30 Aug 2021]
Title:Distributed Dual Gradient Tracking for Priority-Considered Load Shedding
View PDFAbstract:This paper studies two fundamental problems in power systems: the economic dispatch problem (EDP) and load shedding. For the EDP, an extension of the problem considering the transmission losses is presented. Because the optimization problem is non-convex owing to quadratic equality constraints modeling the transmission losses, a convex relaxation method is presented. Under a particular assumption, it is shown that a distributed algorithm can be designed to solve the considered EDP. Furthermore, this work aims to handle an overloading problem by employing an optimal load shedding method. Emphasis is placed on scheduling the load shedding when there exist some priorities on the loads. First, a novel optimization problem is proposed to obtain the load shedding according to the predefined priority order. Then, a distributed algorithm solving the optimization problem is presented. Finally, this paper presents how to integrate the proposed algorithms, i.e., the EDP and the load shedding, in a distributed manner. Simulation results are presented to demonstrate the effectiveness of the proposed method.
Current browse context:
eess.SY
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.