Cited 0 time in
Polygon-Based Random Tree Search Algorithm for a Size-Changing Robot
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Bae, Jangho | - |
| dc.contributor.author | Park, Sumin | - |
| dc.contributor.author | Yim, Mark | - |
| dc.contributor.author | Seo, TaeWon | - |
| dc.date.accessioned | 2023-09-26T09:40:50Z | - |
| dc.date.available | 2023-09-26T09:40:50Z | - |
| dc.date.issued | 2022-07 | - |
| dc.identifier.issn | 2377-3766 | - |
| dc.identifier.issn | 2377-3766 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/191238 | - |
| dc.description.abstract | This paper proposes the Polygon-based Random Tree search algorithm with Variable polygon size (PRT-V) for Variable Topology Truss (VTT). This algorithm improves on our previous path planning algorithm by using VTTs ability to change its size drastically. The algorithm assigns stopover points at the key locations in environments between the initial and goal points. Stopover points are used as reference points for both path planning and size adjustment. A Voronoi diagram-based roadmap method is used to automatically find appropriate stopover points. Based on the stopover points, the desired support polygons and the corresponding nominal lengths are generated by PRT-V. Then, the locomotion of VTT is generated by a non-impact locomotion algorithm to prevent tipping over. Simulations verify the performance of PRT-V in three different workspaces with obstacles. With PRT-V, VTT can squeeze through narrow passages or move efficiently in large spaces by increasing size, a unique feature. IEEE | - |
| dc.format.extent | 6 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
| dc.title | Polygon-Based Random Tree Search Algorithm for a Size-Changing Robot | - |
| dc.type | Article | - |
| dc.publisher.location | 미국 | - |
| dc.identifier.doi | 10.1109/LRA.2021.3095026 | - |
| dc.identifier.scopusid | 2-s2.0-85112605871 | - |
| dc.identifier.wosid | 000838441200041 | - |
| dc.identifier.bibliographicCitation | IEEE Robotics and Automation Letters, v.7, no.3, pp 8100 - 8105 | - |
| dc.citation.title | IEEE Robotics and Automation Letters | - |
| dc.citation.volume | 7 | - |
| dc.citation.number | 3 | - |
| dc.citation.startPage | 8100 | - |
| dc.citation.endPage | 8105 | - |
| dc.type.docType | Article | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Robotics | - |
| dc.relation.journalWebOfScienceCategory | Robotics | - |
| dc.subject.keywordPlus | Agricultural robots | - |
| dc.subject.keywordPlus | Geometry | - |
| dc.subject.keywordPlus | Learning algorithms | - |
| dc.subject.keywordPlus | Robots | - |
| dc.subject.keywordPlus | Key location | - |
| dc.subject.keywordPlus | Large spaces | - |
| dc.subject.keywordPlus | Path-planning algorithm | - |
| dc.subject.keywordPlus | Reference points | - |
| dc.subject.keywordPlus | Support polygon | - |
| dc.subject.keywordPlus | Unique features | - |
| dc.subject.keywordPlus | Variable topologies | - |
| dc.subject.keywordPlus | Voronoi diagrams | - |
| dc.subject.keywordPlus | Topology | - |
| dc.subject.keywordAuthor | Actuators | - |
| dc.subject.keywordAuthor | Cellular and Modular Robots | - |
| dc.subject.keywordAuthor | Kinematics | - |
| dc.subject.keywordAuthor | Motion and Path Planning | - |
| dc.subject.keywordAuthor | Partitioning algorithms | - |
| dc.subject.keywordAuthor | Prototypes | - |
| dc.subject.keywordAuthor | Robots | - |
| dc.subject.keywordAuthor | Topology | - |
| dc.subject.keywordAuthor | Trajectory | - |
| dc.identifier.url | https://ieeexplore.ieee.org/document/9477154 | - |
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.
