Results 1  10
of
173
FastSLAM 2.0: An improved particle filtering algorithm for simultaneous localization and mapping that provably converges
"... In [15], Montemerlo et al. proposed an algorithm called FastSLAM as an efficient and robust solution to the simultaneous localization and mapping problem. This paper describes a modified version of FastSLAM that overcomes important deficiencies of the original algorithm. We prove convergence of this ..."
Abstract

Cited by 227 (7 self)
 Add to MetaCart
(Show Context)
In [15], Montemerlo et al. proposed an algorithm called FastSLAM as an efficient and robust solution to the simultaneous localization and mapping problem. This paper describes a modified version of FastSLAM that overcomes important deficiencies of the original algorithm. We prove convergence of this new algorithm for linear SLAM problems and provide realworld experimental results that illustrate an order of magnitude improvement in accuracy over the original FastSLAM algorithm. 1
An Atlas Framework for Scalable Mapping
 in IEEE International Conference on Robotics and Automation
, 2003
"... This paper describes Atlas, a hybrid metrical /topological approach to SLAM that achieves efficient mapping of largescale environments. The representation is a graph of coordinate frames, with each vertex in the graph representing a local frame, and each edge representing the transformation between ..."
Abstract

Cited by 179 (21 self)
 Add to MetaCart
(Show Context)
This paper describes Atlas, a hybrid metrical /topological approach to SLAM that achieves efficient mapping of largescale environments. The representation is a graph of coordinate frames, with each vertex in the graph representing a local frame, and each edge representing the transformation between adjacent frames. In each frame, we build a map that captures the local environment and the current robot pose along with the uncertainties of each. Each map's uncertainties are modeled with respect to its own frame. Probabilities of entities with respect to arbitrary frames are generated by following a path formed by the edges between adjacent frames, computed via Dijkstra's shortest path algorithm. Loop closing is achieved via an efficient map matching algorithm. We demonstrate the technique running in realtime in a large indoor structured environment (2.2 km path length) with multiple nested loops using laser or ultrasonic ranging sensors.
Square Root SAM: Simultaneous localization and mapping via square root information smoothing
 International Journal of Robotics Reasearch
, 2006
"... Solving the SLAM problem is one way to enable a robot to explore, map, and navigate in a previously unknown environment. We investigate smoothing approaches as a viable alternative to extended Kalman filterbased solutions to the problem. In particular, we look at approaches that factorize either th ..."
Abstract

Cited by 144 (39 self)
 Add to MetaCart
