Real-time algorithm of finding optimal path with changing weight to speed up convergence
Tan De-rong · 2004
For obtaining a satisfactory shortest path, this paper proposed an improved LRTA~* to speed up search algorithm convergence through changing value-update rules. Through the trade-off of time and quality of solution, the convergence speed was fasted. Application result shows that the method converges suboptimal solution faster than LRTA~*, it is a better algorithm to solve the satisfactory solution between O-D for a big density route network. 1 tab, 1 fig, 8 refs.