Stochastic distributed multi-agent planning and applications to traffic

This paper proposes a method for multi-agent path planning on a road network in the presence of congestion. We suggest a distributed method to find paths for multiple agents by introducing a probabilistic path choice achieving global goals such as the social optimum. This approach, which shows that the global goals can be achieved by local processing using only local information, can be parallelized and sped-up using massive parallel processing. The probabilistic assignment reliably copes with the case of random choices of unidentified agents or random route changes of agents who ignore our path guidance. We provide the analytical result on convergence and running time. We demonstrate and evaluate our algorithm by an implementation using asynchronous computation on multi-core computers.

[1]  Eitan Altman,et al.  Equilibria for multiclass routing in multi-agent networks , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[2]  Warrren B Powell,et al.  The Convergence of Equilibrium Algorithms with Predetermined Step Sizes , 1982 .

[3]  Alon Itai,et al.  On the complexity of time table and multi-commodity flow problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[4]  Michael G.H. Bell,et al.  Risk-averse user equilibrium traffic assignment: an application of game theory , 2002 .

[5]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[6]  Michael P. Wellman.  A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems , 1993, J. Artif. Intell. Res..

[7]  Hillel Bar-Gera,et al.  Differences among Route Flow Solutions for the User-Equilibrium Traffic Assignment Problem , 2007 .

[8]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[9]  J G Wardrop,et al.  CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[10]  Shantayanan Devarajan,et al.  A note of network equilibrium and noncooperative games , 1981 .

[11]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[12]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[13]  Terry L. Friesz,et al.  A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem , 1993, Oper. Res..

[14]  André Langevin,et al.  Scheduling and routing of automated guided vehicles: A hybrid approach , 2007, Comput. Oper. Res..

[15]  C. Gawron,et al.  An Iterative Algorithm to Determine the Dynamic User Equilibrium in a Traffic Simulation Model , 1998 .

[16]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[17]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[18]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[19]  Hari Balakrishnan,et al.  Stochastic Motion Planning and Applications to Traffic , 2008, WAFR.

[20]  Jung-Hoon Lee,et al.  A real-time traffic control scheme of multiple AGV systems for collision free minimum time motion: a routing table approach , 1998, IEEE Trans. Syst. Man Cybern. Part A.