Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 458

The DOI matches its Crossref record, with a small difference in title or year; 1 of the 1 references it cites were found in a registry or an index.

Multiagent Reinforcement Learning for Integrated Network of Adaptive Traffic Signal Controllers (MARLIN-ATSC): Methodology and Large-Scale Application on Downtown Toronto

El-Tantawy, Samah, Abdulhai, Baher, Abdelgawad, Hossam·2013·IEEE Transactions on Intelligent Transportation Systems
DOI 10.1109/tits.2013.2255286
Open this paper in CoChat — free account

Abstract

Population is steadily increasing worldwide, resulting in intractable traffic congestion in dense urban areas. Adaptive traffic signal control (ATSC) has shown strong potential to effectively alleviate urban traffic congestion by adjusting signal timing plans in real time in response to traffic fluctuations to achieve desirable objectives (e.g., minimize delay). Efficient and robust ATSC can be designed using a multiagent reinforcement learning (MARL) approach in which each controller (agent) is responsible for the control of traffic lights around a single traffic junction. Applying MARL approaches to the ATSC problem is associated with a few challenges as agents typically react to changes in the environment at the individual level, but the overall behavior of all agents may not be optimal. This paper presents the development and evaluation of a novel system of multiagent reinforcement learning for integrated network of adaptive traffic signal controllers (MARLIN-ATSC). MARLIN-ATSC offers two possible modes: 1) independent mode, where each intersection controller works independently of other agents; and 2) integrated mode, where each controller coordinates signal control actions with neighboring intersections. MARLIN-ATSC is tested on a large-scale simulated network of 59 intersections in the lower downtown core of the City of Toronto, ON, Canada, for the morning rush hour. The results show unprecedented reduction in the average intersection delay ranging from 27% in mode 1 t…

Overview

Integrity signals

Registry

Crossref · 10.1109/tits.2013.2255286

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 1 references

Research works printed but not linked: 34

  1. 2012, Quadstone Paramics, Paramics Microscopic Traffic Simulation Software
  2. ono, 1996, Multi-agent reinforcement learning: A modular approach, Proc 2nd Int Conf Multi-Agent Syst, 252
  3. nair, 2005, Networked distributed POMDPs: A synthesis of distributed constraint optimization and POMDPs, Proc Nat Conf Artif Intell, 133
  4. 10.1007/s10458-004-6975-9 · DOI
  5. el-tantawy, 2012, Neighborhood coordination-based multi-agent reinforcement learning for coordinated adaptive traffic signal control, Transp Res Board
  6. el-tantawy, 2011, Comprehensive analysis of reinforcement learning methods and parameters for adaptive traffic signal control, Transp Res Board
  7. 10.1109/ITSC.2010.5625066 · DOI
  8. 10.3328/TL.2010.02.02.89-110 · DOI
  9. sutton, 1998, Introduction to Reinforcement Learning
  10. basar, 1999, Dynamic Noncooperative Game Theory
  11. 10.1109/TSMCC.2007.913919 · DOI · Paper page
  12. claus, 1998, The dynamics of reinforcement learning in cooperative multiagent systems, Proc Nat Conf Artif Intell and Conf Innovative Appl Artif Intell, 746
  13. weinberg, 2004, Best-response multiagent learning in non-stationary environments, Proc 3rd Int Joint Conf Auton Agents and MultiAgent Syst, 506
  14. thorpe, 1997, Vehicle Traffic Light Control Using Sarsa
  15. wiering, 2000, Multi-agent reinforcement learning for traffic light control, Proc 17th Int Conf Mach Learn, 1151
  16. 10.1109/WCICA.2008.4593378 · DOI
  17. sims, 1979, SCAT?The Sydney co-ordinated adaptive traffic system: Philosophy and benefits, Int Symp Traffic Control Systems
  18. medina, 2012, Q-learning and approximate dynamic programming for traffic control?A case study for an oversaturated network, Transp Res Board Annu Meet
  19. 10.1016/S0967-0661(01)00121-6 · DOI
  20. gartner, 1983, OPAC: A demand-responsive strategy for traffic signal control, Transp Res Rec J Transp Res Board, 906, 75
  21. kuyer, 2008, Multiagent reinforcement learning for urban traffic control using coordination graph, Proc 19th Eur Conf Mach Learn, 656
  22. farges, 1983, The PRODYN real-time traffic algorithm, 4th IFAC/IFIP/IFORS Symp Control Transp Syst
  23. 10.1007/s10458-008-9062-9 · DOI
  24. head, 1992, Hierarchical framework for real-time traffic control, Transp Res Rec, 1360, 82
  25. hunt, 1981, SCOOT?a traffic responsive method of coordinating signals
  26. mcshane, 1998, Traffic Engineering
  27. 10.1139/l03-014 · DOI
  28. 10.1061/(ASCE)0733-947X(2003)129:3(278) · DOI
  29. de oliveira, 2006, Reinforcement learning-based control of traffic lights in non-stationary environments: A case study in a microscopic simulator, EuMA Proc, 31
  30. camponogara, 2003, Distributed learning agents in urban traffic control, Proc 11th Portuguese Conf Artif Intell, 324, 10.1007/978-3-540-24580-3_38 · DOI
  31. 10.1049/iet-its.2009.0070 · DOI
  32. richter, 2007, Advances in neural information processing systems
  33. 10.1109/WIIAT.2008.88 · DOI
  34. 10.1109/ITSC.2008.4732718 · DOI

Cited by

Metadata

Authors
El-Tantawy, S., Abdulhai, B., & Abdelgawad, H.
Venue
IEEE Transactions on Intelligent Transportation Systems
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Published
2013-09
Volume
14
Issue
3
Pages
1140-1150
ISSN
  • 1524-9050
  • 1558-0016
DOI
10.1109/tits.2013.2255286
Cited by
458
References
1
Licence
ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html (vor)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.