Skip to main content

Distributed Regret Matching Algorithm for a Dynamic Route Guidance

  • Conference paper
Agent and Multi-Agent Systems: Technologies and Applications

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 296))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bottom, J.A.: Consistent anticipatory route guidance. Ph.D. thesis, Massachusetts Institute of Technology (2000)

    Google Scholar 

  2. Zuurbier, F.S.: Intelligent Route Guidance. PhD thesis, Technische Universiteit Delft (2010)

    Google Scholar 

  3. Kaufman, D.E., Smith, R.L., Wunderlich, K.E.: An iterative routing/assignment method for anticipatory real-time route guidance. In: IEEE Vehicle Navigation and Information Systems Conference, vol. 2, pp. 693–700 (1991)

    Google Scholar 

  4. Sarachik, P.E., Ozguner, U.: On Decentralized Dynamic Routing for Congested Traffic Networks. IEEE Transactions on Automatic Control AC-27(6), 1233–1238 (1982)

    Google Scholar 

  5. Minciardi, R., Gaetani, F.: A decentralized optimal control scheme for route guidance in urban road networks. In: IEEE Intelligent Transportation Systems Conference, pp. 1195–1199 (2001)

    Google Scholar 

  6. Deflorio, F.P.: Evaluation of a reactive dynamic route guidance strategy. Transportation Research Part C 11, 375–388 (2003)

    Article  Google Scholar 

  7. Peeta, S., Yu, J.: Adaptability of a hybrid route choice model to incorporating driver behavior dynamics under information provision. IEEE Transactions on Systems, Man, and Cybernetics Part A 34(2), 243–256 (2004)

    Article  Google Scholar 

  8. Jha, M., Madanat, S., Peeta, S.: Perception updating and day-to-day travel choice dynamics in traffic networks with information provision. Transportation Research Part C 6, 189–212 (1998)

    Article  Google Scholar 

  9. Fudenberg, D., Levine, D.K.: The Theory of Learning in Games. MIT Press, Cambridge (1998)

    MATH  Google Scholar 

  10. Young, P.H.: Strategic Learning and Its Limit. Oxford University Press, Oxford (2005)

    Google Scholar 

  11. Monderer, D., Shapley, L.S.: Fictitious Play Property for Games with Identical Interests. Journal of Economic Theory 68, 258–265 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  12. Hart, S., Mas-Colell, A.: A simple adaptive procedure leading to correlated equilibrium. Econometrica 68, 1127–1150 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  13. Cominetti, R., Melo, E., Sorin, S.: A payoff-based learning procedure and its application to traffic games. Games and Economic Behavior 70(1), 71–83 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  14. Garcia, A., Reaume, D., Smith, R.L.: Fictitious play for finding system optimal routings in dynamic traffic networks. Transportation Research Part B 34, 147–156 (2000)

    Article  Google Scholar 

  15. Miyagi, T., Peque Jr., G.C.: Informed-user algorithms that converge to Nash equilibrium in traffic games. Procedia - Social and Behavioral Sciences 54, 438–449 (2012)

    Article  Google Scholar 

  16. Friesz, T.L., Bernstein, D., Smith, T., Tobin, R., Wie, B.: A variational inequality formulation of the dynamic network user equilibrium problem. Operations Research 41, 80–91 (1993)

    Article  MathSciNet  Google Scholar 

  17. Tong, C.O., Wong, S.C.: A predictive dynamic traffic assignment model in congested capacity-constrained road networks. Transportation Research Part B 34(8), 625–644 (2000)

    Article  Google Scholar 

  18. Kerner, B.S., Rehborn, H., Aleksic, M., Haug, A.: Traffic Prediction Systems in Vehicles. In: 8th International IEEE Conference on Intelligent Transportation Systems, Vienna, Austria, pp. 72–77 (2005)

    Google Scholar 

  19. Kuwahara, M., Akamatsu, T.: Decomposition of the reactive assignments with queues for many-to-many origin-destination pattern. Transportation Research Part B 31(1), 1–10 (1997)

    Article  Google Scholar 

  20. Gawron, C.: An iterative algorithm to determine the dynamic user equilibrium in a traffic simulation model. International Journal of Modern Physics C 9(3), 393–408 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tai-Yu Ma .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Ma, TY. (2014). Distributed Regret Matching Algorithm for a Dynamic Route Guidance. In: Jezic, G., Kusek, M., Lovrek, I., J. Howlett, R., Jain, L. (eds) Agent and Multi-Agent Systems: Technologies and Applications. Advances in Intelligent Systems and Computing, vol 296. Springer, Cham. https://doi.org/10.1007/978-3-319-07650-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07650-8_12

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07649-2

  • Online ISBN: 978-3-319-07650-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics