Abstract—This paper proposes a novel methodology for solving constrained optimization problems in a distributed way, inspired by population dynamics and adding dynamics to the population masses. The proposed methodology divides the problem into smaller problems, whose feasible regions vary over time achieving an agreement to solve the global problem. The methodology also guarantees attraction to the feasible region and allows to have few changes in the decision-making design, when the network suffers the addition or removal of nodes. Simulation results are presented in order to illustrate several cases. I
Constraint satisfaction/optimization is a powerful paradigm for solving numerous tasks in distribute...
International audienceIn this article, we illustrate practical issues arising in the development of ...
© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
This paper proposes a novel methodology for solving constrained optimization problems in a distribut...
Large-scale network systems involve a large number of states, which makes the design of real-time co...
Large-scale network systems involve a large number of states, which makes the design of real-time co...
In a multi-agent framework, distributed optimization problems are generally described as the minimiz...
In distributed optimization problems, each agent can get information only from a neighborhood define...
© 2017 IEEE. Personal use for this material is permitted. Permission from IEEE must be obtained for ...
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
In a distributed optimization problem, the complete problem information is not available at a single...
In this paper we investigate how standard nonlinear programming algorithms can be used to solve cons...
© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommo...
This paper studies distributed optimization having flocking behavior and local constraint set. Multi...
Distributed optimization requires the optimization of a global objective function that is distribute...
Constraint satisfaction/optimization is a powerful paradigm for solving numerous tasks in distribute...
International audienceIn this article, we illustrate practical issues arising in the development of ...
© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
This paper proposes a novel methodology for solving constrained optimization problems in a distribut...
Large-scale network systems involve a large number of states, which makes the design of real-time co...
Large-scale network systems involve a large number of states, which makes the design of real-time co...
In a multi-agent framework, distributed optimization problems are generally described as the minimiz...
In distributed optimization problems, each agent can get information only from a neighborhood define...
© 2017 IEEE. Personal use for this material is permitted. Permission from IEEE must be obtained for ...
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
In a distributed optimization problem, the complete problem information is not available at a single...
In this paper we investigate how standard nonlinear programming algorithms can be used to solve cons...
© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommo...
This paper studies distributed optimization having flocking behavior and local constraint set. Multi...
Distributed optimization requires the optimization of a global objective function that is distribute...
Constraint satisfaction/optimization is a powerful paradigm for solving numerous tasks in distribute...
International audienceIn this article, we illustrate practical issues arising in the development of ...
© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...