Filters
Improving Rapidly Exploring Trees Method Using Two Trees
The paper is focused on increasing the speed of rapidly exploring random trees method, used for path planning tasks. Original method uses single tree running from the initial node while modified version ad...
JD - Využití počítačů, robotika a její aplikace
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
Motion Planning of Self-reconfigurable Modular Robots Using Rapidly Exploring Random Trees
is based on the Rapidly Exploring Random tree algorithm, which uses physical simulation to explore the configuration space of the highly articulated robots. Due to large number of actuators in such organi...
JC - Počítačový hardware a software
- 2012 •
- D
Rok uplatnění
D - Stať ve sborníku
Motion planning in challenging environments using rapidly-exploring random trees
of the connect version of Rapidly-exploring random trees (RRT-connect) algorithm. The main not be reached because of collision, and then set them as roots to grow other random trees. It presumes ...
IN - Informatika
- 2013 •
- D
Rok uplatnění
D - Stať ve sborníku
Mobile Robot Path Planning by Means of Case-Based Reasoning and Rapidly Exploring Random Trees
for to be subsequently adapted to the new problem. Rapidly-exploring Random Trees (RRT)are used...
JD - Využití počítačů, robotika a její aplikace
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
Rapidly-Exploring Random Trees: 3D Planning
Path planning, trajectory planning and path optimizing is problematic issue in robotic domain. In this paper we use RRT algorithm (Rapidly exploring Random tree) and its variations, which are good solutions applied...
IN - Informatika
- 2012 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Path Planning for Four-Legged Walking robot using Rapidly Exploring Random Trees
There are several randomized methods for problem of path planning. Rapidly exploring random trees (RRT) is a method which can deal with constraints typical for legged walking robots, e.g. limitations in ro...
JD - Využití počítačů, robotika a její aplikace
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
Rapidly Exploring Random Trees Used for Mobile Robots Path Planning
Path planning problem in mobile robotics can be solved in several ways. Often used are probabilistic roadmaps and potential field algorithm. However, adding nonholonomic constraints into path planning algorithm can be difficult for those methods. The...
JD - Využití počítačů, robotika a její aplikace
- 2005 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
A Sampling Schema for Rapidly Exploring Random Trees Using a Guiding Path
In this paper, a novel sampling schema for Rapidly Exploring Random Trees (RRT) is proposed to address the narrow passage issue. The introduced method employs a guiding path to steer the tree growth toward...
JC - Počítačový hardware a software
- 2011 •
- O
Rok uplatnění
O - Ostatní výsledky
Rapidly Exploring Random Trees-Based Initialization of MPC Technique Designed for Formations of MAVs
optimization of the trajectory guess obtained by a Rapidly Exploring Random Trees technique...
JC - Počítačový hardware a software
- 2014 •
- D
Rok uplatnění
D - Stať ve sborníku
Sampling-Based Algorithms for the Motion Planning
The paper is focused on describing of the basic algorithms for probabilistic path planning for robots or autonomous agents.
JC - Počítačový hardware a software
- 2010 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 62 106