PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
August 6, 2014IEEE Transactions on Industrial Electronics155 citations

Kinodynamic Planner Dual-Tree RRT (DT-RRT) for Two-Wheeled Mobile Robots Using the Rapidly Exploring Random Tree

View Full Paper
CMChang-bae MoonChonnam National UniversityWCWoojin ChungKorea University

Key Points

Key points are not available for this paper at this time.

Abstract

We propose a new trajectory generation scheme called dual-tree rapidly exploring random tree (DT-RRT), which is designed on the basis of a rapidly exploring random tree (RRT) method. The DT-RRT is suitable for high-speed navigation of a two-wheeled differential mobile robot. The proposed dual tree is composed of a workspace tree and a state tree. The workspace tree finds near sets in the target workspace without considering robot kinematics. Robot trajectories are generated by the extension of the state tree under the consideration of kinematic and dynamic constraints. The proposed scheme allows for different topological structures between the workspace tree and the state tree. Owing to the different structures between two trees, flexible node extensions can be achieved. As a result, the success rate of the node extension can be increased, while the computational cost can be saved. In order to improve the quality of the trajectory, we propose a reconnect-tree scheme that can modify the generated tree structure. The advantage of the reconnect-tree scheme is that the repropagation of the conventional RRT structure is not required. From simulations, the superior performance of DT-RRT was clarified in terms of computing time and success rate. The experimental result supported high quality of the generated trajectory with fast and smooth motion of the robot.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Moon et al. (2014) studied this question.

synapsesocial.com/papers/6a0f37fc4994b59e774271cdhttps://doi.org/10.1109/tie.2014.2345351
Ask AI
Helpful
Bookmark
Share
View Full Paper