Railroad accidents involving dangerous goods (DG) need to be rescued quickly due to their hazardous nature. This paper proposes an emergency facility location model for the railway dangerous-goods transportation problem (RDGT-EFLP, abbreviated as EFLP). The EFLP model is based on an ellipsoidal robust model that introduces a robust control safety parameter Ω to measure the risk preferences of decision makers and limits the range of uncertain demand, the range of uncertain service and the range of safety parameters to find the solution for siting emergency facilities, when the time and location of emergency events are unknown. The model is solved using a genetic algorithm (GA) and real data after abstraction. Finally, a comprehensive analysis of the solution results under different maximum overcoverages illustrates the feasibility and effectiveness of the model.
The intelligent vehicle infrastructure system (IVIS) requires systematic testing before being put into large-scale applications. IVIS testing under closed conditions includes stress tests for typical scenarios and extreme scenario strength testing. To extract IVIS integration test indicators under closed conditions, this article constructed a hierarchical framework of IVIS’s evaluation indexes in the stress tests and the strength tests. The hierarchical framework of IVIS stress test evaluation indicators reflect the highway construction area under typical scenarios, and the hierarchical framework of IVIS strength test evaluation indicators reflect the highway merging area under extreme scenarios. Both are based on the test requirements of the stress test and strength test, with safety as the evaluation objective. Second, the analytic hierarchy process (AHP) was used to calculate the weights of the test evaluation indicators of the two scenarios. Finally, the activity-based classification (ABC) method was used after ranking the weight results in order to extract the key factors that have the maximum impact on safety in the scenarios. In this paper, we proved the practicality and feasibility of the AHP-ABC extraction method in the IVIS integration testing evaluation index and guided the development and testing of the IVIS.
Spatiotemporal data from urban road traffic are pivotal for intelligent transportation systems and urban planning. Nonetheless, missing data in traffic datasets is a common challenge due to equipment failures, communication issues, and monitoring limitations, especially the missing not at random (MNAR) problem. This research introduces an approach to address MNAR-type missing data in traffic status prediction, utilizing a multidimensional feature sequence and a second-order hidden Markov model (2nd-order HMM). First, this approach involves extracting spatiotemporal features for the preset data sections and spatial features for the sections to be predicted based on the traffic spatiotemporal characteristics. Second, using the extracted features, distinctive road traffic features are generated for each section. Furthermore, at specific intervals within the defined time period, nearest distance feature matching is introduced to ascertain the traffic attributes of the road section under prediction. Finally, relying on the matched status results, a 2nd-order HMM is employed to forecast the traffic status for subsequent moments within the defined time period. Experiments were carried out using datasets from Shenzhen City and compared against the hidden Markov models and contrast measure (HMM-C) method to affirm the efficacy of the proposed approach.
In response to the widespread absence of global navigation satellite system (GNSS) signals in underground parking scenes, we propose a multimodal localization method that integrates enhanced berth mapping with Clothoid trajectory prediction, enabling high-precision localization for intelligent vehicles in underground parking environments. This method began by constructing a lightweight map based on the key berths. The map consisted of a series of discrete nodes, each encompassing three elements: holistic and local scene features extracted from an around-view image, and the global pose of the mapping vehicle calculated using the positions of the key berth’s corner points. An adaptive localization strategy was employed during the localization phase based on the trajectory prediction result. A progressive localization strategy, relying on multi-scale feature matching, was applied to the nodes within the map coverage range. Additionally, a compensation localization strategy that combined odometry with the prior pose was utilized for the nodes outside the map coverage range. The experiments conducted in two typical underground parking scenes demonstrated that the proposed method achieved a trajectory prediction accuracy of 40 cm, a nearest map search accuracy exceeding 92%, and a metric localization accuracy meeting the 30 cm standard. These results indicate that the proposed approach satisfies the high-precision, robust, real-time localization requirements for intelligent vehicles in underground parking scenes, while effectively reducing the map memory requirements.
In visual Simultaneous Localization and Mapping (SLAM), operational efficiency and localization accuracy are equally crucial evaluation metrics. We propose an enhanced visual SLAM method to ensure stable localization accuracy while improving system efficiency. It can maintain localization accuracy even after reducing the number of feature pyramid levels by 50%. Firstly, we innovatively incorporate the principal direction error, which represents the global geometric features of feature points, into the error function for pose estimation, utilizing Pareto optimal solutions to improve the localization accuracy. Secondly, for loop-closure detection, we construct a feature matrix by integrating the grayscale and gradient direction of an image. This matrix is then dimensionally reduced through aggregation, and a multi-layer detection approach is employed to ensure both efficiency and accuracy. Finally, we optimize the feature extraction levels and integrate our method into the visual system to speed up the extraction process and mitigate the impact of the reduced levels. We comprehensively evaluate the proposed method on local and public datasets. Experiments show that the SLAM method maintained high localization accuracy after reducing the tracking time by 24% compared with ORB SLAM3. Additionally, the proposed loop-closure-detection method demonstrated superior computational efficiency and detection accuracy compared to the existing methods.
Improving the accuracy of parking space recognition is crucial in the fields for Automated Valet Parking (AVP) of autonomous driving. In AVP, accurate free space recognition significantly impacts the safety and comfort of both the vehicles and drivers. To enhance parking space recognition and annotation in unknown environments, this paper proposes an automatic parking space annotation approach with tight coupling of Lidar and Inertial Measurement Unit (IMU). First, the pose of the Lidar frame was tightly coupled with high-frequency IMU data to compensate for vehicle motion, reducing its impact on the pose transformation of the Lidar point cloud. Next, simultaneous localization and mapping (SLAM) were performed using the compensated Lidar frame. By extracting two-dimensional polarized edge features and planar features from the three-dimensional Lidar point cloud, a polarized Lidar odometry was constructed. The polarized Lidar odometry factor and loop closure factor were jointly optimized in the iSAM2. Finally, the pitch angle of the constructed local map was evaluated to filter out ground points, and the regions of interest (ROI) were projected onto a grid map. The free space between adjacent vehicle point clouds was assessed on the grid map using convex hull detection and straight-line fitting. The experiments were conducted on both local and open datasets. The proposed method achieved an average precision and recall of 98.89% and 98.79% on the local dataset, respectively; it also achieved 97.08% and 99.40% on the nuScenes dataset. And it reduced storage usage by 48.38% while ensuring running time. Comparative experiments on open datasets show that the proposed method can adapt to various scenarios and exhibits strong robustness.