Abstract
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 stores a matrix representing some of the landmarks contained in this region. For keeping the matrices small only those landmarks are represented being observable from outside the region. A measurement is integrated into a local subregion using O(k 2) computation time for k landmarks in a subregion. When the robot moves to a different subregion a global update is necessary requiring only O(k 3 log n) computation time for n overall landmarks. The algorithm is evaluated for map quality, storage space and computation time using simulated and real experiments in an office environment.
Keywords
- Extend Kalman Filter
- Simultaneous Localization
- Real World Experiment
- Information Block
- Suitable Building
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gauss, C.: Theoria combinationis observationum erroribus minimis obnoxiae. Commentationes societatis regiae scientiarum Gottingensis recentiores 5, 6–93 (1821)
Frese, U., Hirzinger, G.: Simultaneous localization and mapping - a discussion. In: Proceedings of the IJCAI Workshop on Reasoning with Uncertainty in Robotics, Seattle, pp. 17–26 (2001)
Frese, U.: A discussion of simultaneous localization and mapping. Autonomous Robots (2004) (submitted)
Frese, U.: An O(logn) Algorithm for Simulateneous Localization and Mapping of Mobile Robots in Indoor Environments. PhD thesis, University of Erlangen-Nürnberg (2004)
McNamara, T.: How are the locations of objects in the environment represented in memory? In: Freksa, C., Brauer, W., Wender, C.H.K. (eds.) Spatial cognition III: Routes and navigation, human memory and learning, spatial representation and spatial reasoning, pp. 174–191. Springer-, Berlin (2003)
Moratz, R., Tenbrink, T., Bateman, J., Fischer, K.: Spatial knowledge representation for human-robot interaction. In: Freksa, C., Brauer, W., Habel, C., Wender, K. (eds.) Spatial Cognition III, pp. 263–286. Springer, Heidelberg (2003)
Skubic, M., Perzanowski, D., Blisard, S., Schultz, A., Adams, W., Bugajska, M., Brock, D.: Spatial language for human-robot dialogs. IEEE Transactions on System Man Cybernetics Part C 34, 154–167 (2004)
Smith, R., Self, M., Cheeseman, P.: Estimating uncertain spatial relationships in robotics. In: Cox, I., Wilfong, G. (eds.) Autonomous Robot Vehicles, pp. 167–193. Springer, New York (1988)
Thrun, S.: Robotics mapping: A survey. Technical report, School of Computer Science, Carnegie Mellon University (2002)
Duckett, T., Marsland, S., Shapiro, J.: Learning globally consistent maps by relaxation. In: Proceedings of the IEEE International Conference on Robotics and Automation, San Francisco, pp. 3841–3846 (2000)
Duckett, T., Marsland, S., Shapiro, J.: Fast, on-line learning of globally consistent maps. Autonomous Robots 12, 287–300 (2002)
Frese, U., Larsson, P., Duckett, T.: A multigrid algorithm for simultaneous localization and mapping. IEEE Transactions on Robotics (2004) (to appear)
Montemerlo, M., Thrun, S., Koller, D., Wegbreit, B.: FastSLAM: A factored solution to the simultaneous localization and mapping problem. In: Proceedings of the AAAI National Conference on Artificial Intelligence, Edmonton, pp. 593–598 (2002)
Guivant, J., Nebot, E.: Solving computational and memory requirements of feature based simultaneous localization and map building algorithms. Technical report, Australian Centre for Field Robotics, University of Sydney, Sydney (2002)
Thrun, S., Koller, D., Ghahramani, Z., Durrant-Whyte, H.: Simultaneous mapping and localization with sparse extended information filters: Theory and initial results. In: Proceedings of the Fifth International Workshop on Algorithmic Foundations of Robotics, Nice (2002)
Press, W., Teukolsky, S., Vetterling, W., Flannery, B.: Numerical Recipes, 2nd edn. Cambridge University Press, Cambridge (1992)
Bosse, M., Newman, P., Leonard, J., Teller, S.: SLAM in large-scale cyclic environments using the Atlas framework. International Journal on Robotics Research (2003) (to appear)
Paskin, M.: Thin junction tree filters for simultaneous localization and mapping. In: Gottlob, G., Walsh, T. (eds.) Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), San Francisco, pp. 1157–1164 (2003)
Lu, F., Milios, E.: Globally consistent range scan alignment for environment mapping. Autonomous Robots 4, 333–349 (1997)
Gutmann, J., Konolige, K.: Incremental mapping of large cyclic environments. In: Proceedings of the IEEE International Symposium on Computational Intelligence in Robotics and Automation, Monterey (1999)
Fiduccia, C., Mattheyses, R.: A linear-time heuristic for improving network partitions. In: Proceedings of the 19th ACM/IEEE Design Automation Conference, Las Vegas, pp. 175–181 (1982)
Hähnel, D., Burgard, W., Wegbreit, B., Thrun, S.: Towards lazy data association in SLAM. In: Proceedings of the 10th International Symposium of Robotics Research, ISRR 2003 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frese, U. (2005). Treemap: An O(log n) Algorithm for Simultaneous Localization and Mapping. In: Freksa, C., Knauff, M., Krieg-Brückner, B., Nebel, B., Barkowsky, T. (eds) Spatial Cognition IV. Reasoning, Action, Interaction. Spatial Cognition 2004. Lecture Notes in Computer Science(), vol 3343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32255-9_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-32255-9_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25048-7
Online ISBN: 978-3-540-32255-9
eBook Packages: Computer ScienceComputer Science (R0)