A Hierarchical Motion Planning Framework for Autonomous Driving in Structured Highway Environments
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Dongchan | - |
dc.contributor.author | Kim, Gihoon | - |
dc.contributor.author | Kim, Hayoung | - |
dc.contributor.author | Huh, Kunsoo | - |
dc.date.accessioned | 2022-07-06T10:19:16Z | - |
dc.date.available | 2022-07-06T10:19:16Z | - |
dc.date.created | 2022-03-07 | - |
dc.date.issued | 2022-02 | - |
dc.identifier.issn | 2169-3536 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/139583 | - |
dc.description.abstract | This paper presents an efficient hierarchical motion planning framework with a long planning horizon for autonomous driving in structured environments. A 3D motion planning with time information is a non-convex problem because there exists more than one local minimum point and various constraints such as roads and obstacles. Accordingly, to deal with high computational complexity and the problem of falling into a local minimum in an enormous solution space, a decoupled method is utilized, that consists of two steps: Long-term planning and short-term planning. First, the long-term planner provides reasonable far-sighted behavior through two processes. In the first process, a rough path that includes a driving strategy is generated in the 2D spatial space. Then, the jump point search algorithm is utilized with time information on the path to reduce the computational burden of A*, giving an acceptable quality of solution at the same time. In this step, a safe, comfortable, and dynamically feasible trajectory is generated. Next, the short-term planner optimizes a short-sighted trajectory using particle swarm optimization. In this method, a steering angle set is encoded as a particle, resulting in a safe, comfortable, and kinodynamically feasible trajectory. The proposed algorithm is implemented and evaluated in a range of vehicle-in-the-loop simulation scenarios, which include various virtual static and dynamic obstacles generated by Intelligent Driver Model. In the evaluation results, the proposed method reduced the computation time by up to 0.696 s with increasing the step cost by up to about 3%. The proposed algorithm is executed every 100 ms for a planning horizon of 10 seconds, and the average computation time is 31 ms with the worst-case computation time of 94 ms. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | A Hierarchical Motion Planning Framework for Autonomous Driving in Structured Highway Environments | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Huh, Kunsoo | - |
dc.identifier.doi | 10.1109/ACCESS.2022.3152187 | - |
dc.identifier.scopusid | 2-s2.0-85124841970 | - |
dc.identifier.wosid | 000764119200001 | - |
dc.identifier.bibliographicCitation | IEEE ACCESS, v.10, pp.20102 - 20117 | - |
dc.relation.isPartOf | IEEE ACCESS | - |
dc.citation.title | IEEE ACCESS | - |
dc.citation.volume | 10 | - |
dc.citation.startPage | 20102 | - |
dc.citation.endPage | 20117 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | Y | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | Autonomous vehicles | - |
dc.subject.keywordPlus | Motion planning | - |
dc.subject.keywordPlus | Particle swarm optimization (PSO) | - |
dc.subject.keywordPlus | Trajectories | - |
dc.subject.keywordPlus | Autonomous driving | - |
dc.subject.keywordPlus | Computation time | - |
dc.subject.keywordPlus | Dijkstra | - |
dc.subject.keywordPlus | Dijkstrum’ | - |
dc.subject.keywordPlus | Jump point search algorithm | - |
dc.subject.keywordPlus | Motion-planning | - |
dc.subject.keywordPlus | Planning framework | - |
dc.subject.keywordPlus | Planning horizons | - |
dc.subject.keywordPlus | S-algorithms | - |
dc.subject.keywordPlus | Search Algorithms | - |
dc.subject.keywordPlus | Learning algorithms | - |
dc.subject.keywordAuthor | Planning | - |
dc.subject.keywordAuthor | Trajectory | - |
dc.subject.keywordAuthor | Heuristic algorithms | - |
dc.subject.keywordAuthor | Vehicle dynamics | - |
dc.subject.keywordAuthor | Trajectory planning | - |
dc.subject.keywordAuthor | Autonomous vehicles | - |
dc.subject.keywordAuthor | Dynamics | - |
dc.subject.keywordAuthor | Motion planning | - |
dc.subject.keywordAuthor | Dijkstra&apos | - |
dc.subject.keywordAuthor | s algorithm | - |
dc.subject.keywordAuthor | jump point search algorithm | - |
dc.subject.keywordAuthor | particle swarm optimization | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/9715096 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.