Several problems in transportation and communication networks lead to the notion of Wardrop equilibrium. There exists a large number of algorithms to find Wardrop equilibria, both centralized and distributed. This paper presents a distributed control algorithm, which converges to a Wardrop equilibrium, derived from the algorithm presented in Fischer and Vöcking (2009). The innovation lies in the fact that convergence results are obtained considering that communications occur over time-varying communication graphs, with mild assumptions on the graph connectivity in time (uniform connectivity). © 2017 Elsevier Ltd
Wardrop equilibrium on time-varying graphs / Pietrabissa, Antonio; Suraci, Vincenzo. - In: AUTOMATICA. - ISSN 0005-1098. - STAMPA. - 84:(2017), pp. 159-165. [10.1016/j.automatica.2017.07.021]
Wardrop equilibrium on time-varying graphs
PIETRABISSA, Antonio
;
2017
Abstract
Several problems in transportation and communication networks lead to the notion of Wardrop equilibrium. There exists a large number of algorithms to find Wardrop equilibria, both centralized and distributed. This paper presents a distributed control algorithm, which converges to a Wardrop equilibrium, derived from the algorithm presented in Fischer and Vöcking (2009). The innovation lies in the fact that convergence results are obtained considering that communications occur over time-varying communication graphs, with mild assumptions on the graph connectivity in time (uniform connectivity). © 2017 Elsevier Ltd| File | Dimensione | Formato | |
|---|---|---|---|
|
Pietrabissa_Wardrop-equilibrium_2017.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
706.78 kB
Formato
Adobe PDF
|
706.78 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
