Dynamic Shortest Path Planning with Lookahead Traffic Information
Keywords: Dynamic path planning, Lookahead traffic information
TL;DR: This paper presents a dynamic path planning approach that uses lookahead traffic information
Abstract: This paper presents a dynamic shortest path planning approach that addresses traffic uncertainty and time-dependency, with a focus on utilizing lookahead traffic information. Building on the approximate dynamic programming (ADP) algorithm, the approach is tested against a deterministic path planning baseline for comparison. Preliminary case studies demonstrate that the proposed dynamic path planning enhances the algorithm’s ability to anticipate and adapt to dynamic changes by integrating lookahead information on future traffic conditions.
Submission Number: 10
Loading