A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A CooperativeQ-Learning Path Planning Algorithm for Origin-Destination Pairs in Urban Road Networks
2015
Mathematical Problems in Engineering
As an important part of intelligent transportation systems, path planning algorithms have been extensively studied in the literature. Most of existing studies are focused on the global optimization of paths to find the optimal path between Origin-Destination (OD) pairs. However, in urban road networks, the optimal path may not be always available when some unknown emergent events occur on the path. Thus a more practical method is to calculate several suboptimal paths instead of finding only one
doi:10.1155/2015/146070
fatcat:w7lk6uytojdwnbp4udsxaswzry