This paper proposes a hierarchical path-planning algorithm based on a combination of graphical search algorithms and optimization methods. In the global path planning layer, by using the Hybrid A* algorithm, we can quickly obtain an optimal path that can avoid all static obstacles on the map. In the local path planning layer, the global path is optimized by numerical nonlinear numerical optimization to generate a feasible path that satisfies the safety constraints. By processing global path planning and local path planning separately, the computational complexity of path planning can be effectively reduced, and the efficiency and accuracy of the path planning can be improved. Secondly, the hybrid planning algorithm can generate high-quality paths with both safety and flexibility. We simulate and verify the algorithm, and the results show that the method has practical applications in autonomous driving.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.