Neural Motion Planning for Autonomous Parking
- Authors
- Kim, Dongchan; Huh, Kunsoo
- Issue Date
- Apr-2023
- Publisher
- INST CONTROL ROBOTICS & SYSTEMS, KOREAN INST ELECTRICAL ENGINEERS
- Keywords
- Autonomous parking; conditional variational autoencoder; efficient state expansion; hybrid A* algorithm; neural motion planning
- Citation
- INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS, v.21, no.4, pp.1309 - 1318
- Indexed
- SCIE
SCOPUS
KCI
- Journal Title
- INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS
- Volume
- 21
- Number
- 4
- Start Page
- 1309
- End Page
- 1318
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/184856
- DOI
- 10.1007/s12555-022-0082-z
- ISSN
- 1598-6446
- Abstract
- This paper presents a hybrid motion planning strategy that combines a deep generative network with a conventional motion planning method. Existing planning methods such as A* and Hybrid A* are widely used in path planning tasks because of their ability to determine feasible paths even in complex environments; however, they have limitations in terms of efficiency. To overcome these limitations, a path planning algorithm based on a neural network, namely the neural Hybrid A*, is introduced. This paper proposes using a conditional variational autoencoder (CVAE) to guide the search algorithm by exploiting the ability of CVAE to learn information about the planning space given the information of the parking environment. An efficient expansion strategy is utilized based on a distribution of feasible trajectories learned in the demonstrations. The proposed method effectively learns the representations of a given state, and shows improvement in terms of computational time and the number of node expanded related to algorithm performance.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 미래자동차공학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/184856)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.