With the development of intelligent transportation, the vehicular smart system has become a focus of the academic and industrial communities. The routing protocol is one of the most significant issues in the vehicular...
详细信息
With the development of intelligent transportation, the vehicular smart system has become a focus of the academic and industrial communities. The routing protocol is one of the most significant issues in the vehicular heterogeneous network. The paper uses the dijkstra algorithm to obtain the optimal routing path. To evaluate the performance of the dijkstra algorithm, it is compared with the minimum tree model based on the Prim algorithm. The simulation experiments are based on the MATLAB platform. The experimental results indicate the dijkstra algorithm achieves the best performance.
This paper presents a dynamic routing method for shortest path planning and conflict prevention of AGV system,and then illustrates the principle and implementation of this *** gives a way to schedule a shortest and co...
详细信息
This paper presents a dynamic routing method for shortest path planning and conflict prevention of AGV system,and then illustrates the principle and implementation of this *** gives a way to schedule a shortest and conflict-free route by utilizing dijkstra algorithm and the Dynamic Time-Window Method,and comes to the conclusion by experiments that the combination of these algorithms will solve the routing problem of small-sized multi-AGV system to a large extent.
In this paper, the authors propose an extended version of dijkstra' algorithm for finding the shortest path on a network where the edge weights are characterized by an interval valued neutrosophic numbers. Finally...
详细信息
ISBN:
(纸本)9781509042418
In this paper, the authors propose an extended version of dijkstra' algorithm for finding the shortest path on a network where the edge weights are characterized by an interval valued neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.
The Chinese government has formulated a policy that, in principle, is no longer a closed community. The existing closed area and unit compound should open gradually. The policy has aroused widespread concern and discu...
详细信息
The Chinese government has formulated a policy that, in principle, is no longer a closed community. The existing closed area and unit compound should open gradually. The policy has aroused widespread concern and discussion. We use the dijkstra algorithm to simulate the district road network. Based on the study of the total time before and after the opening of the District, this paper studies whether the district is open or not. This method has two advantages, quantitative answers to the impact of the open area on the road network, and can find the Brasee paradox. Finally, we have a case study of a district in Changsha, China.
dijkstra algorithm is the shortest path algorithm from one vertex to others, which has solved many shortest path problems. However, in some engineering practice, the shortest path is not the best path, so that it need...
详细信息
ISBN:
(纸本)9781510840232
dijkstra algorithm is the shortest path algorithm from one vertex to others, which has solved many shortest path problems. However, in some engineering practice, the shortest path is not the best path, so that it needs to define a weight to illustrate the importance of the two nodes. Based on the best evacuation route when a mine is flooded, the traditional dijkstra algorithm is improved in this paper. First, this paper interprets the dijkstra algorithm before improved, and uses it to calculate the mine shortest path to avoid water, then proposes a improvement method-introducing the concept of equivalent path and analyzing the influence factor and weight of equivalent path, then obtaining the conversion formula of the equivalent path and actual path. Instead of the actual path, the equivalent path can realize the adaptive improvement to the dijkstra algorithm, so that it can realize the calculation on the best path to avoid water when the water inrush occurs.
In order to ensure the safety of seafarer and comprehensively improve the intelligence of maritime field,the topic of unmanned ship has become more and more popular in recent years,and the ability of collision avoidan...
详细信息
In order to ensure the safety of seafarer and comprehensively improve the intelligence of maritime field,the topic of unmanned ship has become more and more popular in recent years,and the ability of collision avoidance path planning of unmanned ship is one of its key technologies,which is an important embodiment of its *** this paper,aiming at solving the path planning problem of unmanned ship in known environment map,using mathematical modeling software simulation,some algorithm fields of unmanned ship path planning are reproduced,and the running results of related algorithms are *** algorithm belongs to the single source shortest path *** original dijkstra classical algorithm is used to realize the path *** experimental results show that there are many unnecessary inflection points after using the dijkstra *** pheromone idea of ant colony algorithm is added to the classic dijkstra algorithm *** experimental results show that the optimized algorithm can greatly reduce the redundant points in the process of path planning and reduce the moving cost of unmanned ship routing.
At present,most researches on parking in cities focus on the recommendation of off-site parking *** the research after vehicles enter the parking lot,due to the low degree of application of existing information techno...
详细信息
At present,most researches on parking in cities focus on the recommendation of off-site parking *** the research after vehicles enter the parking lot,due to the low degree of application of existing information technology,the effective information of parking spaces is not fully known,and the parking lot does not provide *** vehicle guidance and parking space recommendation services have prevented the driver from driving the vehicle to the ideal parking space quickly and *** order to solve the above problems,this paper selects the vehicle parking service in underground parking lots as the research object,combined with the functional requirements of the parking lot,based on the improved dijkstra algorithm to study the guidance path of the optimal parking *** performance verification of the search area and time was carried out in the MATLAB environment,and finally the specific data of an underground parking lot at a certain time was used to derive and analyze the optimal parking space guidance *** results show that the improved algorithm has faster convergence speed and higher efficiency,can effectively solve the rare problem of parking in the field,achieves good application effects,and has good practicability.
In recent years, the problem of large-scale migration of refugees has not only become an international hotspot that has plagued many countries around the world. More than a million migrants and refugees crossed into E...
详细信息
ISBN:
(纸本)9781510845008
In recent years, the problem of large-scale migration of refugees has not only become an international hotspot that has plagued many countries around the world. More than a million migrants and refugees crossed into Europe in 2015, sparking a crisis as countries struggle to cope with the influx, and creating division in the EU over how best to deal with resettling people [1]. Because of the limited choice of refugees, and limited capacity of the recipient countries, the first step is to deal with the allocation of refugees in various routes to different countries. In the second step, a lot of external events will be added to interfere. At this point, it is needed to test whether the model can maintain stability under the interference of certain dynamic factors. Therefore, the basic model needs to meet the conditions of dynamic planning, and dijkstra algorithm is chosen to optimize the migration route for the refugees. Its advantage is that when the dynamic interference occurs, only some parameters are adjusted slightly, and the basic model is still applicable. Bayes statistical model is used to predict the rate of refugees leaving the transit countries. And the proportion of leaving refugees at each point of action can be obtained. Then, the optimal allocation of the refugees can be calculated based on integer programming.
The shortest path is one of the main problems appeared in application of GIS. According to the character of depot network management, it put forward the optimized algorithm of the shortest path based on the dijkstra A...
详细信息
The shortest path is one of the main problems appeared in application of GIS. According 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 path. It was used properly to choose of practical path and make the whole system have a better practicability.
We study zero-sum dynamic games with deterministic transitions and alternating moves of the players. Player 1 aims at reaching a terminal set and minimizing a possibly discounted running and final cost. We propose and...
详细信息
We study zero-sum dynamic games with deterministic transitions and alternating moves of the players. Player 1 aims at reaching a terminal set and minimizing a possibly discounted running and final cost. We propose and analyze an algorithm that computes the value function of these games extending dijkstra's algorithm for shortest paths on graphs. We also show the connection of these games with numerical schemes for differential games of pursuit-evasion type, if the grid is adapted to the dynamical system. Under suitable conditions, we prove the convergence of the value of the discrete game to the value of the differential game as the step of approximation tends to zero.
暂无评论