Sciweavers

49 search results - page 6 / 10
» Fast C-obstacle Query Computation for Motion Planning
Sort
View
CORR
2002
Springer
104views Education» more  CORR 2002»
13 years 6 months ago
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
Michael A. Soss, Jeff Erickson, Mark H. Overmars
JPDC
2007
138views more  JPDC 2007»
13 years 6 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
ICRA
2010
IEEE
148views Robotics» more  ICRA 2010»
13 years 5 months ago
Geodesic trajectory generation on learnt skill manifolds
Abstract— Humanoid robots are appealing due to their inherent dexterity. However, these potential benefits may only be realized if the corresponding motion synthesis procedure i...
Ioannis Havoutis, Subramanian Ramamoorthy
WACV
2008
IEEE
14 years 1 months ago
Robust Human Pose Recognition Using Unlabelled Markers
In this paper, we tackle robust human pose recognition using unlabelled markers obtained from an optical marker-based motion capture system. A coarse-to-fine fast pose matching al...
Yi Wang, Gang Qian
ICRA
2007
IEEE
160views Robotics» more  ICRA 2007»
14 years 1 months ago
Motion Tasks and Force Control for Robot Manipulators on Embedded 2-D Manifolds
— In this paper we present a methodology to drive the end effector of a robotic manipulator across the surface of an object in the workspace, and at the same time the manipulator...
Xanthi Papageorgiou, Savvas G. Loizou, Kostas J. K...