Traffic Queue Length and Pressure Estimation for Road Networks with Geometric Deep Learning Algorithms

Due to urbanization and the increase of individual mobility, in most metropolitan areas around the world congestion and inefficient traffic management occur. Highly necessary intelligent traffic control systems, which are able to reduce congestion, rely on measurements of traffic situations in urban...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2019-05
1. Verfasser: Ehlers, Simon F G
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Ehlers, Simon F G
description Due to urbanization and the increase of individual mobility, in most metropolitan areas around the world congestion and inefficient traffic management occur. Highly necessary intelligent traffic control systems, which are able to reduce congestion, rely on measurements of traffic situations in urban road networks and freeways. Unfortunately, the instrumentation for accurate traffic measurement is expensive and not widely implemented. This thesis addresses this problem, where relatively inexpensive and easy to install loop-detectors are used by a geometric deep learning algorithm, which uses loop-detector data in a spatial context of a road network, to estimate queue length in front of signalized intersections, which can be then used for following traffic control tasks. Therefore, in the first part of this work a conventional estimation method for queue length (which does not use machine learning techniques) based on second-by-second loop-detector data is implemented, which uses detected shockwaves in queues to estimate the length and point of time for the maximum queue. The method is later used as reference but also as additional input information for the geometric deep learning approach. In the second part the geometric deep learning algorithm is developed, which uses spatial correlations in the road network but also temporal correlations in detector data time sequences by new attention mechanisms, to overcome the limitations of conventional methods like excess traffic demand, lane changing and stop-and-go traffic. Therefore, it is necessary to abstract the topology of the road network in a graph. Both approaches are compared regarding their performance, reliability as well as limitations and validated by usage of the traffic simulation software SUMO (Simulation of Urban MObility). Finally, the results are discussed in the conclusions and further investigations are suggested.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2224141661</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2224141661</sourcerecordid><originalsourceid>FETCH-proquest_journals_22241416613</originalsourceid><addsrcrecordid>eNqNzEEKwjAQheEgCIr2DgOuhTat1a1o1YWISvcSdFKjNtGZhF7fLDyAq7d4H39PDGWeZ9NFIeVAJMyPNE1lOZezWT4UuialtbnCKWBA2KNt_B2UvcGRkDkQQsXetMobZ0E7grNTNzig7xw9GToT-RZdi55iZY34jhFF1tgGlq_GUQQtj0Vfqxdj8tuRmGyqerWbvsl9ArK_PFwgG6-LlLLIiqwss_w_9QWWS0bh</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2224141661</pqid></control><display><type>article</type><title>Traffic Queue Length and Pressure Estimation for Road Networks with Geometric Deep Learning Algorithms</title><source>Free E- Journals</source><creator>Ehlers, Simon F G</creator><creatorcontrib>Ehlers, Simon F G</creatorcontrib><description>Due to urbanization and the increase of individual mobility, in most metropolitan areas around the world congestion and inefficient traffic management occur. Highly necessary intelligent traffic control systems, which are able to reduce congestion, rely on measurements of traffic situations in urban road networks and freeways. Unfortunately, the instrumentation for accurate traffic measurement is expensive and not widely implemented. This thesis addresses this problem, where relatively inexpensive and easy to install loop-detectors are used by a geometric deep learning algorithm, which uses loop-detector data in a spatial context of a road network, to estimate queue length in front of signalized intersections, which can be then used for following traffic control tasks. Therefore, in the first part of this work a conventional estimation method for queue length (which does not use machine learning techniques) based on second-by-second loop-detector data is implemented, which uses detected shockwaves in queues to estimate the length and point of time for the maximum queue. The method is later used as reference but also as additional input information for the geometric deep learning approach. In the second part the geometric deep learning algorithm is developed, which uses spatial correlations in the road network but also temporal correlations in detector data time sequences by new attention mechanisms, to overcome the limitations of conventional methods like excess traffic demand, lane changing and stop-and-go traffic. Therefore, it is necessary to abstract the topology of the road network in a graph. Both approaches are compared regarding their performance, reliability as well as limitations and validated by usage of the traffic simulation software SUMO (Simulation of Urban MObility). Finally, the results are discussed in the conclusions and further investigations are suggested.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Computer simulation ; Control tasks ; Deep learning ; Highways ; Intersections ; Lane changing ; Machine learning ; Metropolitan areas ; Network reliability ; Queues ; Queuing theory ; Roads ; Sensors ; Shock waves ; Spatial data ; Stability ; Topology ; Traffic congestion ; Traffic control ; Traffic flow ; Traffic management ; Urbanization</subject><ispartof>arXiv.org, 2019-05</ispartof><rights>2019. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Ehlers, Simon F G</creatorcontrib><title>Traffic Queue Length and Pressure Estimation for Road Networks with Geometric Deep Learning Algorithms</title><title>arXiv.org</title><description>Due to urbanization and the increase of individual mobility, in most metropolitan areas around the world congestion and inefficient traffic management occur. Highly necessary intelligent traffic control systems, which are able to reduce congestion, rely on measurements of traffic situations in urban road networks and freeways. Unfortunately, the instrumentation for accurate traffic measurement is expensive and not widely implemented. This thesis addresses this problem, where relatively inexpensive and easy to install loop-detectors are used by a geometric deep learning algorithm, which uses loop-detector data in a spatial context of a road network, to estimate queue length in front of signalized intersections, which can be then used for following traffic control tasks. Therefore, in the first part of this work a conventional estimation method for queue length (which does not use machine learning techniques) based on second-by-second loop-detector data is implemented, which uses detected shockwaves in queues to estimate the length and point of time for the maximum queue. The method is later used as reference but also as additional input information for the geometric deep learning approach. In the second part the geometric deep learning algorithm is developed, which uses spatial correlations in the road network but also temporal correlations in detector data time sequences by new attention mechanisms, to overcome the limitations of conventional methods like excess traffic demand, lane changing and stop-and-go traffic. Therefore, it is necessary to abstract the topology of the road network in a graph. Both approaches are compared regarding their performance, reliability as well as limitations and validated by usage of the traffic simulation software SUMO (Simulation of Urban MObility). Finally, the results are discussed in the conclusions and further investigations are suggested.</description><subject>Algorithms</subject><subject>Computer simulation</subject><subject>Control tasks</subject><subject>Deep learning</subject><subject>Highways</subject><subject>Intersections</subject><subject>Lane changing</subject><subject>Machine learning</subject><subject>Metropolitan areas</subject><subject>Network reliability</subject><subject>Queues</subject><subject>Queuing theory</subject><subject>Roads</subject><subject>Sensors</subject><subject>Shock waves</subject><subject>Spatial data</subject><subject>Stability</subject><subject>Topology</subject><subject>Traffic congestion</subject><subject>Traffic control</subject><subject>Traffic flow</subject><subject>Traffic management</subject><subject>Urbanization</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNqNzEEKwjAQheEgCIr2DgOuhTat1a1o1YWISvcSdFKjNtGZhF7fLDyAq7d4H39PDGWeZ9NFIeVAJMyPNE1lOZezWT4UuialtbnCKWBA2KNt_B2UvcGRkDkQQsXetMobZ0E7grNTNzig7xw9GToT-RZdi55iZY34jhFF1tgGlq_GUQQtj0Vfqxdj8tuRmGyqerWbvsl9ArK_PFwgG6-LlLLIiqwss_w_9QWWS0bh</recordid><startdate>20190509</startdate><enddate>20190509</enddate><creator>Ehlers, Simon F G</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20190509</creationdate><title>Traffic Queue Length and Pressure Estimation for Road Networks with Geometric Deep Learning Algorithms</title><author>Ehlers, Simon F G</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_22241416613</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Computer simulation</topic><topic>Control tasks</topic><topic>Deep learning</topic><topic>Highways</topic><topic>Intersections</topic><topic>Lane changing</topic><topic>Machine learning</topic><topic>Metropolitan areas</topic><topic>Network reliability</topic><topic>Queues</topic><topic>Queuing theory</topic><topic>Roads</topic><topic>Sensors</topic><topic>Shock waves</topic><topic>Spatial data</topic><topic>Stability</topic><topic>Topology</topic><topic>Traffic congestion</topic><topic>Traffic control</topic><topic>Traffic flow</topic><topic>Traffic management</topic><topic>Urbanization</topic><toplevel>online_resources</toplevel><creatorcontrib>Ehlers, Simon F G</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ehlers, Simon F G</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Traffic Queue Length and Pressure Estimation for Road Networks with Geometric Deep Learning Algorithms</atitle><jtitle>arXiv.org</jtitle><date>2019-05-09</date><risdate>2019</risdate><eissn>2331-8422</eissn><abstract>Due to urbanization and the increase of individual mobility, in most metropolitan areas around the world congestion and inefficient traffic management occur. Highly necessary intelligent traffic control systems, which are able to reduce congestion, rely on measurements of traffic situations in urban road networks and freeways. Unfortunately, the instrumentation for accurate traffic measurement is expensive and not widely implemented. This thesis addresses this problem, where relatively inexpensive and easy to install loop-detectors are used by a geometric deep learning algorithm, which uses loop-detector data in a spatial context of a road network, to estimate queue length in front of signalized intersections, which can be then used for following traffic control tasks. Therefore, in the first part of this work a conventional estimation method for queue length (which does not use machine learning techniques) based on second-by-second loop-detector data is implemented, which uses detected shockwaves in queues to estimate the length and point of time for the maximum queue. The method is later used as reference but also as additional input information for the geometric deep learning approach. In the second part the geometric deep learning algorithm is developed, which uses spatial correlations in the road network but also temporal correlations in detector data time sequences by new attention mechanisms, to overcome the limitations of conventional methods like excess traffic demand, lane changing and stop-and-go traffic. Therefore, it is necessary to abstract the topology of the road network in a graph. Both approaches are compared regarding their performance, reliability as well as limitations and validated by usage of the traffic simulation software SUMO (Simulation of Urban MObility). Finally, the results are discussed in the conclusions and further investigations are suggested.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2019-05
issn 2331-8422
language eng
recordid cdi_proquest_journals_2224141661
source Free E- Journals
subjects Algorithms
Computer simulation
Control tasks
Deep learning
Highways
Intersections
Lane changing
Machine learning
Metropolitan areas
Network reliability
Queues
Queuing theory
Roads
Sensors
Shock waves
Spatial data
Stability
Topology
Traffic congestion
Traffic control
Traffic flow
Traffic management
Urbanization
title Traffic Queue Length and Pressure Estimation for Road Networks with Geometric Deep Learning Algorithms
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T16%3A05%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Traffic%20Queue%20Length%20and%20Pressure%20Estimation%20for%20Road%20Networks%20with%20Geometric%20Deep%20Learning%20Algorithms&rft.jtitle=arXiv.org&rft.au=Ehlers,%20Simon%20F%20G&rft.date=2019-05-09&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2224141661%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2224141661&rft_id=info:pmid/&rfr_iscdi=true