Journal article icon

Journal article

Density flow in dynamical networks via mean-field games

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 ...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1109/TAC.2016.2584979

Authors


More by this author
Institution:
University of Oxford
Oxford college:
Worcester College
Role:
Author
Publisher:
Institute of Electrical and Electronics Engineers Publisher's website
Journal:
IEEE Transactions on Automatic Control Journal website
Volume:
62
Issue:
3
Pages:
1342-1355
Publication date:
2016-06-24
Acceptance date:
2016-06-13
DOI:
EISSN:
1558-2523
ISSN:
0018-9286
Source identifiers:
686640
Keywords:
Pubs id:
pubs:686640
UUID:
uuid:8dcf070c-f8f0-432a-a35d-68deeee6a21b
Local pid:
pubs:686640
Deposit date:
2017-03-31

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP