A Game Theoretical Randomized Method for Large-Scale Systems Partitioning
In this paper, a game theory-based partitioning algorithm for large-scale systems (LSS) is proposed. More speci cally, a game over nodes is introduced in a model predictive control framework. The Shapley value of this game is used to rank the communication links of the control network based on their...
| Autores: | , , , , |
|---|---|
| Tipo de documento: | artigo |
| Estado: | Versão publicada |
| Data de publicação: | 2018 |
| País: | España |
| Recursos: | Universidad de Sevilla (US) |
| Repositório: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/94703 |
| Acesso em linha: | https://hdl.handle.net/11441/94703 https://doi.org/10.1109/ACCESS.2018.2854783 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Coalitional control Cooperative game theory System partitioning Randomized methods Shapley value Large-scale systems (LSS) Drinking water networks (DWN) |
| Resumo: | In this paper, a game theory-based partitioning algorithm for large-scale systems (LSS) is proposed. More speci cally, a game over nodes is introduced in a model predictive control framework. The Shapley value of this game is used to rank the communication links of the control network based on their impact on the overall system performance. A randomized method to estimate the Shapley value of each node and also an ef cient redistribution of the resulting value to the links involved are considered to relieve the combinatorial explosion issues related to LSS. Once the partitioning solution is obtained, a sensitivity analysis is proposed to give a measure of its performance. Likewise, a greedy ne tuning procedure is considered to increase the optimality of the partitioning results. The full Barcelona drinking water network is analyzed as a real LSS case study, showing the effectiveness of the proposed approach in comparison with other partitioning schemes available in the literature. |
|---|