Cited by 112Traffic control and managementTraffic Prediction and Management TechniquesReinforcement Learning in Robotics

The DOI matches its Crossref record; 26 of the 27 references it cites were found in a registry or an index.

Multi-Agent Reinforcement Learning for Traffic Signal Control: A Cooperative Approach

Open access

Abstract

The rapid growth of urbanization and the constant demand for mobility have put a great strain on transportation systems in cities. One of the major challenges in these areas is traffic congestion, particularly at signalized intersections. This problem not only leads to longer travel times for commuters, but also results in a significant increase in local and global emissions. The fixed cycle of traffic lights at these intersections is one of the primary reasons for this issue. To address these challenges, applying reinforcement learning to coordinating traffic light controllers has become a highly researched topic in the field of transportation engineering. This paper focuses on the traffic signal control problem, proposing a solution using a multi-agent deep Q-learning algorithm. This study introduces a novel rewarding concept in the multi-agent environment, as the reward schemes have yet to evolve in the following years with the advancement of techniques. The goal of this study is to manage traffic networks in a more efficient manner, taking into account both sustainability and classic measures. The results of this study indicate that the proposed approach can bring about significant improvements in transportation systems. For instance, the proposed approach can reduce fuel consumption by 11% and average travel time by 13%. The results of this study demonstrate the potential of reinforcement learning in improving the coordination of traffic light controllers and reducing the negative impacts of traffic congestion in urban areas. The implementation of this proposed solution could contribute to a more sustainable and efficient transportation system in the future.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/su15043479

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 27 references

Research works printed but not linked: 7

  1. Roess, R.P., Prassas, E.S., and McShane, W.R. (2004). Traffic Engineering, Pearson/Prentice Hall.
  2. Varaiya, P. (2013). Advances in Dynamic Network Modeling in Complex Transportation Systems, Springer.
  3. Van der Pol, E., and Oliehoek, F.A. (2016, January 10). Coordinated deep reinforcement learners for traffic light control. Proceedings of the Learning, Inference and Control of Multi-Agent Systems (at NIPS 2016), Barcelona, Spain.
  4. Genders, W., and Razavi, S. (2016). Using a deep reinforcement learning agent for traffic signal control. arXiv.
  5. Ng, A.Y., Coates, A., Diel, M., Ganapathi, V., Schulte, J., Tse, B., Berger, E., and Liang, E. (2006). Experimental Robotics IX, Springer.
  6. Nowé, A., Vrancx, P., and Hauwere, Y.M.D. (2012). Reinforcement Learning, Springer.
  7. Nair, A., Srinivasan, P., Blackwell, S., Alcicek, C., Fearon, R., De Maria, A., Panneershelvam, V., Suleyman, M., Beattie, C., and Petersen, S. (2015). Massively parallel methods for deep reinforcement learning. arXiv.

Cited by

Sorted by citations

See all 112

Metadata

Authors
Kolat, M., Kővári, B., Bécsi, T., & Aradi, S.
Affiliations
Budapest University of Technology and Economics (HU)
Corresponding author
  • Bécsi, Tamás
  • Aradi, Szilárd
Venue
Sustainability
Publisher
MDPI AG
Published
2023-02-14
Volume
15
Issue
4
Pages
3479
ISSN
2071-1050 (ISSN-L)
OpenAlex
W4320729567
Cited by
94
References
27
Citations by year
2026: 33 · 2025: 36 · 2024: 21 · 2023: 4
FWCI
10.09
Type
journal article
Language
en
Open access
Locations
  • Sustainability (publishedVersion, cc-by)
  • Repository of the Academy's Library (Library of the Hungarian Academy of Sciences) (acceptedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
Funders
  • European Union (RRF-2.3.1-21-2022-00002, BME-NVA-02)
  • National Research, Development and Innovation Fund (RRF-2.3.1-21-2022-00002, BME-NVA-02)
  • János Bolyai Research Scholarship of the Hungarian Academy of Sciences (RRF-2.3.1-21-2022-00002, BME-NVA-02)
Topics
  • Physical Sciences › Engineering › Control and Systems Engineering › Traffic control and management
  • Social Sciences › Transportation › Traffic Prediction and Management Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
Keywords
traffic signal control, traffic congestion, signalized intersections, reward function design, fuel consumption reduction, travel time reduction, sustainable transport, urban traffic management

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