41 search results - page 4 / 9 » Computing simple paths among obstacles |
LATIN
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
FOCM
2002
13 years 7 months ago
2002
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
— We introduce a method for constructing provably safe smooth feedback laws for car-like robots in obstaclecluttered polygonal environments. The robot is taken to be a point with...
DNA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Nature is considered one promising area to search for inspiration in designing robotic systems. Some work in swarm robotics has tried to build systems that resemble distr...
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— This article presents an efficient and mature visionbased navigation algorithm based on a sensory-motor learning. Neither Cartesian nor topological map is required, bu...