49 search results - page 4 / 10 » Fast C-obstacle Query Computation for Motion Planning |
IJRR
2008
13 years 7 months ago
2008
We develop a new motion planning algorithm for a variant of a Dubins car with binary left/right steering and apply it to steerable needles, a new class of flexible beveltip medica...
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
— Our goal is to create roadmaps that are particularly suited for motion planning in virtual environments. We use our Reachability Roadmap Method to compute an initial, resolutio...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d > 1 deletions, can we establish as ...
SMA
2010
ACM
13 years 7 months ago
2010
ACM
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
ICRA
2000
IEEE
13 years 12 months ago
2000
IEEE
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...