A Shortest Path Algorithm Suitable for Navigation Software

In allusion to the shortage of hardware configuration in the mobile devices and high time-complexity of Dijkstra algorithm, the chapter 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.