Gradient Descent for Resource Allocation with Packet Loss*

Autor: Vizuete, Renato, Frasca, Paolo, Panteley, Elena
Přispěvatelé: Laboratoire des signaux et systèmes (L2S), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Dynamics and Control of Networks (DANCE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-GIPSA Pôle Automatique et Diagnostic (GIPSA-PAD), Grenoble Images Parole Signal Automatique (GIPSA-lab), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Grenoble Alpes (UGA), ANR-18-CE40-0010,HANDY,Systèmes Dynamiques Hybrides et en Réseau(2018)
Rok vydání: 2022
Předmět:
Zdroj: IFAC-Papers
NecSys 2022-9th IFAC Conference on Networked Systems
NecSys 2022-9th IFAC Conference on Networked Systems, Jul 2022, Zurich, Switzerland. pp.109-114, ⟨10.1016/j.ifacol.2022.07.244⟩
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2022.07.244
Popis: International audience; This paper studies the effect of packet loss during the application of the weighted gradient descent to solve a resource allocation problem with piecewise quadratic cost functions in a multi-agent system. We define two performance metrics that measure, respectively, the deviation from the constraint and the error on the expected cost function. We derive upper bounds on both metrics: both bounds are proportional to the difference between the initial cost function and the cost function evaluated at the minimizer. Then, we extend the analysis of the constraint violation to open multi-agent systems where agents are replaced: based on a preliminary result and simulations we show that the combination of replacements and losses makes the constraint violation error diverge with time.
Databáze: OpenAIRE