CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
A resilient approach for distributed MPC-based economic dispatch in interconnected microgrids
Authors
Wayan Wicak Ananduta
Hideaki Ishii
José María Maestre Torreblanca
Carlos Ocampo-Martínez
Publication date
1 January 2019
Publisher
'Institute of Electrical and Electronics Engineers (IEEE)'
Doi
Cite
Abstract
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Economic dispatch of interconnected microgrids that is based on distributed model predictive control (DMPC) requires the cooperation of all agents (microgrids). This paper discusses the case in which some of the agents might not comply with the decisions computed by performing a DMPC algorithm. In this regard, these agents could obtain a better performance at the cost of degrading the performance of the network as a whole. A resilient distributed method that can deal with such issues is proposed and studied in this paper. The method consists of two parts. The first part is to ensure that the decisions obtained from the algorithm are robustly feasible against most of the attacks with high confidence. In this part, we employ a two-step randomization-based approach to obtain a feasible solution with a predefined level of confidence. The second part consists in the identification and mitigation of the adversarial agents, which utilizes hypothesis testing with Bayesian inference and requires each agent to solve a mixed-integer problem to decide the connections with its neighbors. In addition, an analysis of the decisions computed using the stochastic approach and the outcome of the identification and mitigation method is provided. The performance of the proposed approach is also shown through numerical simulations.Peer ReviewedPostprint (author's final draft
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Digital.CSIC
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:digital.csic.es:10261/2065...
Last time updated on 24/05/2020
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 10/08/2021
UPCommons
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:upcommons.upc.edu:2117/181...
Last time updated on 17/04/2020
UPCommons. Portal del coneixement obert de la UPC
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:upcommons.upc.edu:2117/181...
Last time updated on 09/04/2020