Sciweavers

366 search results - page 22 / 74
» Parallel Search Algorithms for Robot Motion Planning
Sort
View
79
Voted
AROBOTS
2005
100views more  AROBOTS 2005»
14 years 9 months ago
A Sampling-Based Motion Planning Approach to Maintain Visibility of Unpredictable Targets
This paper deals with the surveillance problem of computing the motions of one or more robot observers in order to maintain visibility of one or several moving targets. The target...
Rafael Murrieta-Cid, Benjamín Tovar, Seth H...
ICRA
2009
IEEE
196views Robotics» more  ICRA 2009»
14 years 7 months ago
CHOMP: Gradient optimization techniques for efficient motion planning
Abstract-- Existing high-dimensional motion planning algorithms are simultaneously overpowered and underpowered. In domains sparsely populated by obstacles, the heuristics used by ...
Nathan D. Ratliff, Matt Zucker, J. Andrew Bagnell,...
ICRA
2009
IEEE
121views Robotics» more  ICRA 2009»
15 years 4 months ago
Task-space trajectories via cubic spline optimization
Abstract— We consider the task of planning smooth trajectories for robot motion. In this paper we make two contributions. First we present a method for cubic spline optimization;...
J. Zico Kolter, Andrew Y. Ng
ICRA
2007
IEEE
125views Robotics» more  ICRA 2007»
15 years 3 months ago
Single-Query Motion Planning with Utility-Guided Random Trees
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...
Brendan Burns, Oliver Brock
74
Voted
IROS
2007
IEEE
131views Robotics» more  IROS 2007»
15 years 3 months ago
A hybrid approach for complete motion planning
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
Liangjun Zhang, Young J. Kim, Dinesh Manocha