Distributed regret matching algorithm for a dynamic route guidance

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collectionChapterRevue par des pairs

Résumé

This paper proposes a distributed self-learning algorithm based on the regret matching process in games for a dynamic route guidance. We incorporate a user's past routing experiences and en-route traffic information into their optimal route guidance learning. The numerical study illustrates that the proposed self-guidance method can effectively reduce the travel times and delays of guided users in congested situation.
langue originaleAnglais
titreAgent and Multi-Agent Systems: Technologies and Applications
Sous-titreAdvances in Intelligent Systems and Computing
EditeurSpringer
Pages107-116
Nombre de pages10
ISBN (imprimé)978-3-319-07650-8
Les DOIs
étatPublié - 2014

Série de publications

NomAdvances in Intelligent Systems and Computing book series (AISC)
Volume296

Contient cette citation