Sciweavers

301 search results - page 17 / 61
» One-to-one mapping matrix
Sort
View
ICRA
2009
IEEE
149views Robotics» more  ICRA 2009»
15 years 8 months ago
On achievable accuracy for pose tracking
Abstract—This paper presents Cramér-Rao bound-like inequalities for pose tracking, which is defined as the problem of recovering the robot displacement given two successive rea...
Andrea Censi
SIGIR
2004
ACM
15 years 6 months ago
The patent retrieval task in the fourth NTCIR workshop
This paper describes the Patent Retrieval Task in the Fourth NTCIR Workshop, and the test collections produced in this task. We perform the invalidity search task, in which each p...
Atsushi Fujii, Makoto Iwayama, Noriko Kando
TIT
2010
98views Education» more  TIT 2010»
14 years 8 months ago
QR decomposition of Laurent polynomial matrices sampled on the unit circle
Abstract--We consider Laurent polynomial (LP) matrices defined on the unit circle of the complex plane. QR decomposition of an LP matrix A(s) yields QR factors Q(s) and R(s) that, ...
Davide Cescato, Helmut Bölcskei
ISRR
2005
Springer
118views Robotics» more  ISRR 2005»
15 years 7 months ago
A Provably Consistent Method for Imposing Sparsity in Feature-Based SLAM Information Filters
An open problem in Simultaneous Localization and Mapping (SLAM) is the development of algorithms which scale with the size of the environment. A few promising methods exploit the ...
Matthew Walter, Ryan Eustice, John J. Leonard
CDC
2010
IEEE
134views Control Systems» more  CDC 2010»
14 years 8 months ago
Observer design for Lipschitz systems with discrete-time measurements
In this paper, the authors investigate the problem of designing an observer for Lipschitz nonlinear systems with discrete time measurements (continuous-discrete time systems). The ...
Vincent Andrieu, Madiha Nadri