Sciweavers

1717 search results - page 240 / 344
» Geometric Robot Mapping
Sort
View
CCCG
1993
13 years 9 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
IJCAI
2007
13 years 9 months ago
Learning to Walk through Imitation
Programming a humanoid robot to walk is a challenging problem in robotics. Traditional approaches rely heavily on prior knowledge of the robot's physical parameters to devise...
Rawichote Chalodhorn, David B. Grimes, Keith Groch...
IJRR
2008
139views more  IJRR 2008»
13 years 8 months ago
Learning to Control in Operational Space
One of the most general frameworks for phrasing control problems for complex, redundant robots is operational space control. However, while this framework is of essential importan...
Jan Peters, Stefan Schaal
ICCBR
1995
Springer
13 years 11 months ago
Route Planning by Analogy
There have been several e orts to create and use real maps in computer applications that automatically nd good map routes. In general, online map representations do not include in...
Karen Zita Haigh, Manuela M. Veloso
ICIP
1998
IEEE
14 years 9 months ago
Recognizing Surfaces from 3D Curves
;I general paradigm for recognizing 3D objects is offered, and applied to some geometric primitives [sphe,res, cylinders, cones, and tori). The assumption is that Q curve on the s...
Daniel Keren, Ehud Rivlin, Ilan Shimshoni, Isaac W...