Distributed optimization with information-constrained population dynamics

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. © 2018 The Franklin Institute

• Fecha de publicación: 2019
• Institución: Universidad del Rosario
• Repositorio: Repositorio EdocUR - U. Rosario
• Idioma: eng
• OAI Identifier: oai:repository.urosario.edu.co:10336/22477
• Acceso en línea: https://doi.org/10.1016/j.jfranklin.2018.10.016; https://repository.urosario.edu.co/handle/10336/22477
• Palabra clave: Constrained optimization; Electric load dispatching; Graph theory; Multi agent systems; Population dynamics; Scheduling; Convergence rates; Distributed optimization; Economic dispatch problems; Equilibrium point; Global objective functions; Local information; Multiagent framework; Topological constraints; Problem solving
• License: Abierto (Texto Completo)