An Improved Algorithm to Enhance the Utilization of Shortest Path Caches

2013 ◽  
Author(s):  
Xiaohua Li ◽  
Shimeng Wang ◽  
Bin Wang ◽  
Xiaochun Yang ◽  
Ge Yu
Keyword(s):  
Shortest Path ◽  
Improved Algorithm

A New Algorithm for Euclidean Shortest Path of Visiting Segments in a Polygon

2014 ◽  
Vol 644-650 ◽  
pp. 1891-1894
Author(s):  
Li Juan Wang ◽  
An Sheng Deng ◽  
Bo Jiang ◽  
Qi Wei
Keyword(s):  
Test Data ◽  
Shortest Path ◽  
Time Complexity ◽  
Simple Polygon ◽  
Rubber Band ◽  
Crossing Over ◽  
Euclidean Shortest Path ◽  
Adjacent Segments ◽  
Improved Algorithm

Let s and t be two points on the boundary of a simple polygon, how to compute the Euclidean shortest path between s and t which visits a sequence of segments given in the simple polygon is the problem to be discussed, especially, the situation of the adjacent segments intersect is the focus of our study. In this paper, we first analyze the degeneration applying rubber-band algorithm to solve the problem. Then based on rubber-band algorithm, we present an improved algorithm which can solve the degeneration by the method of crossing over two segments to deal with intersection and in our algorithm the adjacent segments order can be changed when they intersect. Particularly, we have implemented the algorithm and have applied a large of test data to test it. The experiments demonstrate that our algorithm is correct and efficient, and it has the same time complexity as the rubber-band algorithm.

Formation Vector Based Shortest Path-Planning in CGF Formation

2013 ◽  
Vol 756-759 ◽  
pp. 3351-3355
Author(s):  
Fei Jie ◽  
Zhao Han Lu ◽  
Bao Di Xie
Keyword(s):  
Path Planning ◽  
Shortest Path ◽  
Approximation Method ◽  
Change Process ◽  
Simulation System ◽  
Planning Method ◽  
Experimental Results ◽  
The Poor ◽  
Improved Algorithm

In order to improve the poor reality and bad flexibility of the mapping relationship which matched entities with aim locations in traditional approximation method, the formation vector shortest path-planning method was presented in this paper. By analyzing the lack of aim path-planning in the approximation method, shortest path-planning was discussed and was improved by introducing the formation vector and the idea of pheromone. Furthermore, the improved algorithm was applied in a CGF simulation system. The experimental results showed that the mapping relationship had better reality and rationality and the possibility of collision was significantly reduced than the traditional formation change process.

Research on Improved Floyd Routing Algorithm in Opportunistic Networks

2014 ◽  
Vol 519-520 ◽  
pp. 227-230 ◽  
Author(s):  
Sui Lin ◽  
Yuang Li ◽  
Pei Shan Chen
Keyword(s):  
Shortest Path ◽  
Routing Algorithm ◽  
Opportunistic Networks ◽  
Shortest Path Algorithm ◽  
Space Factor ◽  
Community Model ◽  
Direct Delivery ◽  
Simulation Results ◽  
First Contact ◽  
Improved Algorithm

According to the traditional shortest path algorithm is not suitable for the routing choice in community model of Opportunistic Networks, we propose an improved Floyd shortest path algorithm. This improved algorithm not only considers the space factor between the nodes in opportunistic networks, but also takes into account the time factor of the wireless links.The simulation results show that, compared with the existing FC(First Contact), DD(Direct Delivery) routing algorithm, this improved algorithm can more effectively get the shortest delay paths in opportunistic networks.

scholarly journals An Improved Algorithm for Finding All Pair Shortest Path

2012 ◽  
Vol 47 (25) ◽  
pp. 35-37
Author(s):  
Himanshu Garg ◽  
Paramjeet Rawat
Keyword(s):  
Shortest Path ◽  
Improved Algorithm

The Research on Shortest Path Base on Yantai Vocational College

2012 ◽  
Vol 482-484 ◽  
pp. 368-371
Author(s):  
Peng Li ◽  
Rui Feng Wang
Keyword(s):  
Complex Network ◽  
Shortest Path ◽  
Vocational College ◽  
Algorithm Efficiency ◽  
Advantages And Disadvantages ◽  
Road Map ◽  
Size Number ◽  
Traditional Algorithm ◽  
The Individual ◽  
Improved Algorithm

This paper based on the complex network, this paper expounds the advantages and disadvantages of traditional shortest path algorithm, this paper puts forward the traditional path finding algorithm of the improved algorithm, the improved algorithm is compared with the traditional algorithm between the search efficiency, and all the differences between the improved algorithm to solve complex network in size, number of nodes under the condition of the shortest path problem. The test shows that the improved algorithm efficiency in the later has obviously advantages, which are embodied in the space greatly reduce the complexity, the execution time also greatly reduced. But the individual the improved algorithm also has limitations. At last, this paper introduces the improved algorithm in yantai vocational college for the application of road map.

Sign in / Sign up

Export Citation Format

Share Document