Revisiting Street Intersections Using Slot-Based Systems
Identifieur interne : 000074 ( Pmc/Curation ); précédent : 000073; suivant : 000075Revisiting Street Intersections Using Slot-Based Systems
Auteurs : Remi Tachet [États-Unis] ; Paolo Santi [États-Unis, Italie] ; Stanislav Sobolevsky [États-Unis] ; Luis Ignacio Reyes-Castro [États-Unis] ; Emilio Frazzoli [États-Unis] ; Dirk Helbing [Suisse] ; Carlo Ratti [États-Unis]Source :
- PLoS ONE [ 1932-6203 ] ; 2016.
Abstract
Since their appearance at the end of the 19th century, traffic lights have been the primary mode of granting access to road intersections. Today, this centuries-old technology is challenged by advances in intelligent transportation, which are opening the way to new solutions built upon slot-based systems similar to those commonly used in aerial traffic: what we call Slot-based Intersections (SIs). Despite simulation-based evidence of the potential benefits of SIs, a comprehensive, analytical framework to compare their relative performance with traffic lights is still lacking. Here, we develop such a framework. We approach the problem in a novel way, by generalizing classical queuing theory. Having defined safety conditions, we characterize capacity and delay of SIs. In the 2-road crossing configuration, we provide a capacity-optimal SI management system. For arbitrary intersection configurations, near-optimal solutions are developed. Results theoretically show that transitioning from a traffic light system to SI has the potential of doubling capacity and significantly reducing delays. This suggests a reduction of non-linear dynamics induced by intersection bottlenecks, with positive impact on the road network. Such findings can provide transportation engineers and planners with crucial insights as they prepare to manage the transition towards a more intelligent transportation infrastructure in cities.
Url:
DOI: 10.1371/journal.pone.0149607
PubMed: 26982532
PubMed Central: 4794159
Links toward previous steps (curation, corpus...)
- to stream Pmc, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000074
Links to Exploration step
PMC:4794159Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Revisiting Street Intersections Using Slot-Based Systems</title>
<author><name sortKey="Tachet, Remi" sort="Tachet, Remi" uniqKey="Tachet R" first="Remi" last="Tachet">Remi Tachet</name>
<affiliation wicri:level="1"><nlm:aff id="aff001"><addr-line>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, United States of America</addr-line>
</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Santi, Paolo" sort="Santi, Paolo" uniqKey="Santi P" first="Paolo" last="Santi">Paolo Santi</name>
<affiliation wicri:level="1"><nlm:aff id="aff001"><addr-line>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, United States of America</addr-line>
</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><nlm:aff id="aff002"><addr-line>Istituto di Informatica e Telematica del CNR, Pisa, Italy</addr-line>
</nlm:aff>
<country xml:lang="fr">Italie</country>
<wicri:regionArea>Istituto di Informatica e Telematica del CNR, Pisa</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Sobolevsky, Stanislav" sort="Sobolevsky, Stanislav" uniqKey="Sobolevsky S" first="Stanislav" last="Sobolevsky">Stanislav Sobolevsky</name>
<affiliation wicri:level="1"><nlm:aff id="aff001"><addr-line>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, United States of America</addr-line>
</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Reyes Castro, Luis Ignacio" sort="Reyes Castro, Luis Ignacio" uniqKey="Reyes Castro L" first="Luis Ignacio" last="Reyes-Castro">Luis Ignacio Reyes-Castro</name>
<affiliation wicri:level="1"><nlm:aff id="aff003"><addr-line>Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, United States of America</addr-line>
</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Frazzoli, Emilio" sort="Frazzoli, Emilio" uniqKey="Frazzoli E" first="Emilio" last="Frazzoli">Emilio Frazzoli</name>
<affiliation wicri:level="1"><nlm:aff id="aff003"><addr-line>Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, United States of America</addr-line>
</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Helbing, Dirk" sort="Helbing, Dirk" uniqKey="Helbing D" first="Dirk" last="Helbing">Dirk Helbing</name>
<affiliation wicri:level="1"><nlm:aff id="aff004"><addr-line>ETH Zurich, Computational Social Science, Clausiusstrasse 50, CH-8092, Zurich, SWITZERLAND</addr-line>
</nlm:aff>
<country xml:lang="fr" wicri:curation="lc">Suisse</country>
<wicri:regionArea>ETH Zurich, Computational Social Science, Clausiusstrasse 50, CH-8092, Zurich</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Ratti, Carlo" sort="Ratti, Carlo" uniqKey="Ratti C" first="Carlo" last="Ratti">Carlo Ratti</name>
<affiliation wicri:level="1"><nlm:aff id="aff001"><addr-line>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, United States of America</addr-line>
</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139</wicri:regionArea>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">PMC</idno>
<idno type="pmid">26982532</idno>
<idno type="pmc">4794159</idno>
<idno type="url">http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4794159</idno>
<idno type="RBID">PMC:4794159</idno>
<idno type="doi">10.1371/journal.pone.0149607</idno>
<date when="2016">2016</date>
<idno type="wicri:Area/Pmc/Corpus">000074</idno>
<idno type="wicri:explorRef" wicri:stream="Pmc" wicri:step="Corpus" wicri:corpus="PMC">000074</idno>
<idno type="wicri:Area/Pmc/Curation">000074</idno>
<idno type="wicri:explorRef" wicri:stream="Pmc" wicri:step="Curation">000074</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a" type="main">Revisiting Street Intersections Using Slot-Based Systems</title>
<author><name sortKey="Tachet, Remi" sort="Tachet, Remi" uniqKey="Tachet R" first="Remi" last="Tachet">Remi Tachet</name>
<affiliation wicri:level="1"><nlm:aff id="aff001"><addr-line>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, United States of America</addr-line>
</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Santi, Paolo" sort="Santi, Paolo" uniqKey="Santi P" first="Paolo" last="Santi">Paolo Santi</name>
<affiliation wicri:level="1"><nlm:aff id="aff001"><addr-line>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, United States of America</addr-line>
</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><nlm:aff id="aff002"><addr-line>Istituto di Informatica e Telematica del CNR, Pisa, Italy</addr-line>
</nlm:aff>
<country xml:lang="fr">Italie</country>
<wicri:regionArea>Istituto di Informatica e Telematica del CNR, Pisa</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Sobolevsky, Stanislav" sort="Sobolevsky, Stanislav" uniqKey="Sobolevsky S" first="Stanislav" last="Sobolevsky">Stanislav Sobolevsky</name>
<affiliation wicri:level="1"><nlm:aff id="aff001"><addr-line>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, United States of America</addr-line>
</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Reyes Castro, Luis Ignacio" sort="Reyes Castro, Luis Ignacio" uniqKey="Reyes Castro L" first="Luis Ignacio" last="Reyes-Castro">Luis Ignacio Reyes-Castro</name>
<affiliation wicri:level="1"><nlm:aff id="aff003"><addr-line>Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, United States of America</addr-line>
</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Frazzoli, Emilio" sort="Frazzoli, Emilio" uniqKey="Frazzoli E" first="Emilio" last="Frazzoli">Emilio Frazzoli</name>
<affiliation wicri:level="1"><nlm:aff id="aff003"><addr-line>Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, United States of America</addr-line>
</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Helbing, Dirk" sort="Helbing, Dirk" uniqKey="Helbing D" first="Dirk" last="Helbing">Dirk Helbing</name>
<affiliation wicri:level="1"><nlm:aff id="aff004"><addr-line>ETH Zurich, Computational Social Science, Clausiusstrasse 50, CH-8092, Zurich, SWITZERLAND</addr-line>
</nlm:aff>
<country xml:lang="fr" wicri:curation="lc">Suisse</country>
<wicri:regionArea>ETH Zurich, Computational Social Science, Clausiusstrasse 50, CH-8092, Zurich</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Ratti, Carlo" sort="Ratti, Carlo" uniqKey="Ratti C" first="Carlo" last="Ratti">Carlo Ratti</name>
<affiliation wicri:level="1"><nlm:aff id="aff001"><addr-line>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, United States of America</addr-line>
</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139</wicri:regionArea>
</affiliation>
</author>
</analytic>
<series><title level="j">PLoS ONE</title>
<idno type="eISSN">1932-6203</idno>
<imprint><date when="2016">2016</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en"><p>Since their appearance at the end of the 19th century, traffic lights have been the primary mode of granting access to road intersections. Today, this centuries-old technology is challenged by advances in intelligent transportation, which are opening the way to new solutions built upon slot-based systems similar to those commonly used in aerial traffic: what we call Slot-based Intersections (SIs). Despite simulation-based evidence of the potential benefits of SIs, a comprehensive, analytical framework to compare their relative performance with traffic lights is still lacking. Here, we develop such a framework. We approach the problem in a novel way, by generalizing classical queuing theory. Having defined safety conditions, we characterize capacity and delay of SIs. In the 2-road crossing configuration, we provide a capacity-optimal SI management system. For arbitrary intersection configurations, near-optimal solutions are developed. Results theoretically show that transitioning from a traffic light system to SI has the potential of doubling capacity and significantly reducing delays. This suggests a reduction of non-linear dynamics induced by intersection bottlenecks, with positive impact on the road network. Such findings can provide transportation engineers and planners with crucial insights as they prepare to manage the transition towards a more intelligent transportation infrastructure in cities.</p>
</div>
</front>
<back><div1 type="bibliography"><listBibl><biblStruct><analytic><author><name sortKey="Gazis, D" uniqKey="Gazis D">D. Gazis</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Eichler, D" uniqKey="Eichler D">D. Eichler</name>
</author>
<author><name sortKey="Bar Gera, H" uniqKey="Bar Gera H">H. Bar-Gera</name>
</author>
<author><name sortKey="Blachman, M" uniqKey="Blachman M">M Blachman</name>
</author>
</analytic>
</biblStruct>
<biblStruct></biblStruct>
<biblStruct><analytic><author><name sortKey="Roess, R" uniqKey="Roess R">R. Roess</name>
</author>
<author><name sortKey="Prassas, E" uniqKey="Prassas E">E. Prassas</name>
</author>
<author><name sortKey="Mc Shane, W" uniqKey="Mc Shane W">W Mc Shane</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="L Mmer, S" uniqKey="L Mmer S">S. Lämmer</name>
</author>
<author><name sortKey="Helbing, D" uniqKey="Helbing D">D Helbing</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Lee, J" uniqKey="Lee J">J. Lee</name>
</author>
<author><name sortKey="Park, B" uniqKey="Park B">B Park</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Dresner, K" uniqKey="Dresner K">K. Dresner</name>
</author>
<author><name sortKey="Stone, P" uniqKey="Stone P">P Stone</name>
</author>
</analytic>
</biblStruct>
<biblStruct></biblStruct>
<biblStruct><analytic><author><name sortKey="Giridhar, A" uniqKey="Giridhar A">A. Giridhar</name>
</author>
<author><name sortKey="Kumar, P" uniqKey="Kumar P">P Kumar</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Kowshik, H" uniqKey="Kowshik H">H. Kowshik</name>
</author>
<author><name sortKey="Caveney, D" uniqKey="Caveney D">D. Caveney</name>
</author>
<author><name sortKey="Kumar, P" uniqKey="Kumar P">P Kumar</name>
</author>
</analytic>
</biblStruct>
<biblStruct></biblStruct>
<biblStruct><analytic><author><name sortKey="Kleinrock, L" uniqKey="Kleinrock L">L Kleinrock</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Heidemann, D" uniqKey="Heidemann D">D Heidemann</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Heidemann, D" uniqKey="Heidemann D">D Heidemann</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Woensel, T" uniqKey="Woensel T">T. Woensel</name>
</author>
<author><name sortKey="Vandaele, N" uniqKey="Vandaele N">N Vandaele</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Cohen, J" uniqKey="Cohen J">J Cohen</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Harris, M C" uniqKey="Harris M">M. C Harris</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Courtois, P J" uniqKey="Courtois P">P. J. Courtois</name>
</author>
<author><name sortKey="Georges, J" uniqKey="Georges J">J Georges</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Gupta, U C" uniqKey="Gupta U">U. C. Gupta</name>
</author>
<author><name sortKey="Rao, T" uniqKey="Rao T">T Rao</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Banerjee, A" uniqKey="Banerjee A">A. Banerjee</name>
</author>
<author><name sortKey="Gupta, U" uniqKey="Gupta U">U. Gupta</name>
</author>
<author><name sortKey="Goswami, V" uniqKey="Goswami V">V Goswami</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Claeys, D" uniqKey="Claeys D">D. Claeys</name>
</author>
<author><name sortKey="Steyaert, B" uniqKey="Steyaert B">B. Steyaert</name>
</author>
<author><name sortKey="Walraevens, J" uniqKey="Walraevens J">J. Walraevens</name>
</author>
<author><name sortKey="Laevens, K" uniqKey="Laevens K">K. Laevens</name>
</author>
<author><name sortKey="Bruneel, H" uniqKey="Bruneel H">H Bruneel</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Claeys, D" uniqKey="Claeys D">D. Claeys</name>
</author>
<author><name sortKey="Steyaert, B" uniqKey="Steyaert B">B. Steyaert</name>
</author>
<author><name sortKey="Walraevens, J" uniqKey="Walraevens J">J. Walraevens</name>
</author>
<author><name sortKey="Laevens, K" uniqKey="Laevens K">K. Laevens</name>
</author>
<author><name sortKey="Bruneel, H" uniqKey="Bruneel H">H Bruneel</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Van Leeuwaarden, J S H" uniqKey="Van Leeuwaarden J">J. S. H van Leeuwaarden</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Helbing, D" uniqKey="Helbing D">D Helbing</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Tang, T Q" uniqKey="Tang T">T.-Q. Tang</name>
</author>
<author><name sortKey="Li, C Y" uniqKey="Li C">C.-Y. Li</name>
</author>
<author><name sortKey="Huang, H J" uniqKey="Huang H">H.-J. Huang</name>
</author>
<author><name sortKey="Shang, H Y" uniqKey="Shang H">H.-Y Shang</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Tang, T Q" uniqKey="Tang T">T.-Q. Tang</name>
</author>
<author><name sortKey="Huang, H J" uniqKey="Huang H">H.-J. Huang</name>
</author>
<author><name sortKey="Shang, H Y" uniqKey="Shang H">H.-Y Shang</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Helbing, D" uniqKey="Helbing D">D. Helbing</name>
</author>
<author><name sortKey="Farkas, I" uniqKey="Farkas I">I. Farkas</name>
</author>
<author><name sortKey="Vicsek, T" uniqKey="Vicsek T">T Vicsek</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Helbing, D" uniqKey="Helbing D">D. Helbing</name>
</author>
<author><name sortKey="Seidel, T" uniqKey="Seidel T">T. Seidel</name>
</author>
<author><name sortKey="L Mmer, S" uniqKey="L Mmer S">S. Lämmer</name>
</author>
<author><name sortKey="Peters, K" uniqKey="Peters K">K Peters</name>
</author>
<author><name sortKey="Chakrabarti, B K" uniqKey="Chakrabarti B">B. K Chakrabarti</name>
</author>
</analytic>
</biblStruct>
</listBibl>
</div1>
</back>
</TEI>
<pmc article-type="research-article"><pmc-dir>properties open_access</pmc-dir>
<front><journal-meta><journal-id journal-id-type="nlm-ta">PLoS One</journal-id>
<journal-id journal-id-type="iso-abbrev">PLoS ONE</journal-id>
<journal-id journal-id-type="publisher-id">plos</journal-id>
<journal-id journal-id-type="pmc">plosone</journal-id>
<journal-title-group><journal-title>PLoS ONE</journal-title>
</journal-title-group>
<issn pub-type="epub">1932-6203</issn>
<publisher><publisher-name>Public Library of Science</publisher-name>
<publisher-loc>San Francisco, CA USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta><article-id pub-id-type="pmid">26982532</article-id>
<article-id pub-id-type="pmc">4794159</article-id>
<article-id pub-id-type="publisher-id">PONE-D-15-47454</article-id>
<article-id pub-id-type="doi">10.1371/journal.pone.0149607</article-id>
<article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Engineering and Technology</subject>
<subj-group><subject>Civil Engineering</subject>
<subj-group><subject>Transportation Infrastructure</subject>
<subj-group><subject>Roads</subject>
</subj-group>
</subj-group>
</subj-group>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Engineering and Technology</subject>
<subj-group><subject>Transportation</subject>
<subj-group><subject>Transportation Infrastructure</subject>
<subj-group><subject>Roads</subject>
</subj-group>
</subj-group>
</subj-group>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Engineering and Technology</subject>
<subj-group><subject>Transportation</subject>
</subj-group>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Computer and Information Sciences</subject>
<subj-group><subject>Systems Science</subject>
<subj-group><subject>Nonlinear Dynamics</subject>
</subj-group>
</subj-group>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Physical Sciences</subject>
<subj-group><subject>Mathematics</subject>
<subj-group><subject>Systems Science</subject>
<subj-group><subject>Nonlinear Dynamics</subject>
</subj-group>
</subj-group>
</subj-group>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Engineering and Technology</subject>
<subj-group><subject>Telecommunications</subject>
</subj-group>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Biology and Life Sciences</subject>
<subj-group><subject>Neuroscience</subject>
<subj-group><subject>Cognitive Science</subject>
<subj-group><subject>Cognitive Psychology</subject>
<subj-group><subject>Intelligence</subject>
</subj-group>
</subj-group>
</subj-group>
</subj-group>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Biology and Life Sciences</subject>
<subj-group><subject>Psychology</subject>
<subj-group><subject>Cognitive Psychology</subject>
<subj-group><subject>Intelligence</subject>
</subj-group>
</subj-group>
</subj-group>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Social Sciences</subject>
<subj-group><subject>Psychology</subject>
<subj-group><subject>Cognitive Psychology</subject>
<subj-group><subject>Intelligence</subject>
</subj-group>
</subj-group>
</subj-group>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Engineering and Technology</subject>
<subj-group><subject>Civil Engineering</subject>
<subj-group><subject>Transportation Infrastructure</subject>
</subj-group>
</subj-group>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Engineering and Technology</subject>
<subj-group><subject>Transportation</subject>
<subj-group><subject>Transportation Infrastructure</subject>
</subj-group>
</subj-group>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Engineering and Technology</subject>
<subj-group><subject>Control Engineering</subject>
<subj-group><subject>Control Systems</subject>
</subj-group>
</subj-group>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Computer and Information Sciences</subject>
<subj-group><subject>Systems Science</subject>
<subj-group><subject>Control Systems</subject>
</subj-group>
</subj-group>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Physical Sciences</subject>
<subj-group><subject>Mathematics</subject>
<subj-group><subject>Systems Science</subject>
<subj-group><subject>Control Systems</subject>
</subj-group>
</subj-group>
</subj-group>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Physical Sciences</subject>
<subj-group><subject>Mathematics</subject>
<subj-group><subject>Applied Mathematics</subject>
<subj-group><subject>Algorithms</subject>
</subj-group>
</subj-group>
</subj-group>
</subj-group>
<subj-group subj-group-type="Discipline-v3"><subject>Research and Analysis Methods</subject>
<subj-group><subject>Simulation and Modeling</subject>
<subj-group><subject>Algorithms</subject>
</subj-group>
</subj-group>
</subj-group>
</article-categories>
<title-group><article-title>Revisiting Street Intersections Using Slot-Based Systems</article-title>
<alt-title alt-title-type="running-head">Street Intersections with Slot-Based Systems</alt-title>
</title-group>
<contrib-group><contrib contrib-type="author"><name><surname>Tachet</surname>
<given-names>Remi</given-names>
</name>
<xref ref-type="aff" rid="aff001"><sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author"><name><surname>Santi</surname>
<given-names>Paolo</given-names>
</name>
<xref ref-type="aff" rid="aff001"><sup>1</sup>
</xref>
<xref ref-type="aff" rid="aff002"><sup>2</sup>
</xref>
<xref ref-type="corresp" rid="cor001">*</xref>
</contrib>
<contrib contrib-type="author"><name><surname>Sobolevsky</surname>
<given-names>Stanislav</given-names>
</name>
<xref ref-type="aff" rid="aff001"><sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author"><name><surname>Reyes-Castro</surname>
<given-names>Luis Ignacio</given-names>
</name>
<xref ref-type="aff" rid="aff003"><sup>3</sup>
</xref>
</contrib>
<contrib contrib-type="author"><name><surname>Frazzoli</surname>
<given-names>Emilio</given-names>
</name>
<xref ref-type="aff" rid="aff003"><sup>3</sup>
</xref>
</contrib>
<contrib contrib-type="author"><name><surname>Helbing</surname>
<given-names>Dirk</given-names>
</name>
<xref ref-type="aff" rid="aff004"><sup>4</sup>
</xref>
</contrib>
<contrib contrib-type="author"><name><surname>Ratti</surname>
<given-names>Carlo</given-names>
</name>
<xref ref-type="aff" rid="aff001"><sup>1</sup>
</xref>
</contrib>
</contrib-group>
<aff id="aff001"><label>1</label>
<addr-line>Senseable City Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, United States of America</addr-line>
</aff>
<aff id="aff002"><label>2</label>
<addr-line>Istituto di Informatica e Telematica del CNR, Pisa, Italy</addr-line>
</aff>
<aff id="aff003"><label>3</label>
<addr-line>Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, United States of America</addr-line>
</aff>
<aff id="aff004"><label>4</label>
<addr-line>ETH Zurich, Computational Social Science, Clausiusstrasse 50, CH-8092, Zurich, SWITZERLAND</addr-line>
</aff>
<contrib-group><contrib contrib-type="editor"><name><surname>Tang</surname>
<given-names>Tieqiao</given-names>
</name>
<role>Editor</role>
<xref ref-type="aff" rid="edit1"></xref>
</contrib>
</contrib-group>
<aff id="edit1"><addr-line>Beihang University, CHINA</addr-line>
</aff>
<author-notes><fn fn-type="conflict" id="coi001"><p><bold>Competing Interests: </bold>
The authors have declared that no competing interests exist.</p>
</fn>
<fn fn-type="con" id="contrib001"><p>Defined the SI management algorithms, performed the analysis, and contributed to writing: RT. Designed the research, defined the SI management algorithms, contributed to the analysis and writing: PS. Contributed to the design of the SI management algorithms: SS. Contributed to the analysis of traffic light systems: LRC. Designed the research: EF. Contributed to writing: DH. Designed the research and contributed to writing: CR.</p>
</fn>
<corresp id="cor001">* E-mail: <email>psanti@mit.edu</email>
</corresp>
</author-notes>
<pub-date pub-type="collection"><year>2016</year>
</pub-date>
<pub-date pub-type="epub"><day>16</day>
<month>3</month>
<year>2016</year>
</pub-date>
<volume>11</volume>
<issue>3</issue>
<elocation-id>e0149607</elocation-id>
<history><date date-type="received"><day>29</day>
<month>10</month>
<year>2015</year>
</date>
<date date-type="accepted"><day>3</day>
<month>2</month>
<year>2016</year>
</date>
</history>
<permissions><copyright-statement>© 2016 Tachet et al</copyright-statement>
<copyright-year>2016</copyright-year>
<copyright-holder>Tachet et al</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><license-p>This is an open access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution License</ext-link>
, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:type="simple" xlink:href="pone.0149607.pdf"></self-uri>
<abstract><p>Since their appearance at the end of the 19th century, traffic lights have been the primary mode of granting access to road intersections. Today, this centuries-old technology is challenged by advances in intelligent transportation, which are opening the way to new solutions built upon slot-based systems similar to those commonly used in aerial traffic: what we call Slot-based Intersections (SIs). Despite simulation-based evidence of the potential benefits of SIs, a comprehensive, analytical framework to compare their relative performance with traffic lights is still lacking. Here, we develop such a framework. We approach the problem in a novel way, by generalizing classical queuing theory. Having defined safety conditions, we characterize capacity and delay of SIs. In the 2-road crossing configuration, we provide a capacity-optimal SI management system. For arbitrary intersection configurations, near-optimal solutions are developed. Results theoretically show that transitioning from a traffic light system to SI has the potential of doubling capacity and significantly reducing delays. This suggests a reduction of non-linear dynamics induced by intersection bottlenecks, with positive impact on the road network. Such findings can provide transportation engineers and planners with crucial insights as they prepare to manage the transition towards a more intelligent transportation infrastructure in cities.</p>
</abstract>
<funding-group><funding-statement>The authors have no support or funding to report.</funding-statement>
</funding-group>
<counts><fig-count count="3"></fig-count>
<table-count count="1"></table-count>
<page-count count="9"></page-count>
</counts>
<custom-meta-group><custom-meta id="data-availability"><meta-name>Data Availability</meta-name>
<meta-value>A GPS dataset of taxi traces was used in the supplementary information of this paper for a noonessential result (estimating the trajectory mix at a singaporean intersection). As a Non Disclosure Agreement protects this data, we cannot make the entire data set public. However, in compliance with PLOS ONE data access policy, a subset of the traces, sufficient to replicate our analysis, will be made available upon request.</meta-value>
</custom-meta>
</custom-meta-group>
</article-meta>
<notes><title>Data Availability</title>
<p>A GPS dataset of taxi traces was used in the supplementary information of this paper for a noonessential result (estimating the trajectory mix at a singaporean intersection). As a Non Disclosure Agreement protects this data, we cannot make the entire data set public. However, in compliance with PLOS ONE data access policy, a subset of the traces, sufficient to replicate our analysis, will be made available upon request.</p>
</notes>
</front>
</pmc>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Pmc/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000074 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Pmc/Curation/biblio.hfd -nk 000074 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Ticri/CIDE |area= TelematiV1 |flux= Pmc |étape= Curation |type= RBID |clé= PMC:4794159 |texte= Revisiting Street Intersections Using Slot-Based Systems }}
Pour générer des pages wiki
HfdIndexSelect -h $EXPLOR_AREA/Data/Pmc/Curation/RBID.i -Sk "pubmed:26982532" \ | HfdSelect -Kh $EXPLOR_AREA/Data/Pmc/Curation/biblio.hfd \ | NlmPubMed2Wicri -a TelematiV1
![]() | This area was generated with Dilib version V0.6.31. | ![]() |