Sciweavers

366 search results - page 55 / 74
» Parallel Search Algorithms for Robot Motion Planning
Sort
View
ICRA
2007
IEEE
130views Robotics» more  ICRA 2007»
15 years 3 months ago
Greedy but Safe Replanning under Kinodynamic Constraints
— We consider motion planning problems for a vehicle with kinodynamic constraints, where there is partial knowledge about the environment and replanning is required. We present a...
Kostas E. Bekris, Lydia E. Kavraki
ICRA
2007
IEEE
89views Robotics» more  ICRA 2007»
15 years 3 months ago
Probabilistic Strategies for Pursuit in Cluttered Environments with Multiple Robots
Abstract— In this paper, we describe a method for coordinating multiple robots in a pursuit-evasion domain. We examine the problem of multiple robotic pursuers attempting to loca...
Geoffrey Hollinger, Athanasios Kehagias, Sanjiv Si...
CAD
2007
Springer
14 years 9 months ago
Boundary of the volume swept by a free-form solid in screw motion
The swept volume of a moving solid is a powerful computational and visualization concept. It provides an excellent aid for path and accessibility planning in robotics and for simu...
Jarek Rossignac, J. J. Kim, S. C. Song, K. C. Suh,...
AIPS
2000
14 years 11 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
86
Voted
ICRA
2008
IEEE
143views Robotics» more  ICRA 2008»
15 years 4 months ago
Adaptive workspace biasing for sampling-based planners
Abstract— The widespread success of sampling-based planning algorithms stems from their ability to rapidly discover the connectivity of a configuration space. Past research has ...
Matthew Zucker, James Kuffner, James A. Bagnell