Resilient distributed model predictive control for energy management of interconnected microgrids
Distributed energy management of interconnected microgrids that is based on model predictive control (MPC) relies on the cooperation of all agents (microgrids). This paper discusses the case in which some of the agents might perform one type of adversarial actions (attacks) and they do not comply wi...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2019 |
| País: | España |
| Institución: | Consejo Superior de Investigaciones Científicas (CSIC) |
| Repositorio: | DIGITAL.CSIC. Repositorio Institucional del CSIC |
| OAI Identifier: | oai:digital.csic.es:10261/202301 |
| Acceso en línea: | http://hdl.handle.net/10261/202301 |
| Access Level: | acceso abierto |
| Palabra clave: | Distributed MPC Distributed optimization Economic dispatch Microgrids Resilient algorithm |
| Sumario: | Distributed energy management of interconnected microgrids that is based on model predictive control (MPC) relies on the cooperation of all agents (microgrids). This paper discusses the case in which some of the agents might perform one type of adversarial actions (attacks) and they do not comply with the decisions computed by performing a distributed MPC 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 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 formulate the economic dispatch problem, taking into account the attacks as a chance-constrained problem, and 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. |
|---|