Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation

• Autores: Shu- Liang, Xianlin Zeng, Yiguang Hong
• Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Nº. 95, 2018, págs. 222-228
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • In this paper, we consider distributed optimization design for resource allocation problems over weight-balanced graphs. With the help of singular perturbation analysis, we propose a simple sub-optimal continuous-time optimization algorithm. Moreover, we prove the existence and uniqueness of the algorithm equilibrium, and then show the convergence with an exponential rate. Finally, we verify the sub-optimality of the algorithm, which can approach the optimal solution as an adjustable parameter tends to zero.