Sciweavers

293 search results - page 7 / 59
» Geometric algorithms for clearance based optimal path comput...
Sort
View
CCCG
1996
13 years 8 months ago
Heuristic Motion Planning with Many Degrees of Freedom
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Thomas Chadzelek, Jens Eckstein, Elmar Schöme...
ICASSP
2011
IEEE
12 years 11 months ago
A near-optimal least squares solution to received signal strength difference based geolocation
A simple geometric interpretation for received signal strength (RSS) difference based geolocation can be illustrated by considering a plane containing a single pair of receivers a...
Sichun Wang, Robert J. Inkol
ACCV
2009
Springer
14 years 2 months ago
Skeleton Graph Matching Based on Critical Points Using Path Similarity
This paper proposes a novel graph matching algorithm based on skeletons and applies it to shape recognition based on object silhouettes. The main idea is to match the critical poin...
Yao Xu, Bo Wang, Wenyu Liu, Xiang Bai
IPSN
2011
Springer
12 years 10 months ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...
ICCV
2005
IEEE
14 years 9 months ago
Globally Optimal Estimates for Geometric Reconstruction Problems
We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or ...
Fredrik Kahl, Didier Henrion