Results 221 to 230 of about 142,389 (277)
Some of the next articles are maybe not open access.
Expert Systems With Applications, 2019
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.
In Bae Jeong, Jong-Hwan Kim
exaly +2 more sources
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.
In Bae Jeong, Jong-Hwan Kim
exaly +2 more sources
ATS-RRT*: an improved RRT* algorithm based on alternative paths and triangular area sampling
Adv. Robotics, 2023The Rapidly Exploring Random Tree Star (RRT*) is a probabilistically complete algorithm. It is recognized as a better path planning algorithm, but its path quality and path planning speed still have room for improvement.
Zhi-wei Zhang +4 more
semanticscholar +1 more source
IEEE Transactions on Automation Science and Engineering, 2022
This article presents a reliable and robust rapidly exploring random tree (R2-RRT*) algorithm to tackle challenges in mission planning of off-road autonomous ground vehicles (AGVs) under uncertain terrain environment.
Chen Jiang +6 more
semanticscholar +1 more source
This article presents a reliable and robust rapidly exploring random tree (R2-RRT*) algorithm to tackle challenges in mission planning of off-road autonomous ground vehicles (AGVs) under uncertain terrain environment.
Chen Jiang +6 more
semanticscholar +1 more source
SR-RRT: Selective retraction-based RRT planner
2012 IEEE International Conference on Robotics and Automation, 2012We present a novel retraction-based planner, selective retraction-based RRT, for efficiently handling a wide variety of environments that have different characteristics. We first present a bridge line-test that can identify regions around narrow passages, and then perform an optimization-based retraction operation selectively only at those regions.
null Junghwan Lee +3 more
openaire +1 more source
Proceedings of the 8th ACM SIGGRAPH Conference on Motion in Games, 2015
This paper presents a novel algorithm for real-time path-planning in a dynamic environment such as a computer game. We utilize a real-time sampling approach based on the Rapidly Exploring Random Tree (RRT) algorithm that has enjoyed wide success in robotics. More specifically, our algorithm is based on the RRT* and informed RRT* variants. We contribute
Rajamäki, Joose +3 more
openaire +3 more sources
This paper presents a novel algorithm for real-time path-planning in a dynamic environment such as a computer game. We utilize a real-time sampling approach based on the Rapidly Exploring Random Tree (RRT) algorithm that has enjoyed wide success in robotics. More specifically, our algorithm is based on the RRT* and informed RRT* variants. We contribute
Rajamäki, Joose +3 more
openaire +3 more sources
IEEE transactions on industrial electronics (1982. Print), 2021
This article presents a framework that extends a rapidly exploring random tree (RRT) algorithm to plan the motion for a wheeled robot under kinodynamic constraints.
Biao Hu, Zhengcai Cao, Mengchu Zhou
semanticscholar +1 more source
This article presents a framework that extends a rapidly exploring random tree (RRT) algorithm to plan the motion for a wheeled robot under kinodynamic constraints.
Biao Hu, Zhengcai Cao, Mengchu Zhou
semanticscholar +1 more source
IEEE Transactions on Automation Science and Engineering
Rapidly-exploring random tree (RRT) has been studied for autonomous parking as it quickly finds an initial path and is easily scalable in complex environments. However, the planning time increases by searching for the path in narrow parking spots.
Minsoo Kim, Joonwoo Ahn, Jaeheung Park
semanticscholar +1 more source
Rapidly-exploring random tree (RRT) has been studied for autonomous parking as it quickly finds an initial path and is easily scalable in complex environments. However, the planning time increases by searching for the path in narrow parking spots.
Minsoo Kim, Joonwoo Ahn, Jaeheung Park
semanticscholar +1 more source
RRT: MODALITIES - ANTICOAGULATION
Acta Clinica Belgica, 2007(2007). RRT: MODALITIES - ANTICOAGULATION. Acta Clinica Belgica: Vol. 62, No. sup2, pp. 362-364.
openaire +2 more sources
Steps toward derandomizing RRTs
Proceedings of the Fourth International Workshop on Robot Motion and Control (IEEE Cat. No.04EX891), 2004We present two new motion planning algorithms, based on the rapidly exploring random tree (RRT) family of algorithms. These algorithms represent the first work in the direction of derandomizing RRTs; this is a very challenging problem due to the way randomization is used in RRTs.
Stephen R. Lindemann, Steven M. LaValle
openaire +1 more source
RRT-blossom: RRT with a local flood-fill behavior
Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006., 2006This paper proposes a new variation of the RRT planner which demonstrates good performance on both loosely-constrained and highly-constrained environments. The key to the planner is an implicit flood-fill-like mechanism, a technique that is well suited to escaping local minima in highly constrained problems.
M. Kalisiak, M. van de Panne
openaire +1 more source