Sampling-based optimal motion planning algorithm $Q-RRT^\ast$ and its anytime extension샘플링 기반 온라인 최적 모션 계획 알고리즘 $Q-RRT^\ast$와 anytime 확장
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Kim, Jong-Hwan | - |
| dc.contributor.author | Jeong, In-bae | - |
| dc.contributor.author | 정인배 | - |
| dc.date.accessioned | 2018-05-23T19:37:11Z | - |
| dc.date.available | 2018-05-23T19:37:11Z | - |
| dc.date.issued | 2017 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=675800&flag=dissertation | en_US |
| dc.identifier.uri | http://hdl.handle.net/10203/242002 | - |
| dc.description | 학위논문(박사) - 한국과학기술원 : 전기및전자공학부, 2017.2,[v, 62 p. :] | - |
| dc.description.abstract | Motion planning is essential part of robotics. Sampling-based algorithms are widely used to solve motion planning problems. In this dissertation, a novel sampling-based motion planning algorithm is proposed to reduce time to find the initial solution and increase the convergence rate. The proposed $Q-RRT^{\ast}$ algorithm increases the convergence rate and finds a solution significantly by preserving the failed samples. The proposed algorithm is analyzed with complexity analysis and numerical simulations. Anytime extension for the proposed algorithm is presented in order to improve the remaining solution while a robot is moving toward the goal. In addition to the anytime extension, a cost functional for safe trajectory preventing collision is also proposed. The effectiveness of the proposed algorithm is verified with simulations and experiments. | - |
| dc.language | eng | - |
| dc.publisher | 한국과학기술원 | - |
| dc.subject | Robotics | - |
| dc.subject | Motion planning | - |
| dc.subject | Sampling-based algorithm | - |
| dc.subject | Probabilistic algorithm | - |
| dc.subject | Navigation | - |
| dc.subject | 로보틱스 | - |
| dc.subject | 모션 계획 | - |
| dc.subject | 샘플링 기반 알고리즘 | - |
| dc.subject | 확률적 알고리즘 | - |
| dc.subject | 네비게이션 | - |
| dc.title | Sampling-based optimal motion planning algorithm $Q-RRT^\ast$ and its anytime extension | - |
| dc.title.alternative | 샘플링 기반 온라인 최적 모션 계획 알고리즘 $Q-RRT^\ast$와 anytime 확장 | - |
| dc.type | Thesis(Ph.D) | - |
| dc.identifier.CNRN | 325007 | - |
| dc.description.department | 한국과학기술원 :전기및전자공학부, | - |
- Appears in Collection
- EE-Theses_Ph.D.(박사논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.