DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jeong, In-Bae | ko |
dc.contributor.author | Lee, Seung-Jae | ko |
dc.contributor.author | Kim, Jong-Hwan | ko |
dc.date.accessioned | 2019-04-15T14:10:36Z | - |
dc.date.available | 2019-04-15T14:10:36Z | - |
dc.date.created | 2019-03-26 | - |
dc.date.created | 2019-03-26 | - |
dc.date.created | 2019-03-26 | - |
dc.date.issued | 2019-06 | - |
dc.identifier.citation | EXPERT SYSTEMS WITH APPLICATIONS, v.123, pp.82 - 90 | - |
dc.identifier.issn | 0957-4174 | - |
dc.identifier.uri | http://hdl.handle.net/10203/253918 | - |
dc.description.abstract | The Rapidly-exploring Random Tree (RRT) algorithm is a popular algorithm in motion planning problems. The optimal RRT (RRT*) is an extended algorithm of RRT, which provides asymptotic optimality. This paper proposes Quick-RRT* (Q-RRT*), a modified RRT* algorithm that generates a better initial solution and converges to the optimal faster than RRT*. Q-RRT* enlarges the set of possible parent vertices by considering not only a set of vertices contained in a hypersphere, as in RRT*, but also their ancestry up to a user-defined parameter, thus, resulting in paths with less cost than those of RRT*. It also applies a similar technique to the rewiring procedure resulting in acceleration of the tendency that near vertices share common parents. Since the algorithm proposed in this paper is a tree extending algorithm, it can be combined with other sampling strategies and graph-pruning algorithms. The effectiveness of Q-RRT* is demonstrated by comparing the algorithm with existing algorithms through numerical simulations. It is also verified that the performance can be further enhanced when combined with other sampling strategies. (C) 2019 Elsevier Ltd. All rights reserved. | - |
dc.language | English | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.title | Quick-RRT*: Triangular inequality-based implementation of RRT* with improved initial solution and convergence rate | - |
dc.type | Article | - |
dc.identifier.wosid | 000460711300006 | - |
dc.identifier.scopusid | 2-s2.0-85059900949 | - |
dc.type.rims | ART | - |
dc.citation.volume | 123 | - |
dc.citation.beginningpage | 82 | - |
dc.citation.endingpage | 90 | - |
dc.citation.publicationname | EXPERT SYSTEMS WITH APPLICATIONS | - |
dc.identifier.doi | 10.1016/j.eswa.2019.01.032 | - |
dc.contributor.localauthor | Kim, Jong-Hwan | - |
dc.contributor.nonIdAuthor | Jeong, In-Bae | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | RRT | - |
dc.subject.keywordAuthor | Sampling-based algorithms | - |
dc.subject.keywordAuthor | Navigation | - |
dc.subject.keywordAuthor | Motion planning | - |
dc.subject.keywordAuthor | Optimal path planning | - |
dc.subject.keywordPlus | PROBABILISTIC ROADMAPS | - |
dc.subject.keywordPlus | MOTION | - |
dc.subject.keywordPlus | ROBOT | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.