Real-time algorithm of finding optimal path with changing weight to speed up convergence

TAN De-rong; YAN Xin-ping

Volume 4 Issue 1

Turn off MathJax

Article Contents

Article Navigation > Journal of Traffic and Transportation Engineering > 2004 > 4(1): 118-120

Next Previous

TAN De-rong, YAN Xin-ping. Real-time algorithm of finding optimal path with changing weight to speed up convergence[J]. Journal of Traffic and Transportation Engineering, 2004, 4(1): 118-120.

Citation:

TAN De-rong, YAN Xin-ping. Real-time algorithm of finding optimal path with changing weight to speed up convergence[J]. Journal of Traffic and Transportation Engineering, 2004, 4(1): 118-120.

TAN De-rong, YAN Xin-ping. Real-time algorithm of finding optimal path with changing weight to speed up convergence[J]. Journal of Traffic and Transportation Engineering, 2004, 4(1): 118-120.

Citation:

TAN De-rong, YAN Xin-ping. Real-time algorithm of finding optimal path with changing weight to speed up convergence[J]. Journal of Traffic and Transportation Engineering, 2004, 4(1): 118-120.

PDF( 233 KB)

Real-time algorithm of finding optimal path with changing weight to speed up convergence

TAN De-rong^1
,,
YAN Xin-ping²

1.
School of Transportation, Shandong University of Technology, Zibo 255012, China
2.
ITS Center, Wuhan University of Technology, Wuhan 430063, China

More Information

Author Bio:
TAN De-rong(1963-), male, associate professor, doctoral student, 86-533-2313644, tdrong163@163.com
Received Date: 2003-04-15
Publish Date: 2004-02-25

Abstract

Abstract

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.
- intelligent transport,
- optimal path,
- heuristic search algorithm,
- artificial intelligence,
- value-update rules

FullText(HTML)

References(8)

References

[1]	Korf R E. Real-time heuristic search[J]. Artificial Intelligence, 1990, 42(2): 189-211. https://www.cnki.com.cn/Article/CJFDTOTAL-MSSB201903001.htm
[2]	Hamidzadeh B, Shekar S D. A real-time planning algorithm to meet response time constrains in dynamic environments[A]. In Proceedings of the IEEE International Conference on Tools for AI[C]. Boston: IEEE, Piscataway, NJ, USA, 1991.
[3]	Ishida T, Korf R E. Moving target search[A]. In Proceedings of the 12^th International Joint Conference on AI[C]. AAAI Menlo Park, USA, 1991.
[4]	Shida I T. Moving target search with intelligence[A]. In Proceedings of the 10^th National Conference on AI[C]. AAAI Menlo Park, USA, 1992.
[5]	Chimura F, Tokoro M. The trailblazer search: a new method for searching and capturing moving targets[A]. In Proceedings of the 12^th National Conference on AI[C]. AAAI Menlo Park, USA, 1994.
[6]	Hamidzadeh B. Shekar S. Deadline compliance, predictability and on-line optimization in real-time problem solving[A]. In Proceedingsof the International Joint Conference on AI[C]. AAAI Menlo Park, USA, 1995.
[7]	Ishida T, Shimbo M. Improving the learning efficiencies of realtime search[J]. IEEE Transportaiton on Software Engineering, 1996, 13(6): 305-310. https://www.cnki.com.cn/Article/CJFDTOTAL-XTYD202102006.htm
[8]	Shekar S, Hamidzadeh B. Evaluation of real-time search algorithms in dynamic environments[A]. In Proceeding of the IEEE International Conference on Tools for AI[C]. Boston: IEEE, Piscataway, NJ, USA, 1992.