Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science最新文献

A data-driven framework to identify human-critical autonomous vehicle testing and deployment zones 一个数据驱动的框架，用于识别对人类至关重要的自动驾驶汽车测试和部署区域

Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science Pub Date : 2021-11-02 DOI: 10.1145/3486629.3490692

H. M. A. Aziz, A. Islam

引用次数: 2

Effectiveness of automated connected shuttles (ACS) during COVID-19 pandemic COVID-19大流行期间自动连接班车(ACS)的有效性

Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science Pub Date : 2021-11-02 DOI: 10.1145/3486629.3490694

Shanjeeda Akter, HM Abdul Aziz

{"title":"Effectiveness of automated connected shuttles (ACS) during COVID-19 pandemic","authors":"Shanjeeda Akter, HM Abdul Aziz","doi":"10.1145/3486629.3490694","DOIUrl":"https://doi.org/10.1145/3486629.3490694","url":null,"abstract":"The COVID-19 pandemic had significantly impacted the public transit system in most cities across the world. Factors including physical distancing, remote working, distance education, and COVID-risk perception due to exposure have contributed to reducing public transport ridership. Automated Connected shuttles (ACS) services can be an effective alternative to regular buses with substantially reduced break-out risks and efficient operations. Our goal is to assess the mobility and energy impacts of ACS deployments when deployed as a replacement of standard (human-driven) buses within the context of the COVID-19 pandemic accounting for adjustment in passenger demand and capacity. To accomplish this purpose, we used a traffic microsimulation tool---PTV VISSIM---to simulate the behavior of buses and ACS units. We designed and simulated hypothetical scenarios in a New York City, NY, network. The scenarios are designed based on different COVID-19 restrictions, and the performances are compared to measure ACS effectiveness over regular buses. The results showed that ACS units are more effective than regular buses when they operate at business-as-usual capacity. Further, ACS services are more energy-efficient during physical distancing restrictions than bus services based on the emissions and energy estimates using the EPA-MOVES tool.","PeriodicalId":263760,"journal":{"name":"Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115574106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

TrajDistLearn: learning to compute distance between trajectories TrajDistLearn:学习计算轨迹之间的距离

Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science Pub Date : 2021-11-02 DOI: 10.1145/3486629.3490693

Janit Anjaria, Hong Wei, Hao Li, Shlok Kumar Mishra, H. Samet

{"title":"TrajDistLearn: learning to compute distance between trajectories","authors":"Janit Anjaria, Hong Wei, Hao Li, Shlok Kumar Mishra, H. Samet","doi":"10.1145/3486629.3490693","DOIUrl":"https://doi.org/10.1145/3486629.3490693","url":null,"abstract":"Discovering and clustering similar trajectories is a cornerstone task for movement pattern analysis and location prediction in applications like ride-sharing, supply-chain, maps and autonomous driving. However, the existing distance computation is computationally expensive and is hard to parallelize, which makes the large-scale computation prohibitive. We propose TrajDistLearn, a unified learning-based approach for trajectory distance computation, in which the traditional point-based trajectories are converted into rasterized images, and the distance function is learned via Siamese Networks in an end-to-end way. The framework accurately learns various distance metrics for the trajectory similarity computation, including the widely used Fréchet distance, which is a computationally expensive distance metric. The efficiency gain with neural network approximation is significant. Our approach achieves at least a 3000x speed-up on GPU and a 40x speed-up on CPU in comparison with naive Fréchet distance computation. In addition, our approach's computational overhead is independent of the sampling rate of the trajectories. Extensive experiments on real-world trajectory datasets demonstrate the effectiveness and efficiency of TrajDistLearn.","PeriodicalId":263760,"journal":{"name":"Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121693883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

A study of rerouting beyond ad hoc decision making 一项超越临时决策的改道研究

Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science Pub Date : 2021-11-02 DOI: 10.1145/3486629.3490695

David Amores, E. Tanin, M. Vasardani

{"title":"A study of rerouting beyond ad hoc decision making","authors":"David Amores, E. Tanin, M. Vasardani","doi":"10.1145/3486629.3490695","DOIUrl":"https://doi.org/10.1145/3486629.3490695","url":null,"abstract":"Rerouting is needed for a number of reasons such as overcoming a road incident, recovering from a navigation error, or avoiding a difficult turn. When obtaining a reroute, there is generally no choice but to take an inconvenient reroute - e.g., an overly long one. Although rerouting is a common operation, route guidance systems consider it as nothing more than finding an alternate route when needed. Such a view misses the opportunity to anticipate potential problems with reroutes on the way. This paper proposes a different perspective for rerouting where a path's potential reroutes are computed before navigation starts. This approach has the potential to identify desirable and adverse reroute properties and, thus, guide path planning. Such analysis requires formalising the concept of reroute. However, reroutes have previously been ambiguously or minimally defined. This research introduces formal definitions of reroutes and presents computational methods for obtaining sets of reroutes in a path. Subsequently, we assess the reroutes of shortest paths by running simulations in real-life street networks. The results show that at least 15% of shortest paths have one detour that adds more than 50% of travel time to the trip. Another result shows that in congestion, taking a reroute can save up to 9 minutes in trips that should take up to 15 minutes. The paper finishes by justifying and encouraging the use of rerouting as part of navigation query processing. Thus, a path planning method can more suitably handle road incidents, navigation errors, or dynamic navigation in general.","PeriodicalId":263760,"journal":{"name":"Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124491986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Location-aware insights: a visual analytics dashboard for location-relevant self-awareness & reflection (demo paper) 位置感知洞察:与位置相关的自我意识和反思的可视化分析仪表板(演示论文)

Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science Pub Date : 2021-11-02 DOI: 10.1145/3486629.3490690

Antonios Karatzoglou

{"title":"Location-aware insights: a visual analytics dashboard for location-relevant self-awareness & reflection (demo paper)","authors":"Antonios Karatzoglou","doi":"10.1145/3486629.3490690","DOIUrl":"https://doi.org/10.1145/3486629.3490690","url":null,"abstract":"An increasingly fast-paced world and a collective sense of urgency has led to a recent rise of self-awareness methods and tools that provide users with insights into various aspects of their life. Meanwhile, recent studies associate our movement patterns and habits with our physical and mental well-being. In the light of the above, this work introduces Location-Aware Insights, a self-awareness platform that enables users to retrospectively reflect upon their whereabouts and helps them to better understand where and how they spend their precious time. In addition, our work supports users to identify \"bad\" patterns and eventually adapt their behavior towards a higher quality of life. For the purposes of achieving a deeper understanding of the users' visit patterns and promoting a healthier life style, our Insights dashboard attempts to particularly highlight factors that have been proven to affect our well-being. On one hand, this is done by utilizing an extended locations graph that goes beyond containing the typical hierarchical relations and considers additional semantic location attributes that are related with our well-being, such as in-/outdoor, green, bright, quite and open/closed spaces. On the other hand, we focus on similarly important well-being-related statistical features such as visit frequency, regularity and periodicity. Finally, the art of presentation plays a major role in the self-reflection process. For this reason, the presented demo explores a large variety of ways for presenting the generated insights back to the user.","PeriodicalId":263760,"journal":{"name":"Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science","volume":"266 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129933570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Taste variation in environmental features of bicycle routes 自行车路线环境特征的品味变化

Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science Pub Date : 2021-11-02 DOI: 10.1145/3486629.3490697

Thomas Koch, E. Dugundji

引用次数: 3

Collective shortest paths for minimizing congestion on temporal load-aware road networks 在时间负载感知的道路网络中最小化拥塞的集合最短路径

Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science Pub Date : 2021-10-19 DOI: 10.1145/3486629.3490691

Chris Conlan, Teddy Cunningham, G. Demirci, H. Ferhatosmanoğlu

{"title":"Collective shortest paths for minimizing congestion on temporal load-aware road networks","authors":"Chris Conlan, Teddy Cunningham, G. Demirci, H. Ferhatosmanoğlu","doi":"10.1145/3486629.3490691","DOIUrl":"https://doi.org/10.1145/3486629.3490691","url":null,"abstract":"Shortest path queries over graphs are usually considered as isolated tasks, where the goal is to return the shortest path for each individual query. In practice, however, such queries are typically part of a system (e.g., a road network) and their execution dynamically affects other queries and network parameters, such as the loads on edges, which in turn affects the shortest paths. We study the problem of collectively processing shortest path queries, where the objective is to optimize a collective objective, such as minimizing the overall cost. We define a temporal load-aware network that dynamically tracks expected loads while satisfying the desirable 'first in, first out' property. We develop temporal load-aware extensions of widely used shortest path algorithms, and a scalable collective routing solution that seeks to reduce system-wide congestion through dynamic path reassignment. Experiments illustrate that our collective approach to this NP-hard problem achieves improvements in a variety of performance measures, such as, i) reducing average travel times by up to 63%, ii) producing fairer suggestions across queries, and iii) distributing load across up to 97% of a city's road network capacity. The proposed approach is generalizable, which allows it to be adapted for other concurrent query processing tasks over networks.","PeriodicalId":263760,"journal":{"name":"Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114704949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Spatial data mining of public transport incidents reported in social media 社交媒体中公共交通事件的空间数据挖掘

Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science Pub Date : 2021-10-11 DOI: 10.1145/3486629.3490696

Kamil Raczycki, M. Szyma'nski, Yahor Yeliseyenka, Piotr Szyma'nski, Tomasz Kajdanowicz

{"title":"Spatial data mining of public transport incidents reported in social media","authors":"Kamil Raczycki, M. Szyma'nski, Yahor Yeliseyenka, Piotr Szyma'nski, Tomasz Kajdanowicz","doi":"10.1145/3486629.3490696","DOIUrl":"https://doi.org/10.1145/3486629.3490696","url":null,"abstract":"Public transport agencies use social media as an essential tool for communicating mobility incidents to passengers. However, while the short term, day-to-day information about transport phenomena is usually posted in social media with low latency, its availability is short term as the content is rarely made an aggregated form. Social media communication of transport phenomena usually lacks GIS annotations as most social media platforms do not allow attaching non-POI GPS coordinates to posts. As a result, the analysis of transport phenomena information is minimal. We collected three years of social media posts of a polish public transport company with user comments. Through exploration, we infer a six-class transport information typology. We successfully build an information type classifier for social media posts, detect stop names in posts, and relate them to GPS coordinates, obtaining a spatial understanding of long-term aggregated phenomena. We show that our approach enables citizen science and use it to analyze the impact of three years of infrastructure incidents on passenger mobility, and the sentiment and reaction scale towards each of the events. All these results are achieved for Polish, an under-resourced language when it comes to spatial language understanding, especially in social media contexts. To improve the situation, we released two of our annotated data sets: social media posts with incident type labels and matched stop names and social media comments with the annotated sentiment. We also opensource the experimental codebase.","PeriodicalId":263760,"journal":{"name":"Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132705783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1