NobleBlocks

Research indexJournal article

Algorithm for Minimum-Time Path Based on Virtual Length

Huang, Zhang, Wang

1 Jan 2009

NobleIDark:/48914/w1/20260521/3EABC2ADDOI10.1109/bmei.2009.5304825

Paywalled

The full text is at the publisher

You can read the abstract here, or open it at the publisher.

Read at the publisher

Abstract

There are only two variables including vehicle speed and the length of path in existing search algorithms for minimum time path. The model does not include weather and road environment which impact the travel time. So the practical application of the model is not satisfactory. Important variables are considered in this paper, such as length of path, road grade, weather and human activities. We put forward the concept of virtual length of the path, and present the solution of the algorithm. Compared with the present search algorithm, the average travel time is saved by 17.73% according to the simulation result, and it improves the practical value in engineering applications.

Discussion

Citations

Topics

More

Suggest a correction or report