Abstract
ABSTRACT This paper focuses on the problem of automatic parking trajectory planning in unstructured scenarios. The proposed algorithm adopts a combination of graph search and optimization strategy. First, A* search is utilized to obtain paths connecting the global start and end points. Second, the path is divided into three segments and subpaths are searched using the hybrid A* algorithm and the proposed A*-iBspline algorithm. Finally, the three subpaths are merged and a valid initial guess is generated for the OCP. Additionally, an iterative framework is used to improve the quality of the OCP solution. Simulation results show that the proposed algorithm has a significant advantage over existing methods in terms of time and applicability.
Sign-in/Register to access full text options 
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.
