256 search results - page 37 / 52 » Root shadow spaces |
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper describes an approach to cooperative localization which finds its roots in robust estimation, employing an unknown-but-bounded error model for sensor measurements. ...
ISRR
2001
Springer
14 years 3 days ago
2001
Springer
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
ICRA
2000
IEEE
13 years 11 months ago
2000
IEEE
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
APVIS
2004
13 years 9 months ago
2004
Presenting large amounts of information in a limited screen space is a significant challenge in the field of Information Visualization. With the rapid development and growing use ...
ALGORITHMICA
2005
13 years 7 months ago
2005
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...