A centre–free approach for resource allocation with lower bounds

Germán Obando, Nicanor Quijano, Naly Rakoto–Ravalontsalama

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


Since complexity and scale of systems are continuously increasing, there is a growing interest in developing distributed algorithms that are capable to address information constraints, specially for solving optimisation and decision-making problems. In this paper, we propose a novel method to solve distributed resource allocation problems that include lower bound constraints. The optimisation process is carried out by a set of agents that use a communication network to coordinate their decisions. Convergence and optimality of the method are guaranteed under some mild assumptions related to the convexity of the problem and the connectivity of the underlying graph. Finally, we compare our approach with other techniques reported in the literature, and we present some engineering applications.

Original languageEnglish (US)
Pages (from-to)1830-1845
Number of pages16
JournalInternational Journal of Control
Issue number9
StatePublished - Sep 2 2017
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications


Dive into the research topics of 'A centre–free approach for resource allocation with lower bounds'. Together they form a unique fingerprint.

Cite this