Finding best urban routes based on analyses of high level and IOPT Petri net models
This paper presents a tool that combines two kinds of Petri Net analyses to set the fastest routes to one vehicle in a bounded area of traffic urban. The first analysis consists of the discovery of possible routes in a state space generated from an IOPT Petri net model given the initial marking as t...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 6131 |
---|---|
container_issue | |
container_start_page | 6126 |
container_title | |
container_volume | |
creator | Dezani, H. Gomes, L. Damiani, F. Marranghello, N. |
description | This paper presents a tool that combines two kinds of Petri Net analyses to set the fastest routes to one vehicle in a bounded area of traffic urban. The first analysis consists of the discovery of possible routes in a state space generated from an IOPT Petri net model given the initial marking as the vehicle position. The second analysis receives the routes found in the first analysis and calculates the state equations at incidence matrix created from the High Level Petri net model to define the fastest route for each vehicle that arrive in the roads. It was considered the exchange of information between vehicle and infrastructure (V2I) to get the position and speed of all vehicles and support the analyses. With the results obtained we conclude that is possible optimizing the urban traffic flow if this tool is applied to all vehicles in a bounded urban traffic. |
doi_str_mv | 10.1109/IECON.2012.6389079 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6389079</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6389079</ieee_id><sourcerecordid>6389079</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-ba847f6a5c88096a5b61cf5e4532a5c1b08eddfca851c1b743b73375030ffece3</originalsourceid><addsrcrecordid>eNotkNFKwzAYRiMqOGdfQG_yAq35k6ZJLqVsOhhu4ATvRtL-2SJdK00n7O0t2KvDORffxUfII7AMgJnn1aLcvGecAc8KoQ1T5orcQ14owXMO4pokRunJwZgbMgMpRSoV_7ojSYzfjDEAnouCzcjHMrR1aA_UYRzouXe2pX13HjBSZyPWtGupbW1ziWPpPD2Gw5E2-IvNmGu62mx3dItDH2iLAz11NTbxgdx620RMJs7J53KxK9_S9eZ1Vb6s0wBKDqmzOle-sLLSmpmRroDKS8yl4GMExzTWta-sljCayoVTQijJBPMeKxRz8vS_GxBx_9OHk-0v--kT8QeeqFMh</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Finding best urban routes based on analyses of high level and IOPT Petri net models</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Dezani, H. ; Gomes, L. ; Damiani, F. ; Marranghello, N.</creator><creatorcontrib>Dezani, H. ; Gomes, L. ; Damiani, F. ; Marranghello, N.</creatorcontrib><description>This paper presents a tool that combines two kinds of Petri Net analyses to set the fastest routes to one vehicle in a bounded area of traffic urban. The first analysis consists of the discovery of possible routes in a state space generated from an IOPT Petri net model given the initial marking as the vehicle position. The second analysis receives the routes found in the first analysis and calculates the state equations at incidence matrix created from the High Level Petri net model to define the fastest route for each vehicle that arrive in the roads. It was considered the exchange of information between vehicle and infrastructure (V2I) to get the position and speed of all vehicles and support the analyses. With the results obtained we conclude that is possible optimizing the urban traffic flow if this tool is applied to all vehicles in a bounded urban traffic.</description><identifier>ISSN: 1553-572X</identifier><identifier>ISBN: 9781467324199</identifier><identifier>ISBN: 1467324191</identifier><identifier>EISBN: 1467324213</identifier><identifier>EISBN: 9781467324205</identifier><identifier>EISBN: 9781467324212</identifier><identifier>EISBN: 1467324205</identifier><identifier>DOI: 10.1109/IECON.2012.6389079</identifier><language>eng</language><publisher>IEEE</publisher><subject>Phase locked loops ; Pipelines ; Vehicles</subject><ispartof>IECON 2012 - 38th Annual Conference on IEEE Industrial Electronics Society, 2012, p.6126-6131</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6389079$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6389079$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Dezani, H.</creatorcontrib><creatorcontrib>Gomes, L.</creatorcontrib><creatorcontrib>Damiani, F.</creatorcontrib><creatorcontrib>Marranghello, N.</creatorcontrib><title>Finding best urban routes based on analyses of high level and IOPT Petri net models</title><title>IECON 2012 - 38th Annual Conference on IEEE Industrial Electronics Society</title><addtitle>IECON</addtitle><description>This paper presents a tool that combines two kinds of Petri Net analyses to set the fastest routes to one vehicle in a bounded area of traffic urban. The first analysis consists of the discovery of possible routes in a state space generated from an IOPT Petri net model given the initial marking as the vehicle position. The second analysis receives the routes found in the first analysis and calculates the state equations at incidence matrix created from the High Level Petri net model to define the fastest route for each vehicle that arrive in the roads. It was considered the exchange of information between vehicle and infrastructure (V2I) to get the position and speed of all vehicles and support the analyses. With the results obtained we conclude that is possible optimizing the urban traffic flow if this tool is applied to all vehicles in a bounded urban traffic.</description><subject>Phase locked loops</subject><subject>Pipelines</subject><subject>Vehicles</subject><issn>1553-572X</issn><isbn>9781467324199</isbn><isbn>1467324191</isbn><isbn>1467324213</isbn><isbn>9781467324205</isbn><isbn>9781467324212</isbn><isbn>1467324205</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotkNFKwzAYRiMqOGdfQG_yAq35k6ZJLqVsOhhu4ATvRtL-2SJdK00n7O0t2KvDORffxUfII7AMgJnn1aLcvGecAc8KoQ1T5orcQ14owXMO4pokRunJwZgbMgMpRSoV_7ojSYzfjDEAnouCzcjHMrR1aA_UYRzouXe2pX13HjBSZyPWtGupbW1ziWPpPD2Gw5E2-IvNmGu62mx3dItDH2iLAz11NTbxgdx620RMJs7J53KxK9_S9eZ1Vb6s0wBKDqmzOle-sLLSmpmRroDKS8yl4GMExzTWta-sljCayoVTQijJBPMeKxRz8vS_GxBx_9OHk-0v--kT8QeeqFMh</recordid><startdate>201210</startdate><enddate>201210</enddate><creator>Dezani, H.</creator><creator>Gomes, L.</creator><creator>Damiani, F.</creator><creator>Marranghello, N.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201210</creationdate><title>Finding best urban routes based on analyses of high level and IOPT Petri net models</title><author>Dezani, H. ; Gomes, L. ; Damiani, F. ; Marranghello, N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-ba847f6a5c88096a5b61cf5e4532a5c1b08eddfca851c1b743b73375030ffece3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Phase locked loops</topic><topic>Pipelines</topic><topic>Vehicles</topic><toplevel>online_resources</toplevel><creatorcontrib>Dezani, H.</creatorcontrib><creatorcontrib>Gomes, L.</creatorcontrib><creatorcontrib>Damiani, F.</creatorcontrib><creatorcontrib>Marranghello, N.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Dezani, H.</au><au>Gomes, L.</au><au>Damiani, F.</au><au>Marranghello, N.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Finding best urban routes based on analyses of high level and IOPT Petri net models</atitle><btitle>IECON 2012 - 38th Annual Conference on IEEE Industrial Electronics Society</btitle><stitle>IECON</stitle><date>2012-10</date><risdate>2012</risdate><spage>6126</spage><epage>6131</epage><pages>6126-6131</pages><issn>1553-572X</issn><isbn>9781467324199</isbn><isbn>1467324191</isbn><eisbn>1467324213</eisbn><eisbn>9781467324205</eisbn><eisbn>9781467324212</eisbn><eisbn>1467324205</eisbn><abstract>This paper presents a tool that combines two kinds of Petri Net analyses to set the fastest routes to one vehicle in a bounded area of traffic urban. The first analysis consists of the discovery of possible routes in a state space generated from an IOPT Petri net model given the initial marking as the vehicle position. The second analysis receives the routes found in the first analysis and calculates the state equations at incidence matrix created from the High Level Petri net model to define the fastest route for each vehicle that arrive in the roads. It was considered the exchange of information between vehicle and infrastructure (V2I) to get the position and speed of all vehicles and support the analyses. With the results obtained we conclude that is possible optimizing the urban traffic flow if this tool is applied to all vehicles in a bounded urban traffic.</abstract><pub>IEEE</pub><doi>10.1109/IECON.2012.6389079</doi><tpages>6</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1553-572X |
ispartof | IECON 2012 - 38th Annual Conference on IEEE Industrial Electronics Society, 2012, p.6126-6131 |
issn | 1553-572X |
language | eng |
recordid | cdi_ieee_primary_6389079 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Phase locked loops Pipelines Vehicles |
title | Finding best urban routes based on analyses of high level and IOPT Petri net models |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T16%3A24%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Finding%20best%20urban%20routes%20based%20on%20analyses%20of%20high%20level%20and%20IOPT%20Petri%20net%20models&rft.btitle=IECON%202012%20-%2038th%20Annual%20Conference%20on%20IEEE%20Industrial%20Electronics%20Society&rft.au=Dezani,%20H.&rft.date=2012-10&rft.spage=6126&rft.epage=6131&rft.pages=6126-6131&rft.issn=1553-572X&rft.isbn=9781467324199&rft.isbn_list=1467324191&rft_id=info:doi/10.1109/IECON.2012.6389079&rft_dat=%3Cieee_6IE%3E6389079%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1467324213&rft.eisbn_list=9781467324205&rft.eisbn_list=9781467324212&rft.eisbn_list=1467324205&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6389079&rfr_iscdi=true |