Sciweavers

1147 search results - page 125 / 230
» Differential Matching Constraints
Sort
View
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
14 years 3 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
NHM
2010
87views more  NHM 2010»
13 years 5 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
ICPR
2006
IEEE
14 years 11 months ago
Robust Alignment of Transmission Electron Microscope Tilt Series
In this paper, we propose a novel method for automatic, feature-based alignment of transmission electron microscope images that is needed for computing 3D reconstructions in elect...
Sami S. Brandt, Ulrike Ziese
STACS
2010
Springer
14 years 5 months ago
Exact Covers via Determinants
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
Andreas Björklund
IROS
2009
IEEE
172views Robotics» more  IROS 2009»
14 years 4 months ago
Pairwise region-based scan alignment
— In this paper, we present a new algorithm for the alignment of two 3D scans. The approach uses a region-based matching technique. We make no assumptions about the initial posit...
Carla Silva Rocha Aguiar, Sébastien Druon, ...