Motion planning of unicycle-like robot using single RRT with branch and bound algorithm
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yan, Rui-Jun | - |
dc.contributor.author | Wu, Jing | - |
dc.contributor.author | Lee, Ji-Yeong | - |
dc.date.accessioned | 2021-06-23T05:24:47Z | - |
dc.date.available | 2021-06-23T05:24:47Z | - |
dc.date.created | 2021-01-22 | - |
dc.date.issued | 2013-10 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/30567 | - |
dc.description.abstract | This paper presents the motion planning of unicycle-like robot using single Rapidly-exploring Random Tree (RRT) algorithm, combining with Branch and Bound (BB) method. RRT can construct the searching tree efficiently between initial configuration and goal configuration. Based on the constructed searching tree, the optimal path can be extracted with BB algorithm rapidly. Obstacles avoidance is realized by checking whether the contour points of robot locate in the space of obstacles. The simulation result in a complex environment with unicycle-like robot proves the validity of proposed algorithms. © 2013 IEEE. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE Computer Society | - |
dc.title | Motion planning of unicycle-like robot using single RRT with branch and bound algorithm | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Ji-Yeong | - |
dc.identifier.doi | 10.1109/URAI.2013.6677401 | - |
dc.identifier.scopusid | 2-s2.0-84899116579 | - |
dc.identifier.bibliographicCitation | 2013 10th International Conference on Ubiquitous Robots and Ambient Intelligence, URAI 2013, pp.599 - 601 | - |
dc.relation.isPartOf | 2013 10th International Conference on Ubiquitous Robots and Ambient Intelligence, URAI 2013 | - |
dc.citation.title | 2013 10th International Conference on Ubiquitous Robots and Ambient Intelligence, URAI 2013 | - |
dc.citation.startPage | 599 | - |
dc.citation.endPage | 601 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Algorithms | - |
dc.subject.keywordPlus | Artificial intelligence | - |
dc.subject.keywordPlus | Branch and bound method | - |
dc.subject.keywordPlus | Forestry | - |
dc.subject.keywordPlus | Linear programming | - |
dc.subject.keywordPlus | Robots | - |
dc.subject.keywordPlus | Trees (mathematics) | - |
dc.subject.keywordPlus | Branch and bounds | - |
dc.subject.keywordPlus | Branch-and-bound algorithms | - |
dc.subject.keywordPlus | Complex environments | - |
dc.subject.keywordPlus | Goal configuration | - |
dc.subject.keywordPlus | Initial configuration | - |
dc.subject.keywordPlus | Obstacles avoidance | - |
dc.subject.keywordPlus | Rapidly-exploring random trees | - |
dc.subject.keywordPlus | RRT | - |
dc.subject.keywordPlus | Motion planning | - |
dc.subject.keywordPlus | Algorithms | - |
dc.subject.keywordPlus | Artificial Intelligence | - |
dc.subject.keywordPlus | Computer Programing | - |
dc.subject.keywordPlus | Robots | - |
dc.subject.keywordAuthor | Branch and Bound algorithm | - |
dc.subject.keywordAuthor | Motion planning | - |
dc.subject.keywordAuthor | RRT | - |
dc.subject.keywordAuthor | Unicycle-like robot | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/6677401?arnumber=6677401&SID=EBSCO:edseee | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
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.