Cited 0 time in
Reachable Set-Based Path Planning for Automated Vertical Parking System
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Oh, In Hyuk | - |
| dc.contributor.author | Seo, Ju Won | - |
| dc.contributor.author | Kim, Jin Sung | - |
| dc.contributor.author | Chung, Chung Choo | - |
| dc.date.accessioned | 2024-06-16T22:30:14Z | - |
| dc.date.available | 2024-06-16T22:30:14Z | - |
| dc.date.issued | 2023-09 | - |
| dc.identifier.issn | 2153-0009 | - |
| dc.identifier.issn | 2153-0017 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/194758 | - |
| dc.description.abstract | This paper proposes a local path planning method with a reachable set for Automated vertical Parking Systems (APS). First, given a parking lot layout with a goal position, we define an intermediate pose for the APS to accomplish reverse parking with a single maneuver, i.e., without changing the gear shift. Then, we introduce a reachable set which is a set of points consisting of the grid points of all possible intermediate poses. Once the APS approaches the goal position, it must select an intermediate pose in the reachable set. A minimization problem was formulated and solved to choose the intermediate pose. We performed various scenarios with different parking lot conditions. We used the Hybrid-A∗ algorithm for the global path planning to move the vehicle from the starting pose to the intermediate pose and utilized clothoid-based local path planning to move from the intermediate pose to the goal pose. Additionally, we designed a controller to follow the generated path and validated its tracking performance. It was confirmed that the tracking error in the mean root square for the lateral position was bounded within 0.06m and for orientation within 0.01rad. | - |
| dc.format.extent | 7 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | IEEE | - |
| dc.title | Reachable Set-Based Path Planning for Automated Vertical Parking System | - |
| dc.type | Article | - |
| dc.publisher.location | 미국 | - |
| dc.identifier.doi | 10.1109/ITSC57777.2023.10421866 | - |
| dc.identifier.scopusid | 2-s2.0-85186531772 | - |
| dc.identifier.wosid | 001178996701031 | - |
| dc.identifier.bibliographicCitation | IEEE International Conference on Intelligent Transportation Systems, pp 1194 - 1200 | - |
| dc.citation.title | IEEE International Conference on Intelligent Transportation Systems | - |
| dc.citation.startPage | 1194 | - |
| dc.citation.endPage | 1200 | - |
| dc.type.docType | Proceedings Paper | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Automation & Control Systems | - |
| dc.relation.journalResearchArea | Computer Science | - |
| dc.relation.journalResearchArea | Transportation | - |
| dc.relation.journalWebOfScienceCategory | Automation & Control Systems | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
| dc.relation.journalWebOfScienceCategory | Transportation Science & Technology | - |
| dc.subject.keywordPlus | Intelligent vehicle highway systems | - |
| dc.subject.keywordPlus | Condition | - |
| dc.subject.keywordPlus | Gear-shifts | - |
| dc.subject.keywordPlus | Grid points | - |
| dc.subject.keywordPlus | Local path-planning | - |
| dc.subject.keywordPlus | Minimization problems | - |
| dc.subject.keywordPlus | Parking lots | - |
| dc.subject.keywordPlus | Parking systems | - |
| dc.subject.keywordPlus | Path planning method | - |
| dc.subject.keywordPlus | Reachable set | - |
| dc.subject.keywordPlus | Systems approach | - |
| dc.identifier.url | https://ieeexplore.ieee.org/document/10421866 | - |
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-1366
COPYRIGHT © 2024 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.
