178 search results - page 32 / 36 » Algorithms for Generating Motion Trajectories Described by P... |
COMPGEOM
2010
ACM
14 years 24 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
MICCAI
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. Today, 3-D angiography volumes are routinely generated from rotational angiography sequences. In previous work [7], we have studied the precision reached by registering s...
ICRA
2003
IEEE
14 years 1 months ago
2003
IEEE
— We introduce a hierarchical variant of the probabilistic roadmap method for motion planning. By recursively refining an initially sparse sampling in neighborhoods of the C-obs...
CLOR
2006
13 years 11 months ago
2006
Abstract. A popular framework for the interpretation of image sequences is the layers or sprite model, see e.g. [1], [2]. Jojic and Frey [3] provide a generative probabilistic mode...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— Legged robots can, in principle, traverse a large variety of obstacles and terrains. In this paper, we describe a successful application of reinforcement learning to the proble...