Computer Research and Modeling
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Computer Research and Modeling:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Computer Research and Modeling, 2024, Volume 16, Issue 1, Pages 137–146
DOI: https://doi.org/10.20537/2076-7633-2024-16-1-137-146
(Mi crm1154)
 

SPECIAL ISSUE

Improving the quality of route generation in SUMO based on data from detectors using reinforcement learning

I. A. Saleneka, Ya. A. Seliverstovb, S. A. Seliverstovb, E. A. Sofronovac

a St. Petersburg Institute of Informatics and Automation of the Russian Academy of Sciences, 39 14-th Line VO, St. Petersburg, 199178, Russia
b Solomenko Institute of Transport Problems of the Russian Academy of Sciences, 13 12-th Line VO, St. Petersburg, 199178, Russia
c Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 44/2 Vavilova st., Moscow, 119333, Russia
References:
Abstract: This work provides a new approach for constructing high-precision routes based on data from transport detectors inside the SUMO traffic modeling package. Existing tools such as flowrouter and routeSampler have a number of disadvantages, such as the lack of interaction with the network in the process of building routes. Our rlRouter uses multi-agent reinforcement learning (MARL), where the agents are incoming lanes and the environment is the road network. By performing actions to launch vehicles, agents receive a reward for matching data from transport detectors. Parameter Sharing DQN with the LSTM backbone of the Q-function was used as an algorithm for multi-agent reinforcement learning.
Since the rlRouter is trained inside the SUMO simulation, it can restore routes better by taking into account the interaction of vehicles within the network with each other and with the network infrastructure. We have modeled diverse traffic situations on three different junctions in order to compare the performance of SUMO’s routers with the rlRouter. We used Mean Absoluter Error (MAE) as the measure of the deviation from both cumulative detectors and routes data. The rlRouter achieved the highest compliance with the data from the detectors. We also found that by maximizing the reward for matching detectors, the resulting routes also get closer to the real ones. Despite the fact that the routes recovered using rlRouter are superior to the routes obtained using SUMO tools, they do not fully correspond to the real ones, due to the natural limitations of induction-loop detectors. To achieve more plausible routes, it is necessary to equip junctions with other types of transport counters, for example, camera detectors.
Keywords: transport modeling, multi-agent reinforcement learning, intelligent transport systems
Received: 21.11.2023
Accepted: 21.12.2023
Document Type: Article
UDC: 519.876.5, 519.179.2
Language: English
Citation: I. A. Salenek, Ya. A. Seliverstov, S. A. Seliverstov, E. A. Sofronova, “Improving the quality of route generation in SUMO based on data from detectors using reinforcement learning”, Computer Research and Modeling, 16:1 (2024), 137–146
Citation in format AMSBIB
\Bibitem{SalSelSel24}
\by I.~A.~Salenek, Ya.~A.~Seliverstov, S.~A.~Seliverstov, E.~A.~Sofronova
\paper Improving the quality of route generation in SUMO based on data from detectors using reinforcement learning
\jour Computer Research and Modeling
\yr 2024
\vol 16
\issue 1
\pages 137--146
\mathnet{http://mi.mathnet.ru/crm1154}
\crossref{https://doi.org/10.20537/2076-7633-2024-16-1-137-146}
Linking options:
  • https://www.mathnet.ru/eng/crm1154
  • https://www.mathnet.ru/eng/crm/v16/i1/p137
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Computer Research and Modeling
    Statistics & downloads:
    Abstract page:213
    Full-text PDF :86
    References:47
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025