(Show Context)
Solving the SLAM problem is one way to enable a robot to explore, map, and navigate in a previously unknown environment. We investigate smoothing approaches as a viable alternative to extended Kalman filterbased solutions to the problem. In particular, we look at approaches that factorize either the associated information matrix or the measurement Jacobian into square root form. Such techniques have several significant advantages over the EKF: they are faster yet exact, they can be used in either batch or incremental mode, are better equipped to deal with nonlinear process and measurement models, and yield the entire robot trajectory, at lower cost for a large class of SLAM problems. In addition, in an indirect but dramatic way, column ordering heuristics automatically exploit the locality inherent in the geographic nature of the SLAM problem. In this paper we present the theory underlying these methods, along with an interpretation of factorization in terms of the graphical model associated with the SLAM problem. We present both simulation results and actual SLAM experiments in largescale environments that underscore the potential of these methods as an alternative to EKFbased approaches. 1
Thin Junction Tree Filters for Simultaneous Localization and Mapping
 In Intl. Joint Conf. on Artificial Intelligence (IJCAI
, 2003
"... Simultaneous Localization and Mapping (SLAM) is a fundamental problem in mobile robotics: while a robot navigates in an unknown environment, it must incrementally build a map of its surroundings and localize itself within that map. Traditional approaches to the problem are based upon Kalman filters, ..."
Abstract

Cited by 133 (1 self)
 Add to MetaCart
Simultaneous Localization and Mapping (SLAM) is a fundamental problem in mobile robotics: while a robot navigates in an unknown environment, it must incrementally build a map of its surroundings and localize itself within that map. Traditional approaches to the problem are based upon Kalman filters, but suffer from complexity issues: the size of the belief state and the time complexity of the filtering operation grow quadratically in the size of the map. This paper presents a filtering technique that maintains a tractable approximation of the filtered belief state as a thin junction tree. The junction tree grows under measurement and motion updates and is periodically "thinned" to remain tractable via efficient maximum likelihood projections. When applied to the SLAM problem, these thin junction tree filters have a linearspace belief state representation, and use a lineartime filtering operation. Further approximation can yield a constanttime filtering operation, at the expense of delaying the incorporation of observations into the majority of the map. Experiments on a suite of SLAM problems validate the approach.
The GraphSLAM algorithm with applications to largescale mapping of urban structures
 INTERNATIONAL JOURNAL ON ROBOTICS RESEARCH
, 2006
"... This article presents GraphSLAM, a unifying algorithm for the offline SLAM problem. GraphSLAM is closely related to a recent sequence of research papers on applying optimization techniques to SLAM problems. It transforms the SLAM posterior into a graphical network, representing the loglikelihood of ..."
Abstract

Cited by 100 (2 self)
 Add to MetaCart
This article presents GraphSLAM, a unifying algorithm for the offline SLAM problem. GraphSLAM is closely related to a recent sequence of research papers on applying optimization techniques to SLAM problems. It transforms the SLAM posterior into a graphical network, representing the loglikelihood of the data. It then reduces this graph using variable elimination techniques, arriving at a lowerdimensional problems that is then solved using conventional optimization techniques. As a result, GraphSLAM can generate maps with 10 8 or more features. The paper discusses a greedy algorithm for data association, and presents results for SLAM in urban environments with occasional GPS measurements.
Towards a General Theory of Topological Maps
 Artificial Intelligence
, 2002
"... We present a general theory of topological maps whereby sensory input, topological and local metrical information are combined to define the topological maps explaining such information. Topological maps correspond to the minimal models of an axiomatic theory describing the relationships between ..."
Abstract

Cited by 83 (9 self)
 Add to MetaCart
We present a general theory of topological maps whereby sensory input, topological and local metrical information are combined to define the topological maps explaining such information. Topological maps correspond to the minimal models of an axiomatic theory describing the relationships between the different sources of information explained by a map. We use a circumscriptive theory to specify the minimal models associated with this representation.
Mobile Robot Localisation and Mapping in Extensive Outdoor Environments
, 2002
"... This thesis addresses the issues of scale for practical implementations of simultaneous localisation and mapping (SLAM) in extensive outdoor environments. Building an incremental map while also using it for localisation is of prime importance for mobile robot navigation but, until recently, has bee ..."
Abstract

Cited by 67 (8 self)
 Add to MetaCart
This thesis addresses the issues of scale for practical implementations of simultaneous localisation and mapping (SLAM) in extensive outdoor environments. Building an incremental map while also using it for localisation is of prime importance for mobile robot navigation but, until recently, has been confined to smallscale, mostly indoor, environments. The critical problems for largescale implementations are as follows. First, data association finding correspondences between map landmarks and robot sensor measurementsbecomes difficult in complex, cluttered environments, especially if the robot location is uncertain. Second, the information required to maintain a consistent map using traditional methods imposes a prohibitive computational burden as the map increases in size. And third, the mathematics for SLAM relies on assumptions of small errors and nearlinearity, and these become invalid for larger maps.
Multirobot slam with sparse extended information filters
, 2003
"... Abstract. We present an algorithm for the multirobot simultaneous localization and mapping (SLAM) problem. Our algorithm enables teams of robots to build joint maps, even if their relative starting locations are unknown and landmarks are ambiguous—which is presently an open problem in robotics. It ..."
Abstract

Cited by 62 (4 self)
 Add to MetaCart
(Show Context)
Abstract. We present an algorithm for the multirobot simultaneous localization and mapping (SLAM) problem. Our algorithm enables teams of robots to build joint maps, even if their relative starting locations are unknown and landmarks are ambiguous—which is presently an open problem in robotics. It achieves this capability through a sparse information filter technique, which represents maps and robot poses by Gaussian Markov random fields. The alignment of local maps into a single global maps is achieved by a treebased algorithm for searching similarlooking local landmark configurations, paired with a hill climbing algorithm that maximizes the overall likelihood by search in the space of correspondences. We report favorable results obtained with a realworld benchmark data set. 1
Robust rangeonly beacon localization
 In Proceedings of Autonomous Underwater Vehicles
, 2004
"... Abstract — Most Autonomous Underwater Vehicle (AUV) systems rely on prior knowledge of beacon locations for localization. We present a system capable of navigating without prior beacon locations. Noise and outliers are major issues; we present a powerful outlier rejection method that imposes geometr ..."
Abstract

Cited by 60 (9 self)
 Add to MetaCart
(Show Context)
Abstract — Most Autonomous Underwater Vehicle (AUV) systems rely on prior knowledge of beacon locations for localization. We present a system capable of navigating without prior beacon locations. Noise and outliers are major issues; we present a powerful outlier rejection method that imposes geometric constraints on measurements. We have successfully applied our algorithm to realworld data and have demonstrated navigation performance comparable to that of systems that assume known beacon locations. I.