Polygon-Based Random Tree Search Algorithm for a Size-Changing Robot
- Authors
- Bae, Jangho; Park, Sumin; Yim, Mark; Seo, TaeWon
- Issue Date
- Jul-2022
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Keywords
- Actuators; Cellular and Modular Robots; Kinematics; Motion and Path Planning; Partitioning algorithms; Prototypes; Robots; Topology; Trajectory
- Citation
- IEEE Robotics and Automation Letters, v.7, no.3, pp.8100 - 8105
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE Robotics and Automation Letters
- Volume
- 7
- Number
- 3
- Start Page
- 8100
- End Page
- 8105
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/191238
- DOI
- 10.1109/LRA.2021.3095026
- ISSN
- 2377-3766
- 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
- 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/191238)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.