15 search results - page 2 / 3 » Short and Smooth Polygonal Paths |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We show that cutting shortest paths from every vertex of a convex polyhedron to a simple closed quasigeodesic, and cutting all but a short segment of the quasigeodesic, unfolds th...
IROS
2006
IEEE
13 years 11 months ago
2006
IEEE
— This paper offers a path planning algorithm based on splines. The sought path avoids the obstacles, and is smooth and short. Smoothing is used as an integral part of the algori...
ICRA
2007
IEEE
13 years 11 months ago
2007
IEEE
— A central problem in robotics is planning a collision-free path for a moving object in an environment with obstacles. Contemporary applications require a path planner that is f...
COMPGEOM
2005
ACM
13 years 7 months ago
2005
ACM
We consider the existence and efficient construction of bounded curvature paths traversing constant-width regions of the plane, called corridors. We make explicit a width threshol...
FOCS
1991
IEEE
13 years 8 months ago
1991
IEEE
A polygon with two distinguished vertices, s and g, is called a street iff the two boundary chains from s to g are mutually weakly visible. For a mobile robot with on-board vision...