Emergency path planning technology is one of the research hotspots of intelligent transportation systems. Due to the complexity of urban road networks and congested road conditions, emergency path planning is very difficult. Road congestion caused by urban emergencies directly affects the original road network structure. In this way, the static weight of the original road network is no longer suitable as the basis for path recommendation. To handle the dynamic situational road network, an equidistant grid emergency path planning framework will be designed. A novel situation grid road network model, based on situation information, is proposed and applied to an equidistant grid emergency path planning framework. A situational grid heuristic search will be proposed methodology based on this model, which can be used to detect the vehicles passing around the congestion area grid and the road to the destination in the shortest time. In the path planning methodology, a grid inspired search strategy based on quaternion function is included, which can make the algorithm converge to the target grid quickly. Three graph acceleration algorithms are proposed to improve the search efficiency of path planning algorithm. Finally, this paper will set up three experiments to verify our proposed method.
When an emergency occurs in the city, a large area of road congestion usually occurs. Therefore, it is particularly important to provide an effective emergency path planning strategy for vehicles. However, existing emergency path planning methods do not take into account the connectivity characteristics of the road network and commuting capacity. For this purpose, a Grid Map Emergency Path Planning (GMEPP) framework based on a novel model Grid Road Network (GRN) is designed in this paper. First, the road network data is divided into grids under equal spacing bands, and the roads data divided into different grids and use the commuting capacity of each road as the weight of each edge in the grid. Then a Grid PageRank (GPR) algorithm will be introduced, the output value of this methodology is calculated based on the capacity and number of connected edges of all vertices pointed by the external grid in each grid. The higher value of the grid will be recommended to users first when the path is planning. According to the GRN model, an improved Bidirectional Dijkstra will be applied to query the shortest path between two points, which is called Gird Bidirectional Dijkstra (GBD). At last, GMEPP uses Reverse Contraction Hierarchies (RCH) and Multiple Reverse Contraction Hierarchies (MRCH) originality methodologies based on intersection type to speed up the query algorithm GBD. To compare the efficiency of the proposed method, this paper conducted extensive experiments to verify. The results of the test showed that the Gird Bidirectional Dijkstra Multiple Reverse Contraction Hierarchies (GBD-MRCH) is better than other methods in different grid distributions.
In recent years, with the development of various types of public transportation, they are also more and more closely connected. Among them, subway transportation has become the first choice of major cities. However, the planning of subway stations is very difficult and there are many factors to consider. Besides, few methods for selecting optimal station locations take other public transport in to consideration. In order to study the relationship between different types of public transportation, the authors collected and analyzed the travel data of subway passengers and the passenger trajectory data of taxis. In this paper, a method based on LeaderRank and Gaussian Mixed Model (GMM) is proposed to conduct subway station locations selection. In this method, the author builds a subway-passenger traffic zone weighted network and a station location prediction model. First, we evaluate the nodes in the network, then use the GPS track data of taxis to predict the location of new stations in future subway construction, and analyze and discuss the land use characteristics in the prediction area. Taking the design of the Beijing subway line as an example, the suitability of this method is illustrated.
In order to improve the effect of path planning in emergencies, the missing position imputation and velocity restoration in vehicle trajectory provide data support for emergency path planning and analysis. At present, there are many methods to fill in the missing trajectory information, but they basically restore the missing trajectory after analyzing a large number of datasets. However, the trajectory reduction method with few training sets needs to be further explored. For this purpose, a novel trajectory data cube model (TDC) is designed to store time, position, and velocity information hierarchically in the trajectory data. Based on this model, three trajectory Hierarchical Trace-Back algorithms HTB-p, HTB-v, and HTB-KF are proposed in this paper. Finally, experiments verify that conduct in a different number of sample sets, it has a satisfactory performance on information restoration of individual points of the trajectory and information restoration of trajectory segments.
The urban rail transit stations are an important part of an urban transit system. Scientific and reasonable location of rail transit station can greatly alleviate traffic pressure. The number of people in the surrounding area of a rail transit station is an important factor for site selection. However, it is difficult to obtain the spatial distribution of population, which brings great difficulties in terms of site selection. Due to the large-scale popularization of AP (Access Point) in China, the spatial distribution of AP is used instead of population distribution to assist site selection. Therefore, a density visualization method based on a dynamic grid is proposed, which can help decision-makers intuitively see the AP density of the uncovered grid of rail transit stations, and then cluster the AP density of the uncovered area to predict the location of new rail transit stations. The validity of the proposed method is demonstrated by using the AP dataset and rail transit data of Beijing in 2013. The results show that our method has high accuracy in predicting the location of rail transit stations. It can provide data support for urban traffic development and management.
With the development and progress of smart cities, ride-hailing have high passenger demand because of high spatial and temporal flexibility. However, when ride-hailing platforms dispatch vehicles, it finds that lots of vehicles wandering areas with no demand and areas with passenger demand have no service vehicles, resulting in increased vehicle costs, reduced benefits, and increased passenger waiting times. To solve this problem, it is necessary to accurately predict high demand areas to guide service vehicles to converge to these areas earlier, which helps to balance the demand and supply of the ride-sharing platform. Therefore, we propose a hierarchical clustering application algorithm based on distance and density (HDDCA) to construct virtual service areas, and a hybrid network based convolutional and time-series models is used for demand prediction. To improve the prediction accuracy, the correlation between virtual service areas is explored and used as the input of the prediction model to predict the demand for different virtual service areas in the next interval. In addition, the attention mechanism is also used to capture external factors with different weights. In this paper, experiments are conducted on the travel data set of Haikou City in 2017, and the results show that the prediction accuracy of this method is better than that of some typical models and existing deep neural network models, which validates the effectiveness.