Back to Search
Start Over
Density Flow in Dynamical Networks via Mean-Field Games.
- Source :
-
IEEE Transactions on Automatic Control . Mar2017, Vol. 62 Issue 3, p1342-1355. 14p. - Publication Year :
- 2017
-
Abstract
- Current distributed routing control algorithms for dynamic networks model networks using the time evolution of density at network edges, while the routing control algorithm ensures edge density to converge to a Wardrop equilibrium, which was characterized by an equal traffic density on all used paths. We rearrange the density model to recast the problem within the framework of mean-field games. In doing that, we illustrate an extended state-space solution approach and we study the stochastic case where the density evolution is driven by a Brownian motion. Further, we investigate the case where the density evolution is perturbed by a bounded adversarial disturbance. For both the stochastic and the worst-case scenarios, we provide conditions for the density to converge to a pre-assigned set. Moreover, we analyze such conditions from two different perspectives, repeated games with vector payoffs and inclusion theory. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189286
- Volume :
- 62
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Automatic Control
- Publication Type :
- Periodical
- Accession number :
- 121551243
- Full Text :
- https://doi.org/10.1109/TAC.2016.2584979