Name
Abstract | ||
|---|---|---|
In this paper, we present a hierarchical mapping method that allows us to obtain accurate metric maps of large environments in real time. The lower (or local) map level is composed of a set of local maps that are guaranteed to be statistically independent. The upper (or global) level is an adjacency graph whose arcs are labeled with the relative location between local maps. An estimation of these relative locations is maintained at this level in a relative stochastic map. We propose a close to optimal loop closing method that, while maintaining independence at the local level, imposes consistency at the global level at a computational cost that is linear with the size of the loop. Experimental results demonstrate the efficiency and precision of the proposed method by mapping the Ada Byron building at our campus. We also analyze, using simulations, the precision and convergence of our method for larger loops. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/TRO.2005.844673 | IEEE Transactions on Robotics |
Keywords | Field | DocType |
Simultaneous localization and mapping,Stochastic processes,Information filters,Information filtering,Computational efficiency,Computational modeling,Analytical models,Convergence,Robots,Computational complexity | Convergence (routing),Adjacency list,Motion planning,Graph,Mathematical optimization,Control theory,Algorithm,Metric map,Independence (probability theory),Mathematics,Mobile robot,Loop closing | Journal |
Volume | Issue | ISSN |
21 | 4 | 1552-3098 |
Citations | PageRank | References |
171 | 8.89 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Estrada | 1 | 171 | 8.89 |
| J. Neira | 2 | 509 | 39.39 |
| Juan Domingo | 3 | 3319 | 258.54 |