Emergency events, such as earthquakes, hurricanes, fires, chemical accidents, nuclear accidents, terror attacks and other events may led to injured or endanger the life and the health of human beings, and the large sc...
详细信息
Emergency events, such as earthquakes, hurricanes, fires, chemical accidents, nuclear accidents, terror attacks and other events may led to injured or endanger the life and the health of human beings, and the large scale crowds have to evacuate from a danger area to a safe area by vehicles. In this paper, through observing real-time road network and analyzing three different emergency evacuation cases and the nodes, intersections delay and velocity of vehicles evacuation in the morning peak, common and evening peak. A dynamic road network model is built for vehicles evacuation based on dijkstra algorithm. The optimal evacuation path is proposed in three different cases. The obtained outcomes provide well predictive method and theoretical basis for optimal emergency evacuation path selection and emergency rescue decision in public places, especially for those with high population density. So it seems very meaningful for us to cope with emergency situation or to prevent and mitigate disasters from the crisis events.
In this paper, aiming at the selection of the optimal path through the desert, the dijkstra algorithm is used to calculate the shortest path plan for each level map, and the node-type simplified map is used to display...
详细信息
In this paper, aiming at the selection of the optimal path through the desert, the dijkstra algorithm is used to calculate the shortest path plan for each level map, and the node-type simplified map is used to display each level. At the same time, the relevant schemes are set according to the conditions and maps in each level, and the linear programming is used to continuously simulate and back-substitute each scheme. With the help of the running results of MATLAB and Python, the analysis and comparison are carried, and the optimal path planning of checkpoints is given on this basis.
To increase data availability and accuracy in the coastal zone, especially in the last 5 km to the coast, we present a SCMR (Seamless Combination of Multiple Retrackers) processing strategy to combine sea surface heig...
详细信息
To increase data availability and accuracy in the coastal zone, especially in the last 5 km to the coast, we present a SCMR (Seamless Combination of Multiple Retrackers) processing strategy to combine sea surface height (SSH) estimates from waveform retrackers of SGDR MLE4, ALES, WLS3 and MB4 for Jason-3 and Saral missions, and of SAMOSA and SAMOSA+ for Sentinel-3A mission in the Australian coastal zone. The SCMR does not require the waveform classification result. It includes two steps: (1) estimating and removing the SSH bias due mainly to the significant wave height (SWH) difference-dependent height differences, and (2) determining the optimal along-track SSH profile by using the dijkstra algorithm. In the study region, the results show that the SCMR increases the data availability by up to 15% in the last 5 km to the coast and reduces the noise level by 28-34% at the spatial scales < 2.5 km. The validation results against tide gauges show that SCMR-derived SSH estimates achieve a better accuracy than that from any single retracker, with the improvement percentage of 6.26% and 4.94% over 0-10 km and 20-100 km distance bands, respectively.
This study focuses on finding the shortest paths among cities in Java Island by repeatedly combining the start node's nearest neighbor to implement dijkstra algorithm. Node combination is used to find the shortest...
详细信息
This study focuses on finding the shortest paths among cities in Java Island by repeatedly combining the start node's nearest neighbor to implement dijkstra algorithm. Node combination is used to find the shortest path among cities in Java by deleting the node nearest to the start node. The use of memory by node combination is more efficient than the use of memory by the original Disjkstra algorithm. The 46 cities in Java Island will be used to evaluate the performance of finding shortest path. The experimental results show that the accuracy of node combination is 92.88% with the Google Map as the reference. The successful implementation of algorithm in finding the shortest path on the real problem is a good point;therefore, the algorithm can be developed to solve the transportation network problem.
The shortest path is one of the main problems appeared in application of *** to the character of depot network management,it put forward the optimized algorithm of the shortest path based on the dijkstra algorithm,rea...
详细信息
The shortest path is one of the main problems appeared in application of *** to the character of depot network management,it put forward the optimized algorithm of the shortest path based on the dijkstra algorithm,realized the quick search of the shortest *** was used properly to choose of practical path and make the whole system have a better practicability.
according to the dijkstra's inefficacy caused by its fixed weights and high time complexity caused by traversing all nodes,an adaptive optimization method for the dijkstra algorithm is put forward in this *** dyna...
详细信息
according to the dijkstra's inefficacy caused by its fixed weights and high time complexity caused by traversing all nodes,an adaptive optimization method for the dijkstra algorithm is put forward in this *** dynamic weight assignment for factors that affects the traffic;all factors are taken into consideration for the practicability usage of *** simulation and comparison show that the optimized algorithm is improved significantly.
Bidirectional dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical dijkstra algorithm has not any directional feature during searching the shortest path. The alg...
详细信息
Bidirectional dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical dijkstra algorithm has not any directional feature during searching the shortest path. The algorithm takes advantage of the adjacent link and the mechanism of bidirectional search, that is, the algorithm processes the positive search from start point to destination point and the negative search from destination point to start point at the same time. Finally, combining with the practical application of route-planning algorithm in embedded real-time vehicle navigation system (ERTVNS), one example of its practical applications is given, analysis in theory and the experimental results show that compared with the dijkstra algorithm, the new algorithm can reduce time complexity, and guarantee the searching precision, it satisfies the needs of ERTVNS.
The dijkstra algorithm is a typical single-source shortest path algorithm for calculating the shortest path from one node to the other in a non-negative weight map, but its use of the roulette method greatly affects t...
详细信息
ISBN:
(纸本)9781450361910
The dijkstra algorithm is a typical single-source shortest path algorithm for calculating the shortest path from one node to the other in a non-negative weight map, but its use of the roulette method greatly affects the node selection. Speed and efficiency. Therefore, on the basis of ensuring the search accuracy, this paper improves the initial dijkstra algorithm to improve the efficiency of the algorithm and meet its needs in 2D or 3D path planning. In this paper, MATLAB2018a is used as the experimental platform to simulate the initial dijkstra algorithm and the improved dijkstra algorithm. The experimental results show that the improved algorithm greatly reduces the path planning vision and improves the operating efficiency.
Network analyses is an important function of GIS, and the shortest path analysis is the key problem of network analyses. dijkstra shortest path algorithm is one of the classic algorithms. Based on the analysis of this...
详细信息
ISBN:
(纸本)9781467344975
Network analyses is an important function of GIS, and the shortest path analysis is the key problem of network analyses. dijkstra shortest path algorithm is one of the classic algorithms. Based on the analysis of this algorithm, this paper describe from the point of application, using geographic information system (GIS) features, we designed a new data storage structure, improved node search method to improve the efficiency of the algorithm by using a heap to save nodes, and that can save storage space and shorten the searching time.
Mosaic seamline automatic search approach is the critical process for achieving seamless mosaic images in overlapping areas. The approach based on dijkstra algorithm has the problem of running efficiency and is limite...
详细信息
Mosaic seamline automatic search approach is the critical process for achieving seamless mosaic images in overlapping areas. The approach based on dijkstra algorithm has the problem of running efficiency and is limited in some applications. And other existing algorithms for search mosaic seamline will pass through the highlight area such as building, and mosaicking gap will occur in mosaic images. In order to solve the problems, an improved approach, which based on dijkstra algorithm, is proposed in this paper. All four steps are included in this method. Firstly, overlap image is determined. Secondly, the color balance treatment between both images is done and the difference image is calculated. Thirdly, morphological expansion processing was carried out on the difference image and an eight-neighborhood sparse matrix is constructed. Lastly, using the dijkstra algorithm to automatically search the mosaic seamline with the optimal path. In order to verify the efficiency of the proposed approach in this paper, a test area image with the size of 3700 * 4200 pixels is selected. The experimental results show that the improved approach can automatically search mosaic seamline which could effectively avoid highlight area such as building. The running time only is about 18 seconds but it spends more than one hour by using traditional dijkstra algorithm.
暂无评论