Sciweavers

49 search results - page 2 / 10
» Fast C-obstacle Query Computation for Motion Planning
Sort
View
JVCA
2008
112views more  JVCA 2008»
13 years 5 months ago
Constraint-based motion synthesis for deformable models
We present a fast goal-directed motion synthesis technique that integrates sample-based planning methods with constraint-based dynamics simulation using a finite element formulati...
William Moss, Ming C. Lin, Dinesh Manocha
ICRA
2000
IEEE
176views Robotics» more  ICRA 2000»
13 years 9 months ago
RRT-Connect: An Efficient Approach to Single-Query Path Planning
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
James J. Kuffner Jr., Steven M. LaValle
ICRA
2010
IEEE
132views Robotics» more  ICRA 2010»
13 years 4 months ago
Combining planning techniques for manipulation using realtime perception
Abstract— We present a novel combination of motion planning techniques to compute motion plans for robotic arms. We compute plans that move the arm as close as possible to the go...
Ioan Alexandru Sucan, Mrinal Kalakrishnan, Sachin ...
COMPGEOM
2000
ACM
13 years 10 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
ICPR
2010
IEEE
14 years 17 days ago
Motion-Sketch Based Video Retrieval Using a Trellis Levenshtein Distance
We present a fast technique for retrieving video clips using free-hand sketched queries. Visual keypoints within each video are detected and tracked to form short trajectories, wh...
Rui Hu, John Philip Collomosse