Sciweavers

366 search results - page 42 / 74
» Parallel Search Algorithms for Robot Motion Planning
Sort
View
67
Voted
IROS
2006
IEEE
166views Robotics» more  IROS 2006»
15 years 3 months ago
Anytime RRTs
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
Dave Ferguson, Anthony Stentz
74
Voted
IJRR
2000
113views more  IJRR 2000»
14 years 9 months ago
Sensor-Based Exploration: The Hierarchical Generalized Voronoi Graph
The hierarchical generalized Voronoi graph (HGVG) is a new roadmap developed for sensor-based exploration in unknown environments. This paper defines the HGVG structure: a robot c...
Howie Choset, Joel W. Burdick
IROS
2008
IEEE
151views Robotics» more  IROS 2008»
15 years 4 months ago
Transition-based RRT for path planning in continuous cost spaces
This paper presents a new method called Transition-based RRT (T-RRT) for path planning problems in continuous cost spaces. It combines the exploration strength of the RRT algorith...
Leonard Jaillet, Juan Cortés, Thierry Sim&e...
AAAI
2007
14 years 12 months ago
Parallel Structured Duplicate Detection
We describe a novel approach to parallelizing graph search using structured duplicate detection. Structured duplicate detection was originally developed as an approach to external...
Rong Zhou, Eric A. Hansen
TSMC
1998
82views more  TSMC 1998»
14 years 9 months ago
To push or not to push: on the rearrangement of movable objects by a mobile robot
—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...
Ohad Ben-Shahar, Ehud Rivlin