{"title":"Comparative analysis of drowsiness and performance in conditionally automated driving and manual driving considering the effect of circadian rhythm","authors":"Qi Zhang , Chaozhong Wu , Hui Zhang , Sara Ferreira","doi":"10.1080/15472450.2022.2130292","DOIUrl":"10.1080/15472450.2022.2130292","url":null,"abstract":"<div><p>Drowsiness in manual driving (MD) is influenced by circadian rhythms. Conditionally automated driving (CAD) affects drivers’ drowsiness. We conducted a simulator study with 30 participants (every ten subjects in morning group, afternoon group, and evening group) to investigate the effect of circadian rhythm on the changes in drivers’ drowsiness and performance in different driving modes. Each subject was required to complete CAD experiment first and MD experiment later, and experienced 8 risk scenarios in each experiment. The self-reported Karolinska Sleepiness Scale (KSS) was recorded by an investigator every time when the subject drove past the scenario as the drowsiness measurement. The speed, acceleration, time-related metrics, and vehicle lane position were collected as the performance measurements. KSS data were statistically analyzed, and the Spearman’s Rho test was used to confirm the correlation among performance measurements, KSS, and scenarios. The result of the KSS statistical analysis showed that the effect of circadian rhythm on fatigue in MD groups is consistent with the previous studies, but the existence of CAD changes the effect of the circadian rhythm. Compared with the MD, CAD slowed down the drowsiness growth rate in the morning group and promoted the drowsiness growth rate in the evening group. The brake input rate, mean longitude acceleration, max Standard Deviation of Lane Position (SDLP), and the time to pass (TTP) were significantly related to the driver´s drowsiness in both driving modes.</p></div>","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"28 3","pages":"Pages 340-351"},"PeriodicalIF":3.6,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85896125","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}
{"title":"Uncertainty analysis of autonomous delivery robot operations for last-mile logistics in European cities","authors":"Clément Lemardelé, Miquel Estrada, Laia Pagès","doi":"10.1080/15472450.2024.2324388","DOIUrl":"https://doi.org/10.1080/15472450.2024.2324388","url":null,"abstract":"Although autonomous delivery robots (ADRs) are widely anticipated to significantly enhance the efficiency of last-mile logistics operations in dense urban environments in the coming years, their im...","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"4 1","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140614637","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}
{"title":"Decentralized cooperative crossing at unsignalized intersections via vehicle-to-vehicle communication in mixed traffic flows","authors":"Gennaro Nicola Bifulco , Angelo Coppola , Alberto Petrillo , Stefania Santini","doi":"10.1080/15472450.2022.2124868","DOIUrl":"10.1080/15472450.2022.2124868","url":null,"abstract":"<div><p>Connected Autonomous Vehicles (CAVs) are going to share the road environment with human drivers until their full market deployment achievement. In this context, this paper tackles and solves the problem of decentralized crossing at unsignalized intersections for mixed traffic flows, composed of both connected human-driven vehicles (CHVs) and CAVs. To this aim, a novel cooperative fully-distributed control protocol for CAVs is proposed, augmenting the Adaptive Cruise Control (ACC) action based on proximity sensors measurements, with an additional networked protocol exploiting Vehicle-to-Vehicle (V2V) information for the cooperative evaluation of the Time-to-Intersection of all incoming vehicles within the communication range. This further collaborative action automatically adapts the CAVs motion at intersection avoiding both collisions with other vehicles and intersection deadlocks, while improving the intersection throughput. Safety and mobility performances are evaluated via the purposely designed Virtual Testing platform - Mixed Traffic Simulator (MiTraS)- combining the Matlab/Simulink environment with the SUMO traffic simulator. The analysis is carried out for an exemplary two-lane four-way unsignalized intersection considering both different traffic demands and different CAVs penetration rates. The unavoidable presence of variable delays in information delivery due to the wireless communication network has been also explicitly accounted for in both control design and validation. The extensive simulation analysis confirms how the inclusion of CAVs, equipped with the proposed control algorithm, within the mixed traffic flow strongly improves both the safety and mobility performances of the intersection. Lastly, we disclose how the benefits of the proposed controller increase with CAV penetration.</p></div>","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"28 2","pages":"Pages 211-236"},"PeriodicalIF":3.6,"publicationDate":"2024-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81607412","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}
{"title":"An analysis of the value of optimal routing and signal timing control strategy with connected autonomous vehicles","authors":"Tang Li , Fangce Guo , Rajesh Krishnan , Aruna Sivakumar","doi":"10.1080/15472450.2022.2129021","DOIUrl":"10.1080/15472450.2022.2129021","url":null,"abstract":"<div><p>With the emergence of connected and automated technologies, Connected Autonomous Vehicles (CAVs) are able to communicate and interact with other vehicles and signal controllers. Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) communications open up an opportunity to improve routing and signal timing efficiency with additional information from CAVs, such as prior travel time and signal green time. Most of the existing research on routing and signal timing for Human Driven Vehicles (HDVs) has to face the fact that human drivers only have partial knowledge about travel costs and traffic status on the road network, which typically reduces the system efficiency. In this paper, the impacts of additional information from CAVs on routing and signal timing efficiency in terms of total travel time have been investigated. An Optimal Routing and Signal Timing (ORST) control strategy for CAVs has been proposed and compared with four existing routing and signal timing strategies where drivers have different levels of information. The results of the simulation demonstrate that with additional information from CAVs, ORST can reduce about 49% of the total travel time compared with Stochastic User Equilibrium (SUE) and about 10% of the total travel time compared with User Equilibrium (UE).</p></div>","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"28 2","pages":"Pages 252-266"},"PeriodicalIF":3.6,"publicationDate":"2024-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80148018","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An automatic methodology to measure drivers’ behavior in public transport","authors":"Hernán Catalán , Hans Lobel , Juan Carlos Herrera","doi":"10.1080/15472450.2022.2129019","DOIUrl":"10.1080/15472450.2022.2129019","url":null,"abstract":"<div><p>The way in which public transport buses are driven has an influence in users’perception and satisfaction with the service. Bus driver’s behavior is usually obtained surveying passengers and/or using the mystery passenger method, not necessarily allowing for an objective and continuous evaluation. In this work, we introduce a novel methodology to automatically classify drivers’ behavior in a more consistent and objective manner, based on data from inertial measurement units, and machine learning techniques. By substituting human evaluators with automatic data collection and classification algorithms, we are able to reduce the subjectivity and cost of the current methodology, while increasing sample size. Our approach is based on three components: i) data capture using inertial measurement units (e.g. mobile devices), ii) carefully tuned classifiers that deal with sample imbalance problems, and iii) an interpretable scoring system. Results show that collected data captures several types of undesirable maneuvers, providing a rich information to the classification process. In terms of categorization performance, the evaluated classifiers, namely support vector machines, decision trees and <em>k</em>-NN, deliver high and consistent accuracy after the tuning process, even in the presence of a highly imbalanced sample. Finally, the proposed driver’s behavior score shows high discriminative power, effectively characterizing differences between drivers, and providing driver-tailored driving recommendations, that can be generated in specific spots, in order to improve passengers’ experience. The resulting methodology can be cost-effectively deployed at a large scale with good performance.</p></div>","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"28 2","pages":"Pages 237-251"},"PeriodicalIF":3.6,"publicationDate":"2024-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84718635","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}
{"title":"Urban path travel time estimation using GPS trajectories from high-sampling-rate ridesourcing services","authors":"Diego Correa , Kaan Ozbay","doi":"10.1080/15472450.2022.2124867","DOIUrl":"10.1080/15472450.2022.2124867","url":null,"abstract":"<div><p>Link-Travel-Time (LTT) estimation is essential for the planning and operations of a variety of transportation services. Given the random sampling of a very large number of GPS-points over a highly complex urban network, the task of organizing these individual GPS readings to estimate LTTs requires the development and implementation of a novel comprehensive data processing and path-finding methodology which is described in detail in this paper. As part of this novel methodology, an innovative data-driven matching-algorithm to estimate urban LTT from high-sampling-rate GPS data projected onto the Open-Street-Map network is developed and implemented. Then, using these LTTs, we construct Path-Travel-Time (PTT) between major origin-destination pairs. PTT of Actual-Paths (AP) followed by GPS-enabled vehicles are compared with k-Shortest-Paths (SP), allowing us to better understand route-choice behavior and overall traffic conditions. We compare PTT from observed-trips (OD-trips), map-matched AP, and SP paths with Free-Flow (FF). Results show that OD-trips, AP, and SP exceed FF by 15%, 41%, and 15%, respectively. The difference in PTT between OD-AP is ∼5%, which means the map-matching process works well and does not create bias in our analysis. People using the shortest-path varies with the distance; for ∼3-mile-paths, 50% of users do not use it. For ∼6-mile-paths, the percentage reduces to 35%, and for ∼9-mile, the percentage is 25%. A relatively high number of trips spend more time than the average and much longer than the shortest PTT.</p></div>","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"28 2","pages":"Pages 267-282"},"PeriodicalIF":3.6,"publicationDate":"2024-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84723455","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}
David Fiedler , Michal Čertický , Javier Alonso-Mora , Michal Pěchouček , Michal Čáp
{"title":"Large-scale online ridesharing: the effect of assignment optimality on system performance","authors":"David Fiedler , Michal Čertický , Javier Alonso-Mora , Michal Pěchouček , Michal Čáp","doi":"10.1080/15472450.2022.2121651","DOIUrl":"10.1080/15472450.2022.2121651","url":null,"abstract":"<div><p>Mobility-on-demand (MoD) systems consist of a fleet of shared vehicles that can be hailed for one-way point-to-point trips. The total distance driven by the vehicles and the fleet size can be reduced by employing ridesharing, i.e., by assigning multiple passengers to one vehicle. However, finding the optimal passenger-vehicle assignment in an MoD system is a hard combinatorial problem. In this work, we demonstrate how the VGA method, a recently proposed systematic method for ridesharing, can be used to compute the optimal passenger-vehicle assignments and corresponding vehicle routes in a massive-scale MoD system. In contrast to existing works, we solve all passenger-vehicle assignment problems to <em>optimality</em>, regularly dealing with instances containing thousands of vehicles and passengers. Moreover, to examine the impact of using optimal ridesharing assignments, we compare the performance of an MoD system that uses optimal assignments against an MoD system that uses assignments computed using insertion heuristic and against an MoD system that uses no ridesharing. We found that the system that uses optimal ridesharing assignments subject to the maximum travel delay of 4 minutes reduces the vehicle distance driven by 57% compared to an MoD system without ridesharing. Furthermore, we found that the optimal assignments result in a 20% reduction in vehicle distance driven and 5% lower average passenger travel delay compared to a system that uses insertion heuristic.</p></div>","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"28 2","pages":"Pages 189-210"},"PeriodicalIF":3.6,"publicationDate":"2024-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87075691","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}
{"title":"Identification of sensor location and link flow reconstruction using turn ratio and flow sensors in an arterial network","authors":"Fatma Yildiz Tascikaraoglu , Goker Aksoy","doi":"10.1080/15472450.2022.2119385","DOIUrl":"10.1080/15472450.2022.2119385","url":null,"abstract":"<div><p>In this article, a quadratic programming problem is considered to identify all link flows in an arterial network when there are unmeasured link flows. A graphical method is provided to determine the minimum number of measurements and sensor locations required to obtain a fully observable model. It is shown that this method is also valid for the augmented graph with turn ratio measurements. If the minimum measurements required are met, a fully determined network can be obtained. If there is not enough measurement, a bound on the magnitude of the resulting inaccuracy in terms of vehicle kilometers traveled (VKT) can be calculated by the proposed linear programming method. The model is that of a queueing network; the parameters describe network geometry, saturation flow rates, turning ratios, timing plan and link flows. Three case studies are conducted to validate this approach. The first two cases are to calculate all missing flows by using a few numbers of measurements and minimum number of measurements required, respectively. Upper and lower bounds in terms of VKT are also calculated for these cases. Third case is to obtain a fully determined network with the minimum number of flow measurements when turn ratio sensors are included. Real measurements are collected from a network in Mugla including 55 links and 16 intersections. Vissim simulator is used to analyze the accuracy of the link flow calculations obtained from the proposed method. The results show that the proposed programming method can calculate the missing flows with a high accuracy and short computation time.</p></div>","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"28 2","pages":"Pages 163-173"},"PeriodicalIF":3.6,"publicationDate":"2024-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75427989","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}
Haoran Wang , Xin Li , Xianhong Zhang , Jia Hu , Xuerun Yan , Yongwei Feng
{"title":"Cut through traffic like a snake: cooperative adaptive cruise control with successive platoon lane-change capability","authors":"Haoran Wang , Xin Li , Xianhong Zhang , Jia Hu , Xuerun Yan , Yongwei Feng","doi":"10.1080/15472450.2022.2114081","DOIUrl":"10.1080/15472450.2022.2114081","url":null,"abstract":"<div><p>A cooperative adaptive cruise control (CACC) system may be impeded by slow-moving traffic in the application. To improve the mobility of CACC, this research proposes a CACC controller with successive platoon lane-change capability. The goal is to help a platoon cut through traffic successively like a snake via smaller windows. The proposed controller has the following features: i) with successive platoon lane-change capability; ii) with string stability and lateral stability; iii) with consideration of vehicle dynamics. The proposed controller is evaluated on a simulation platform with the context of traffic and a joint simulation platform consisting of PreScan and Matlab/Simulink. the Results demonstrate that compared to the conventional controller: i) platoon lane-change competence is enhanced by 71.36% on arterials and 120.49% on freeways; ii) platoon lane-change efficiency is enhanced by 25.05% on arterials and 41.36% on freeways; iii) the proposed controller is more robust against congestion. Moreover, the computation time of the proposed controller is approximately 15 milliseconds when running on a laptop equipped with an Intel i7-8750H CPU. This indicates that the proposed controller is ready for real-time implementation.</p></div>","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"28 2","pages":"Pages 141-162"},"PeriodicalIF":3.6,"publicationDate":"2024-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79831162","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}
{"title":"A cooperative energy efficient truck platoon lane-changing model preventing platoon decoupling in a mixed traffic environment","authors":"Meng Li , Zhibin Li , Yang Zhou , Jiaming Wu","doi":"10.1080/15472450.2022.2119386","DOIUrl":"10.1080/15472450.2022.2119386","url":null,"abstract":"<div><p>Truck platooning has gained increasing attention due to the benefits in energy and operation efficiency in freight transportation. One significant challenge for deploying truck platoons is the safe and efficient interaction with surrounding traffic, especially at freeway discontinuities where mandatory lane changes usually lead to the decoupling of truck platoons. This study proposes a cooperative truck platoon lane-changing model (CTPLC) to prevent the decoupling of truck platoons in a mixed traffic environment. Specifically, a two-step control strategy is presented, where vehicles in the target lane firstly cooperatively adjust speeds to create an appropriate gap for a truck platoon, and then trucks within the truck platoon conduct lane change sequentially. The cooperative speed profiles are generated by solving an optimization problem considering the lane-changing influence and energy consumption. Based on that, a two-dimensional nonlinear model predictive control (MPC) algorithm is employed to generate vehicular acceleration and steering angle for each truck. A series of numerical simulation experiments were conducted to validate the proposed strategy. As shown by the results, our proposed method truck platoon could conduct a lane change in a traffic-efficient and safe manner, and meanwhile, our method was more energy-efficient than a benchmark strategy.</p></div>","PeriodicalId":54792,"journal":{"name":"Journal of Intelligent Transportation Systems","volume":"28 2","pages":"Pages 174-188"},"PeriodicalIF":3.6,"publicationDate":"2024-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74642067","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}