Sciweavers

Share
8 search results - page 1 / 2
» Treemap: An O(log n) Algorithm for Simultaneous Localization...
Sort
View
AROBOTS
2006
95views more  AROBOTS 2006»
9 years 10 months ago
Treemap: An O(log n) algorithm for indoor simultaneous localization and mapping
This article presents a very efficient SLAM algorithm that works by hierarchically dividing a map into local regions and subregions. At each level of the hierarchy each region sto...
Udo Frese
SPATIALCOGNITION
2004
Springer
10 years 3 months ago
Treemap: An O(log n) Algorithm for Simultaneous Localization and Mapping
This paper presents a very efficient SLAM algorithm that works by hierarchically dividing the map into local regions and subregions. At each level of the hierarchy each region stor...
Udo Frese
IVS
2008
121views more  IVS 2008»
9 years 10 months ago
Using treemaps for variable selection in spatio-temporal visualisation
We demonstrate and reflect upon the use of enhanced treemaps that incorporate spatial and temporal ordering for exploring a large multivariate spatio-temporal data set. The result...
Aidan Slingsby, Jason Dykes, Jo Wood
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
10 years 4 months ago
A Proof for the Approximate Sparsity of SLAM Information Matrices
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
Udo Frese
FSTTCS
2004
Springer
10 years 3 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
books