Abstract
Recently, the optimal path search based on real-time traffic information is becoming more important in car navigation industries. The preference-based Ant Colony Optimization algorithm is suitable for the path search in a real-time traffic circumstance. However, this algorithm is not applicable to current car navigation due to the slow search time caused by the complex calculations. Likewise, sub-optimal problem is occurred according to circumstances of probability-based search and parameter settings in this algorithm. This paper presents a path search engine for the fast optimal path search, using simplified calculation and parallel architectures to apply path search algorithm. Also, A∗ architecture is added in the path search engine to supplement sub-optimal problem. The path search engine obtains the accurate optimal path and the search time improvement compared to the software-based path search in a general purpose processor that is typically used for car navigation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
