AN MDP decomposition approach for traffic control at Isolated signalized intersections

Probability in the Engineering and Informational Sciences

Volumn 22, Issue 4, 2008, Pages 587-602

  Haijema, René ^a   Van Der Wal, Jan ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION DISSEMINATION; STREET TRAFFIC CONTROL; TRAFFIC SIGNALS;

DECOMPOSITION APPROACH; DYNAMIC CONTROLS; MARKOVIAN DECISION PROCESS; NUMBER OF STATE; OPTIMAL STRATEGIES; POLICY ITERATION; SIGNALIZED INTERSECTION; VALUE ITERATION;

TRAFFIC SIGNS;

EID: 52949141139     PISSN: 02699648     EISSN: 14698951     Source Type: Journal    
DOI: 10.1017/S026996480800034X     Document Type: Article

References (22)

1. Bhulai, S. (2004). Dynamic routing policies for multi-skill call centers. Technical report WS2004-11, Vrije Universiteit Amsterdam.
2. Darroch, J.N. (1964). On the traffic light queue. Annals of Mathematical Statistics 35(1): 380-388.
3. Farges, J.-L., Henry, J.-J., & Tufal, J. (1983). The PRODYN real-time traffic algorithm. In Proceedings of the 4th IFAC Symposium on Transportation Systems, pp. 307-312.
4. Higashikubo, M., Hinenoya, T., & Takeuchi, K. (1997). Traffic queue length measurement using an image processing sensor. Sumitomo Electric Technical Review 43: 64-68.
5. Krishnan, K.R. & Ott, T.J. (1986). State-dependent routing for telephone traffic: Theory and results. In Proceedings of the 25th IEEE conference on decision and control, Athens, Greece. New York: IEEE, pp. 2124-2128.
6. Krishan, K.R. & Ott, T.J. (1987). Joining the right queue: A Markov decision rule. In Proceedings of the 26th IEEE conference on decision and control, Los Angeles. New York: IEEE, pp. 1863-1868.
7. McNeill, D.R. (1965).A solution to the fixed cycle traffic light problem for compound poisson arrivals. Journal of Applied Probability 5: 624-635.
8. Miller, A.J. (1963). Settings for fixed-cycle traffic signals. Operations Research 14(4): 373-386.
9. Miller, A.J. (1963).A computer control system for traffic networks. In Proceedings of the International Symposium on Traffic Theory, pp. 200-220.
10. Newell, G.F. (1960). Queues for a fixed-cycle traffic light. Annals of Mathematical Statistics 31(3): 589-597.
11. Newell, G.F. (1965). Approximation methods for queues with applications to the fixed-cycle traffic light. SIAM Review 7(2): 223-240.
12. Norman, J.M. (1972). Heuristic procedures in dynamic programming. Manchester, UK: Manchester University Press.
13. Papageorgiou, M., Diakaki, C., Dinopoulou, V., Kotsialos, A., & Wang, Y. (2003). Review of road traffic control strategies. In Proc. IEEE 91: 2043-2067.
14. Prinsen, L.H.A. (2006). Personal communication.
15. Sassen, S.A.E., Tijms, H.C., & Nobel, R.D. (1997). A heuristic rule for routing customers to parallel queues. Statistica Neerlandica 51(1): 107-121.
16. Sen, S. & Head, L.(1997). Controlled optimization of phases at an intersection.Transportation Science 31: 5-17.
17. Tijms, H.C. (2003). A first course in stochastic models. New York: Wiley.
18. van Leeuwaarden, J.S.H. (2006). Delay analysis for the fixed cycle traffic light queue. Transportation Science 40(2): 189-199.
19. Vincent, R.A. &Young, C.P. (1986). Self-optimizing traffic signal control using microprocessor: The TRRL "MOVA" strategy for isolated intersections. Traffic Engineering and Control 27: 385-387.
20. Webster, F.V. (1958). Traffic signal settings. Road Research technical paper 39. Road Research Laboratory, London.
21. Wiering, M., van Veenen, J., Vreeken, J., & Koopman, A. (2004). Intelligent traffic light control. Technical report UU-CS-2004-029, Institute of Information and Computing Sciences, Utrecht University.
22. Wijngaard, J. (1979). Decomposition for dynamic programming in production and inventory control. Engineering and Process Economics 4: 385-388.