Search for: All records

Given GPS points on a transportation network, the goal of the Quad-tree Based Driver Classification (QBDC) problem is to identify whether drivers have Mild Cognitive Impairment (MCI). The QBDC problem is challenging due to the large volume and complexity of the data. This paper proposes a quad-tree based approach to the QBDC problem by analyzing driving patterns using a real-world dataset. We propose a geo-regional quad-tree structure to capture the spatial hierarchy of driving trajectories and introduce new driving features representation for input into a convolutional neural network (CNN) for driver classification. The experimental results demonstrate the effectiveness of the proposed algorithm, achieving an F1 score of 95% that significantly outperforms the baseline models. These results highlight the potential of geo-regional quad-tree structures to extract interpretable features and describe complex driving patterns. This approach offers significant implications for driver classification, with the potential to improve road safety and cognitive health monitoring. 

Given a road network and a set of trajectory data, the anomalous behavior detection (ABD) problem is to identify drivers that show significant directional deviations, hard-brakings, and accelerations in their trips. The ABD problem is important in many societal applications, including Mild Cognitive Impairment (MCI) detection and safe route recommendations for older drivers. The ABD problem is computationally challenging due to the large size of temporally-detailed trajectories dataset. In this paper, we propose an Edge-Attributed Matrix that can represent the key properties of temporally-detailed trajectory datasets and identify abnormal driving behaviors. Experiments using real-world datasets demonstrated that our approach identifies abnormal driving behaviors. 

Given a transportation network, a source node s, a destination node t , and the number of maximum possible turnings b , the Turn-Constrained Shortest Path (TCSP) problem is to find the route that minimizes the travel distance and meets the turn-constraint. The TCSP problem is important for societal applications such as shipping and logistics, emergency route planning, and traffic management services. We propose novel approaches for TCSP to meet the turn-constraint while minimizing the travel distance for the vehicle route. Experiments using real-world datasets demonstrated that the proposed algorithms can minimize the travel distance and meet the turn-constraint; furthermore, it has comparable solution quality to the unconstrained shortest path and significantly reduces the computational cost. 

Given a GPS dataset comprising driving records captured at one-second intervals, this research addresses the challenge of Abnormal Driving Detection (ADD). The study introduces an integrated approach that leverages data preprocessing, dimensionality reduction, and clustering techniques. Speed Over Ground (SOG), Course Over Ground (COG), longitude (lon), and latitude (lat) data are aggregated into minute-level segments. We use Singular Value Decomposition (SVD) to reduce dimensionality, enabling K-means clustering to identify distinctive driving patterns. Results showcase the methodology's effectiveness in distinguishing normal from abnormal driving behaviors, offering promising insights for driver safety, insurance risk assessment, and personalized interventions. 

Given a spatial network and a set of service centers from k different resource types, a Multiple Resource Network Voronoi Diagram (MRNVD) partitions the spatial network into a set of Service Areas that can minimize the total cycle-distances of graph-nodes to allotted k service centers with different resource types. The MRNVD problem is important for critical societal applications such as assigning essential survival supplies (e.g., food, water, gas, and medical assistance) to residents impacted by man-made or natural disasters. The MRNVD problem is NP-hard; it is computationally challenging due to the large size of the transportation network. Previous work proposed the Distance bounded Pruning (DP) approach to produce an optimal solution for MRNVD. However, we found that DP can be generalized to reduce the computational cost for the minimum cycle-distance. In this paper, we extend our prior work and propose a novel approach that reduces the computational cost. Experiments using real-world datasets from five different regions demonstrate that the proposed approach creates MRNVD and significantly reduces the computational cost.