首页 > 最新文献

Journal of Intelligent Transportation Systems最新文献

英文 中文
Unified strategy for cooperative optimization of pedestrian control patterns and signal timing plans at intersections 交叉口行人控制模式和信号配时计划合作优化的统一策略
IF 3.6 3区 工程技术 Q3 TRANSPORTATION Pub Date : 2024-01-23 DOI: 10.1080/15472450.2024.2307026
Jiawen Wang, Yudi Zhang, Jing Zhao, Chunjian Shang, Xinwei Wang
Pedestrian traffic management and control at intersections is crucial for ensuring traffic safety and efficiency while promoting green transportation development. Numerous studies have been conduct...
交叉口的行人交通管理和控制对于确保交通安全和效率,同时促进绿色交通发展至关重要。已有大量研究表明,在交叉路口进行行人交通管理和控制,不仅能确保交通安全和效率,还能促进绿色交通发展。
{"title":"Unified strategy for cooperative optimization of pedestrian control patterns and signal timing plans at intersections","authors":"Jiawen Wang, Yudi Zhang, Jing Zhao, Chunjian Shang, Xinwei Wang","doi":"10.1080/15472450.2024.2307026","DOIUrl":"https://doi.org/10.1080/15472450.2024.2307026","url":null,"abstract":"Pedestrian traffic management and control at intersections is crucial for ensuring traffic safety and efficiency while promoting green transportation development. Numerous studies have been conduct...","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"38 1","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139561759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Data-driven transfer learning framework for estimating on-ramp and off-ramp traffic flows 用于估算匝道和非匝道交通流量的数据驱动迁移学习框架
IF 3.6 3区 工程技术 Q3 TRANSPORTATION Pub Date : 2024-01-15 DOI: 10.1080/15472450.2023.2301696
Xiaobo Ma, Abolfazl Karimpour, Yao-Jan Wu
To develop the most appropriate control strategy and monitor, maintain, and evaluate the traffic performance of the freeway weaving areas, state and local Departments of Transportation need to have...
为了制定最合适的控制策略,监测、维护和评估高速公路交织区的交通性能,各州和地方交通部门需要...
{"title":"Data-driven transfer learning framework for estimating on-ramp and off-ramp traffic flows","authors":"Xiaobo Ma, Abolfazl Karimpour, Yao-Jan Wu","doi":"10.1080/15472450.2023.2301696","DOIUrl":"https://doi.org/10.1080/15472450.2023.2301696","url":null,"abstract":"To develop the most appropriate control strategy and monitor, maintain, and evaluate the traffic performance of the freeway weaving areas, state and local Departments of Transportation need to have...","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"2 1","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139470605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reliability-based journey time prediction via two-stream deep learning with multi-source data 通过多源数据的双流深度学习进行基于可靠性的行程时间预测
IF 3.6 3区 工程技术 Q3 TRANSPORTATION Pub Date : 2024-01-10 DOI: 10.1080/15472450.2023.2301707
Li Zhuang, Xinyue Wu, Andy H. F. Chow, Wei Ma, William H.K Lam, S. C. Wong
This paper presents a distribution-free reliability-based prediction approach for estimating journey time intervals with multi-source data using a two-stream deep learning framework. The prediction...
本文介绍了一种基于无分布可靠性的预测方法,该方法利用双流深度学习框架,通过多源数据估算行程时间间隔。预测...
{"title":"Reliability-based journey time prediction via two-stream deep learning with multi-source data","authors":"Li Zhuang, Xinyue Wu, Andy H. F. Chow, Wei Ma, William H.K Lam, S. C. Wong","doi":"10.1080/15472450.2023.2301707","DOIUrl":"https://doi.org/10.1080/15472450.2023.2301707","url":null,"abstract":"This paper presents a distribution-free reliability-based prediction approach for estimating journey time intervals with multi-source data using a two-stream deep learning framework. The prediction...","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"54 1","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139463577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A cooperative longitudinal lane-changing distributions advisory for a freeway weaving segment 高速公路交织路段的合作式纵向变道分布提示
IF 3.6 3区 工程技术 Q3 TRANSPORTATION Pub Date : 2024-01-10 DOI: 10.1080/15472450.2023.2301705
Meng Long, Edward Chung, David Sulejic, Nasser R. Sabar
The lane-changing (LC) concentration problem in freeway weaving segments poses crash risks and reduces freeway efficiency. To address this issue, this paper proposes a cooperative longitudinal LC d...
高速公路交织路段的变道(LC)集中问题会带来碰撞风险并降低高速公路效率。为解决这一问题,本文提出了一种合作式纵向变道(LC)控制方法。
{"title":"A cooperative longitudinal lane-changing distributions advisory for a freeway weaving segment","authors":"Meng Long, Edward Chung, David Sulejic, Nasser R. Sabar","doi":"10.1080/15472450.2023.2301705","DOIUrl":"https://doi.org/10.1080/15472450.2023.2301705","url":null,"abstract":"The lane-changing (LC) concentration problem in freeway weaving segments poses crash risks and reduces freeway efficiency. To address this issue, this paper proposes a cooperative longitudinal LC d...","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"55 1","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139463461","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Exploring traffic breakdown with vehicle-level data 利用车辆级数据探索交通细分
IF 3.6 3区 工程技术 Q3 TRANSPORTATION Pub Date : 2024-01-08 DOI: 10.1080/15472450.2023.2301710
Youngjun Han, Jinhak Lee
Traffic breakdown involves complicated vehicle behavior, and is regarded as a probabilistic event with macroscopic traffic data from fixed detectors. However, with the advent of connected vehicle t...
交通故障涉及复杂的车辆行为,通过固定检测器获得的宏观交通数据被视为概率事件。然而,随着车联网技术的出现,交通故障被视为一种概率事件。
{"title":"Exploring traffic breakdown with vehicle-level data","authors":"Youngjun Han, Jinhak Lee","doi":"10.1080/15472450.2023.2301710","DOIUrl":"https://doi.org/10.1080/15472450.2023.2301710","url":null,"abstract":"Traffic breakdown involves complicated vehicle behavior, and is regarded as a probabilistic event with macroscopic traffic data from fixed detectors. However, with the advent of connected vehicle t...","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"41 1","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139396228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multiagent reinforcement learning for autonomous driving in traffic zones with unsignalized intersections 在设有无信号交叉路口的交通区域进行多代理强化学习以实现自动驾驶
IF 3.6 3区 工程技术 Q3 TRANSPORTATION Pub Date : 2024-01-02 DOI: 10.1080/15472450.2022.2109416
Christos Spatharis , Konstantinos Blekas

In this work we present a multiagent deep reinforcement learning approach for autonomous driving vehicles that is able to operate in traffic networks with unsignalized intersections. The key aspects of the proposed study are the introduction of route-agents as the main building block of the system, as well as a collision term that allows the cooperation among vehicles and the construction of an efficient reward function. These have the advantage of establishing an enhanced collaborative multiagent deep reinforcement learning scheme that manages to control multiple vehicles and navigate them safely and efficiently-economically to their destination. In addition, it provides the beneficial flexibility to lay down a platform for transfer learning and reusing knowledge from the agents’ policies in handling unknown traffic scenarios. We provide several experimental results in simulated road traffic networks of variable complexity and diverse characteristics using the SUMO environment that empirically illustrate the efficiency of the proposed multiagent framework.

在这项研究中,我们提出了一种适用于自动驾驶车辆的多代理深度强化学习方法,该方法能够在无信号交叉路口的交通网络中运行。所提研究的主要方面是引入路线代理作为系统的主要构件,以及允许车辆间合作的碰撞项和构建有效的奖励函数。这些优势在于建立了一个增强型多代理协作深度强化学习方案,该方案能够控制多辆车,并安全、高效、经济地将它们导航到目的地。此外,它还提供了有益的灵活性,为处理未知交通场景时从代理策略中转移学习和重复使用知识奠定了平台。我们利用 SUMO 环境模拟了复杂程度不同、特征各异的道路交通网络,并提供了若干实验结果,从经验上说明了所提出的多代理框架的效率。
{"title":"Multiagent reinforcement learning for autonomous driving in traffic zones with unsignalized intersections","authors":"Christos Spatharis ,&nbsp;Konstantinos Blekas","doi":"10.1080/15472450.2022.2109416","DOIUrl":"10.1080/15472450.2022.2109416","url":null,"abstract":"<div><p>In this work we present a multiagent deep reinforcement learning approach for autonomous driving vehicles that is able to operate in traffic networks with unsignalized intersections. The key aspects of the proposed study are the introduction of route-agents as the main building block of the system, as well as a collision term that allows the cooperation among vehicles and the construction of an efficient reward function. These have the advantage of establishing an enhanced collaborative multiagent deep reinforcement learning scheme that manages to control multiple vehicles and navigate them safely and efficiently-economically to their destination. In addition, it provides the beneficial flexibility to lay down a platform for transfer learning and reusing knowledge from the agents’ policies in handling unknown traffic scenarios. We provide several experimental results in simulated road traffic networks of variable complexity and diverse characteristics using the SUMO environment that empirically illustrate the efficiency of the proposed multiagent framework.</p></div>","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"28 1","pages":"Pages 103-119"},"PeriodicalIF":3.6,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82061008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Glocal map-matching algorithm for high-frequency and large-scale GPS data 高频和大规模 GPS 数据的局部地图匹配算法
IF 3.6 3区 工程技术 Q3 TRANSPORTATION Pub Date : 2024-01-02 DOI: 10.1080/15472450.2022.2086805
Yuanfang Zhu , Meilan Jiang , Toshiyuki Yamamoto

The global positioning system (GPS) trajectory data are extensively utilized in various fields, such as driving behavior analysis, vehicle navigation systems, and traffic management. GPS sensors installed in numerous driving recorders and smartphones facilitate data collection on a large-scale in a high-frequency manner. Therefore, map-matching algorithms are indispensable to identify the GPS trajectories on a road network. Although the local map-matching algorithm reduces computation time, it lacks sufficient accuracy. Conversely, the global map-matching algorithm enhances matching accuracy; however, the computations are time consuming in the case of large-scale data. Therefore, this study proposes a method to improve the accuracy of the local map-matching algorithm without affecting its efficiency. The proposed method first executes the incremental map-matching algorithm. It then identifies the mismatching links in the results based on the connectivity of the links. Finally, the shortest path algorithm and the longest common subsequence are used to correct these error links. An elderly driver’s driving recorder data were used to conduct the experiment to compare the proposed method with four state-of-the-art map-matching algorithms in terms of accuracy and efficiency. The experimental results indicate that the proposed method can significantly increase the accuracy and efficiency of the map-matching process when considering high-frequency and large-scale data. Particularly, compared with the two-benchmark global map-matching algorithms, the proposed method can reduce the error rate of map-matching by nearly half, only consuming 18% and 58% of the computation time of the two global algorithms, respectively.

全球定位系统(GPS)轨迹数据被广泛应用于驾驶行为分析、车辆导航系统和交通管理等多个领域。安装在众多行车记录仪和智能手机中的 GPS 传感器有助于大规模、高频率地收集数据。因此,地图匹配算法对于识别道路网络中的 GPS 轨迹是不可或缺的。局部地图匹配算法虽然可以减少计算时间,但缺乏足够的准确性。相反,全局地图匹配算法提高了匹配精度,但在大规模数据的情况下计算耗时。因此,本研究提出了一种在不影响局部地图匹配算法效率的前提下提高其精确度的方法。建议的方法首先执行增量地图匹配算法。然后,根据链接的连通性识别结果中不匹配的链接。最后,使用最短路径算法和最长公共子序列来纠正这些错误链接。实验使用了一位老年司机的行车记录仪数据,从准确性和效率方面比较了所提出的方法和四种最先进的地图匹配算法。实验结果表明,在考虑高频和大规模数据时,所提出的方法能显著提高地图匹配过程的准确性和效率。特别是,与两种基准全局地图匹配算法相比,本文提出的方法能将地图匹配的错误率降低近一半,计算时间分别仅为两种全局算法的 18% 和 58%。
{"title":"Glocal map-matching algorithm for high-frequency and large-scale GPS data","authors":"Yuanfang Zhu ,&nbsp;Meilan Jiang ,&nbsp;Toshiyuki Yamamoto","doi":"10.1080/15472450.2022.2086805","DOIUrl":"10.1080/15472450.2022.2086805","url":null,"abstract":"<div><p>The global positioning system (GPS) trajectory data are extensively utilized in various fields, such as driving behavior analysis, vehicle navigation systems, and traffic management. GPS sensors installed in numerous driving recorders and smartphones facilitate data collection on a large-scale in a high-frequency manner. Therefore, map-matching algorithms are indispensable to identify the GPS trajectories on a road network. Although the local map-matching algorithm reduces computation time, it lacks sufficient accuracy. Conversely, the global map-matching algorithm enhances matching accuracy; however, the computations are time consuming in the case of large-scale data. Therefore, this study proposes a method to improve the accuracy of the local map-matching algorithm without affecting its efficiency. The proposed method first executes the incremental map-matching algorithm. It then identifies the mismatching links in the results based on the connectivity of the links. Finally, the shortest path algorithm and the longest common subsequence are used to correct these error links. An elderly driver’s driving recorder data were used to conduct the experiment to compare the proposed method with four state-of-the-art map-matching algorithms in terms of accuracy and efficiency. The experimental results indicate that the proposed method can significantly increase the accuracy and efficiency of the map-matching process when considering high-frequency and large-scale data. Particularly, compared with the two-benchmark global map-matching algorithms, the proposed method can reduce the error rate of map-matching by nearly half, only consuming 18% and 58% of the computation time of the two global algorithms, respectively.</p></div>","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"28 1","pages":"Pages 1-15"},"PeriodicalIF":3.6,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90709378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A ridesharing simulation model that considers dynamic supply-demand interactions 考虑动态供需互动的共享乘车模拟模型
IF 3.6 3区 工程技术 Q3 TRANSPORTATION Pub Date : 2024-01-02 DOI: 10.1080/15472450.2022.2098730
Rui Yao , Shlomo Bekhor

This paper presents a new ridesharing simulation model that accounts for dynamic driver supply and passenger demand, and complex interactions between drivers and passengers. The proposed simulation model explicitly considers driver and passenger acceptance/rejection on the matching options, and cancelation before/after being matched. New simulation events, procedures and modules have been developed to handle these realistic interactions. Ridesharing pricing bounds that result in high matching option accept rate are derived. The capabilities of the simulation model are illustrated using numerical experiments. The experiments confirm the importance of considering supply and demand interactions and provide new insights to ridesharing operations. Results show that higher prices are needed to attract drivers with short trip durations to participate in ridesharing, and larger matching window could have negative impacts on overall ridesharing success rate. Comparison results further illustrate that the proposed simulation model is able to replicate the predefined “true” success rate, in the cases that driver and passenger interactions occur.

本文提出了一种新的共享出行仿真模型,该模型考虑了动态的司机供应和乘客需求,以及司机和乘客之间复杂的互动关系。所提出的仿真模型明确考虑了司机和乘客对匹配选项的接受/拒绝,以及匹配前/后的取消。我们开发了新的模拟事件、程序和模块,以处理这些现实的互动。推导出了导致高匹配选项接受率的共享乘车定价边界。模拟模型的功能通过数值实验进行了说明。实验证实了考虑供需互动的重要性,并为共享出行的运营提供了新的见解。实验结果表明,需要更高的价格才能吸引行程时间较短的司机参与共享单车,而更大的匹配窗口可能会对共享单车的总体成功率产生负面影响。比较结果进一步说明,在司机和乘客发生互动的情况下,所提出的模拟模型能够复制预定义的 "真实 "成功率。
{"title":"A ridesharing simulation model that considers dynamic supply-demand interactions","authors":"Rui Yao ,&nbsp;Shlomo Bekhor","doi":"10.1080/15472450.2022.2098730","DOIUrl":"10.1080/15472450.2022.2098730","url":null,"abstract":"<div><p>This paper presents a new ridesharing simulation model that accounts for dynamic driver supply and passenger demand, and complex interactions between drivers and passengers. The proposed simulation model explicitly considers driver and passenger acceptance/rejection on the matching options, and cancelation before/after being matched. New simulation events, procedures and modules have been developed to handle these realistic interactions. Ridesharing pricing bounds that result in high matching option accept rate are derived. The capabilities of the simulation model are illustrated using numerical experiments. The experiments confirm the importance of considering supply and demand interactions and provide new insights to ridesharing operations. Results show that higher prices are needed to attract drivers with short trip durations to participate in ridesharing, and larger matching window could have negative impacts on overall ridesharing success rate. Comparison results further illustrate that the proposed simulation model is able to replicate the predefined “true” success rate, in the cases that driver and passenger interactions occur.</p></div>","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"28 1","pages":"Pages 31-53"},"PeriodicalIF":3.6,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84768756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A robust machine learning structure for driving events recognition using smartphone motion sensors 利用智能手机运动传感器识别驾驶事件的稳健机器学习结构
IF 3.6 3区 工程技术 Q3 TRANSPORTATION Pub Date : 2024-01-02 DOI: 10.1080/15472450.2022.2101109
Mahdi Zarei Yazd , Iman Taheri Sarteshnizi , Amir Samimi , Majid Sarvi

Driving behavior monitoring by smartphone sensors is one of the most investigated approaches to ameliorate road safety. Various methods are adopted in the literature; however, to the best of our knowledge, their robustness to the prediction of new unseen data from different drivers and road conditions is not explored. In this paper, a two-phase Machine Learning (ML) method with taking advantage of high-pass, low-pass, and wavelet filters is developed to detect driving brakes and turns. In the first phase, accelerometer and gyroscope filtered time series are fed into Random Forest and Artificial Neural Network classifiers, and the suspicious intervals are extracted by a high recall. Following that, in the next phase, statistical features calculated based on the obtained intervals are used to determine the false and true positive events. To compare the predicted and real labels of the recorded events and calculate the accuracy, a method that covers the limitations of previous sliding windows is also employed. Real-world experimental result shows that the proposed method can predict new unseen datasets with average F1-scores of 71% in brake detection and 82% in turn detection which is comparable with previous works. Moreover, by sensitivity analysis of our proposed model, it is proven that implementing high-pass and low-pass filters can affect the accuracy for turn detection up to 30%.

通过智能手机传感器监测驾驶行为是改善道路安全的最有效方法之一。文献中采用了多种方法,但据我们所知,这些方法对于预测来自不同驾驶员和不同路况的新的未见数据的鲁棒性尚未得到探讨。本文开发了一种两阶段机器学习(ML)方法,利用高通、低通和小波滤波器的优势来检测驾驶刹车和转弯。在第一阶段,将加速度计和陀螺仪滤波后的时间序列输入随机森林和人工神经网络分类器,并通过高召回率提取可疑区间。随后,在下一阶段,根据所获得的时间间隔计算出的统计特征将用于确定假阳性事件和真阳性事件。为了比较记录事件的预测标签和真实标签并计算准确率,还采用了一种方法来弥补之前滑动窗口的局限性。真实世界的实验结果表明,所提出的方法可以预测新的未见数据集,在制动检测和转弯检测中的平均 F1 分数分别为 71% 和 82%,与之前的工作不相上下。此外,通过对我们提出的模型进行灵敏度分析,证明采用高通和低通滤波器会对转弯检测的准确性产生高达 30% 的影响。
{"title":"A robust machine learning structure for driving events recognition using smartphone motion sensors","authors":"Mahdi Zarei Yazd ,&nbsp;Iman Taheri Sarteshnizi ,&nbsp;Amir Samimi ,&nbsp;Majid Sarvi","doi":"10.1080/15472450.2022.2101109","DOIUrl":"10.1080/15472450.2022.2101109","url":null,"abstract":"<div><p>Driving behavior monitoring by smartphone sensors is one of the most investigated approaches to ameliorate road safety. Various methods are adopted in the literature; however, to the best of our knowledge, their robustness to the prediction of new unseen data from different drivers and road conditions is not explored. In this paper, a two-phase Machine Learning (ML) method with taking advantage of high-pass, low-pass, and wavelet filters is developed to detect driving brakes and turns. In the first phase, accelerometer and gyroscope filtered time series are fed into Random Forest and Artificial Neural Network classifiers, and the suspicious intervals are extracted by a high recall. Following that, in the next phase, statistical features calculated based on the obtained intervals are used to determine the false and true positive events. To compare the predicted and real labels of the recorded events and calculate the accuracy, a method that covers the limitations of previous sliding windows is also employed. Real-world experimental result shows that the proposed method can predict new unseen datasets with average F1-scores of 71% in brake detection and 82% in turn detection which is comparable with previous works. Moreover, by sensitivity analysis of our proposed model, it is proven that implementing high-pass and low-pass filters can affect the accuracy for turn detection up to 30%.</p></div>","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"28 1","pages":"Pages 54-68"},"PeriodicalIF":3.6,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79452237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Operation of dedicated lanes with intermittent priority on highways: conceptual development and simulation validation 高速公路上具有间歇优先权的专用车道的运行:概念开发和模拟验证
IF 3.6 3区 工程技术 Q3 TRANSPORTATION Pub Date : 2024-01-02 DOI: 10.1080/15472450.2022.2101110
Yinghao Shao , Jian Sun , Yuheng Kan , Ye Tian

Dedicated Lanes (DLs) have become prevalent on highways and arterial roads as they help accelerate carpooling vehicles or buses. However, capacity is wasted if the penetration rates of these vehicles with priority are low. Wasted capacity can be utilized optimally by implementing Vehicle-to-Everything (V2X) technology and granting General-Purpose (GP) vehicles the ability to traverse on DLs. However, existing research on flexible DLs has mostly focused on preset, static operating rules. In this study, we propose a true, active DL management strategy named Dedicated Lane with Intermittent Priority (DLIP) that operates at the vehicle level. An Optimal Right of Way Allocation (ORWA) model is proposed that maximizes the benefits of allowing GP vehicles into the DLs. To validate the proposed strategy, a simulation model based on VISSIM was developed. Results under various demand scenarios demonstrate that the proposed strategy outperforms traditional DL management strategies in terms of overall productivity, with improvements ranging from 10% to 25%.

专用车道(DL)在高速公路和主干道上已经非常普遍,因为它有助于加快拼车车辆或公共汽车的速度。然而,如果这些车辆的优先渗透率较低,就会浪费通行能力。通过采用 "车对车"(V2X)技术,并赋予通用(GP)车辆在 DL 上通行的能力,可以优化利用浪费的容量。然而,现有关于灵活 DL 的研究大多集中在预设的静态运行规则上。在本研究中,我们提出了一种真正的主动式 DL 管理策略,名为 "间歇优先的专用车道(DLIP)",可在车辆级别上运行。我们提出了一个最优路权分配(ORWA)模型,该模型能使允许 GP 车辆进入 DL 的效益最大化。为了验证所提出的策略,开发了一个基于 VISSIM 的仿真模型。各种需求情况下的结果表明,就整体生产率而言,建议的策略优于传统的 DL 管理策略,提高幅度在 10% 到 25% 之间。
{"title":"Operation of dedicated lanes with intermittent priority on highways: conceptual development and simulation validation","authors":"Yinghao Shao ,&nbsp;Jian Sun ,&nbsp;Yuheng Kan ,&nbsp;Ye Tian","doi":"10.1080/15472450.2022.2101110","DOIUrl":"10.1080/15472450.2022.2101110","url":null,"abstract":"<div><p>Dedicated Lanes (DLs) have become prevalent on highways and arterial roads as they help accelerate carpooling vehicles or buses. However, capacity is wasted if the penetration rates of these vehicles with priority are low. Wasted capacity can be utilized optimally by implementing Vehicle-to-Everything (V2X) technology and granting General-Purpose (GP) vehicles the ability to traverse on DLs. However, existing research on flexible DLs has mostly focused on preset, static operating rules. In this study, we propose a true, active DL management strategy named Dedicated Lane with Intermittent Priority (DLIP) that operates at the vehicle level. An Optimal Right of Way Allocation (ORWA) model is proposed that maximizes the benefits of allowing GP vehicles into the DLs. To validate the proposed strategy, a simulation model based on VISSIM was developed. Results under various demand scenarios demonstrate that the proposed strategy outperforms traditional DL management strategies in terms of overall productivity, with improvements ranging from 10% to 25%.</p></div>","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"28 1","pages":"Pages 69-83"},"PeriodicalIF":3.6,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77347741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
期刊
Journal of Intelligent Transportation Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1