Recently, a number of more advanced shortest path learning algorithms has been proposed and developed. The Smoothest Path Algorithm (SPA) [10] is to find the shortest surface path over a terrain in terms of distance and slope rather than the Euclidean distance only. The Shortest Path Algorithm for a Fixed Start Time [11] is to compute the shortest path either for a given start time or to search the start time and the path that results in the least travelling time. However, these approaches do not consider taking advantages of one another to determine the shortest route based upon the distance, slope, time schedule, and other possible terrain obstacles together.