The shortest path analysis is the most basic function of GIS network *** algorithm is widely recognized as a good shortest path *** this paper, to save storage space and improve computational speed departure, based on...
详细信息
The shortest path analysis is the most basic function of GIS network *** algorithm is widely recognized as a good shortest path *** this paper, to save storage space and improve computational speed departure, based on the dijkstra algorithm, we improved the adjacent edge algorithm, and propose adjacent node algorithms, and gives the algorithm implementation of object-oriented.
In allusion to the shortage of hardware configuration in the mobile devices and high timecomplexity of dijkstra algorithm, the paper comes up with a shortest path algorithm based on cut-corner for restricted searching...
详细信息
In allusion to the shortage of hardware configuration in the mobile devices and high timecomplexity of dijkstra algorithm, the paper comes up with a shortest path algorithm based on cut-corner for restricted searching area. This algorithm aims at shrinking the smallest searching area quickly, and considers the advantages of Ellipse algorithm and Rectangle algorithm. When tested in the simulator, we find that the time-complexity of Cut-corner algorithm is reduced by 5%-20% compared with that of other conventional algorithms. Thus, it has better effect when used in navigation software of low-end mobile device.
To have an efficient and successful communication in ad hoc networks, the use of Cognitive Radios (CR) has gained popularity in the recent past. These radios have spectrum sensing capabilities and thus can easily swit...
详细信息
To have an efficient and successful communication in ad hoc networks, the use of Cognitive Radios (CR) has gained popularity in the recent past. These radios have spectrum sensing capabilities and thus can easily switch to free spectrum band. The use of such type of radios not only improves the routing performance but at the same time improves the overall throughput of the network. To show the same, we implement shortest path routing strategy in MATLAB-7.01. The routing scheme uses two types of radios one with spectrum sensing capability such as cognitive radios and the other which doesn't. The following performance metrics such as Packet Delivery Ratio (PDR), Delay, Success Ratio and Hop count are taken into consideration for measuring the efficiency. The result shows that a node having spectrum sensing capability outperforms the other one.
Hazardous chemicals transportation requires a high-level of security *** is an effective transport strategy that reserved-lanes are set in a transportation route to avoid accidents such as rear-end collision and ***,o...
详细信息
Hazardous chemicals transportation requires a high-level of security *** is an effective transport strategy that reserved-lanes are set in a transportation route to avoid accidents such as rear-end collision and ***,other vehicles will be inevitably influenced if a lane is set as the ***,how to minimize the influence by setting the reserved-lane becomes a problem needed to be *** mathematical programming model of the reserved-lane setting for hazardous chemicals transportation is established in this *** to the characteristics of the problem,the heuristic algorithm based on dijkstra algorithm is *** algorithm is a simple and intelligible,satisfactory solution that can be obtained in polynomials.
This article adopts Computer simulation and graph theoretic algorithm to choose the most reasonable place to convey drugs. And this article use mathematical modeling and computer programming to solve the problem of tr...
详细信息
This article adopts Computer simulation and graph theoretic algorithm to choose the most reasonable place to convey drugs. And this article use mathematical modeling and computer programming to solve the problem of transport drugs.
This paper designs a parking guidance system based on parking sensor network. The system consists of parking lot sensors and sink node and parking manager. The system builds the parking sensor network by ZigBee commun...
详细信息
This paper designs a parking guidance system based on parking sensor network. The system consists of parking lot sensors and sink node and parking manager. The system builds the parking sensor network by ZigBee communication protocol, where the real-time parking information of all parking sensors is transmitted to the sink node. The sink node sends information of all parking lots to the parking manager by manner. In the parking manager, there will display the information and position of the parking spaces. Moreover, this paper uses dijkstra optimization algorithm to obtain the optimal parking router.
dijkstra algorithm is a classic algorithm of computing the shortest path between two points. In past the amount of urban vehicles is small, so the shortest path is the optimal one. However, with the increasing of cars...
详细信息
ISBN:
(纸本)9781479969890
dijkstra algorithm is a classic algorithm of computing the shortest path between two points. In past the amount of urban vehicles is small, so the shortest path is the optimal one. However, with the increasing of cars, traffic congestion is serious. The path calculated by using traditional dijkstra is still the shortest path, but it is not necessarily the optimal. Therefore, in order to solve the optimal route choice problem the improved dijkstra algorithm is put forward, which introduces traffic congestion weight function. Experiments show that the improved dijkstra algorithm can better meet the needs of drivers on the optimal path.
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.
A new method called ALGrId (Anti-Leak GRain IDentification) is proposed for the detection of sub-grains beyond the relative angular resolution of Electron Backscatter Diffraction maps. It does not use any additional i...
详细信息
A new method called ALGrId (Anti-Leak GRain IDentification) is proposed for the detection of sub-grains beyond the relative angular resolution of Electron Backscatter Diffraction maps. It does not use any additional information such as Kikuchi Pattern Quality map nor need data filtering. It uses a modified dijkstra algorithm which seeks the continuous set of boundaries having the highest average disorientation angle. (C) 2014 Elsevier Inc. All rights reserved.
The optimal path algorithm analysis of GPS navigation in taxi management system based on A* algorithm was introduced in this paper. Through improving the traditional dijkstra algorithm and avoiding problems such as &q...
详细信息
ISBN:
(纸本)9783037859865
The optimal path algorithm analysis of GPS navigation in taxi management system based on A* algorithm was introduced in this paper. Through improving the traditional dijkstra algorithm and avoiding problems such as "time-consuming and low efficiency" in dijkstra algorithm with traversal search for each node, A* algorithm could help the taxi find the optimal path and bring convenience for traffic management.
暂无评论