A distributed routing control algorithm for dynamic networks has recently been presented in the literature. The networks were modeled using time evolution of density at network edges and the routing control algorithm allowed edge density to converge to a Wardrop equilibrium, which was characterized by an equal traffic density on all used paths. We borrow the idea and rearrange the density model to recast the problem within the framework of mean-field games. The contribution of this paper is three-fold. First, we provide a mean-field game formulation of the problem at hand. Second, we illustrate an extended state space solution approach. Third, we study the stochastic case where the density evolution is driven by a Brownian motion.
Bauso, D., Zhang, X., & Papachristodulou, A. (2014). Density Flow over Networks: A Mean-field Game Theoretic Approach. In Proc of IEEE Conference on Decision and Control (pp.3469-3474).
Autori: | Bauso, D.; Zhang, X.; Papachristodulou, A. |
Titolo: | Density Flow over Networks: A Mean-field Game Theoretic Approach |
Settore Scientifico Disciplinare: | Settore ING-INF/04 - Automatica Settore MAT/09 - Ricerca Operativa |
Data di creazione: | 2014 |
Nome del convegno: | IEEE Conference on Decision and Control |
Luogo del convegno: | Los Angeles |
Anno del convegno: | Dicembre 2014 |
Data di pubblicazione: | 2014 |
Numero di pagine: | 6 |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1109/CDC.2014.7039927 |
Citazione: | Bauso, D., Zhang, X., & Papachristodulou, A. (2014). Density Flow over Networks: A Mean-field Game Theoretic Approach. In Proc of IEEE Conference on Decision and Control (pp.3469-3474). |
Tipologia: | 0 - Proceedings (TIPOLOGIA NON ATTIVA) |
Appare nelle tipologie: | 0 - Proceedings (TIPOLOGIA NON ATTIVA) |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
2014CDC2FINAL.pdf | N/A | Administrator Richiedi una copia |