.png){kind=icon}
Return
Distributed optimization with information-constrained population dynamics
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2018.10.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In a multi-agent framework, distributed optimization problems are generally described as the minimization of a global objective function, where each agent can get information only from a neighborhood defined by a network topology. To solve the problem, this work presents an information-constrained strategy based on population dynamics, where payoff functions and tasks are assigned to each node in a connected graph. We prove that the so-called distributed replicator equation (DRE) converges to an optimal global outcome by means of the local-information exchange subject to the topological constraints of the graph. To show the application of the proposed strategy, we implement the DRE to solve an economic dispatch problem with distributed generation. We also present some simulation results to illustrate the theoretic optimality and stability of the equilibrium points and the effects of typical network topologies on the convergence rate of the algorithm. (C) 2018 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
Keywords:
IDEAL FREE DISTRIBUTION
DISPATCH
GAMES
RESOURCES
STABILITY
CONSENSUS
Journal
J
IF:
3.7
Papers:
6.4K
Citations:
1.5W
Organization
Cited Papers
A novel meta-heuristic optimization methodology for solving various types of economic dispatch problem.png)
ENERGY
ENERGYIF9.4
PREAI
ShareSaveShareSave
ShareSaveSynthesis of Cu3P nanocubes and their excellent electrocatalytic efficiency for the hydrogen evolution reaction in acidic solutionRSC Advances
RSC AdvancesIF0
PREAI
ShareSave
View more