Information-Based Compact Pose SLAM
Open accessThe DOI matches its Crossref record; 43 of the 46 references it cites were found in a registry or an index.
Abstract
Pose SLAM is the variant of simultaneous localization and map building (SLAM) is the variant of SLAM, in which only the robot trajectory is estimated and where landmarks are only used to produce relative constraints between robot poses. To reduce the computational cost of the information filter form of Pose SLAM and, at the same time, to delay inconsistency as much as possible, we introduce an approach that takes into account only highly informative loop-closure links and nonredundant poses. This approach includes constant time procedures to compute the distance between poses, the expected information gain for each potential link, and the exact marginal covariances while moving in open loop, as well as a procedure to recover the state after a loop closure that, in practical situations, scales linearly in terms of both time and memory. Using these procedures, the robot operates most of the time in open loop, and the cost of the loop closure is amortized over long trajectories. This way, the computational bottleneck shifts to data association, which is the search over the set of previously visited poses to determine good candidates for sensor registration. To speed up data association, we introduce a method to search for neighboring poses whose complexity ranges from logarithmic in the usual case to linear in degenerate situations. The method is based on organizing the pose information in a balanced tree whose internal levels are defined using interval arithmetic. The proposed Pose-SLAM approach is validated through simulations, real mapping sessions, and experiments using standard SLAM data sets.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Ila et al. [115] use an information-theoretic approach to add only non-redundant nodes and highly-informative measurements to the graph.”
From Past, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age (2016) · cites this paper as [115]
Citations
Cites
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589 · cited 1×
“Stereo images were used to find constraints (visual odometry and loop closure links) between corresponding poses iterating as follows: First, SIFT image features [42] are extracted and matched from candidate stereo image pairs.”
MethodRayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Estimation with Applications to Tracking and Navigation: Theory, Algorithms and Software
Bar‐Shalom, Y., Li, X. ‐., & Kirubarajan, T. (2002) · doi:10.1002/0471221279 · Cited by 6,782
A solution to the simultaneous localization and map building (SLAM) problem
Dissanayake, M. W. M. G., Newman, P., Clark, S., Durrant-Whyte, H. F., & Csorba, M. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.938381 · Cited by 2,661
FAB-MAP: Probabilistic Localization and Mapping in the Space of Appearance
Cummins, M., & Newman, P. (2008) · The International Journal of Robotics Research · doi:10.1177/0278364908090961 · Cited by 1,472 · cited 2×
“Our Pose-SLAM method was compared with a state-of-the-art placerecognition technique [39].”
MethodGlobally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
Matrix Algebra From a Statistician’s Perspective
Harville, D. A. (1997) · Springer eBooks · doi:10.1007/b98818 · Cited by 1,159
iSAM: Incremental Smoothing and Mapping
Kaess, M., Ranganathan, A., & Dellaert, F. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2006706 · Cited by 1,076 · cited 1×
“Section VII summarizes the Pose-SLAM algorithm introduced in this paper and Section VIII evaluates it using synthetic and real data sets.”
MethodSquare Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing
Dellaert, F., & Kaess, M. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906072768 · Cited by 922 · cited 3×
“, [6], [19], [26], address the second source of error.”
BackgroundInfluentialMatrix Algebra from a Statistician's Perspective
Ziegel, E. R., & Harville, D. A. (1998) · Technometrics · doi:10.2307/1270666 · Cited by 880
Research works printed but not linked: 4
- moore, 1966, Interval Analysis
- esteban, 2008, slam for extremely large environments, presented at the Proc 14th Annu Conf Adv School Comput Imag
- ranganathan, 2007, loopy sam, Proc Int Joint Conf Artif Intell, 2191
- montemerlo, 2007, FastSLAM A Scalable Method for the Simultaneous Localization and Mapping Problem in Robotic
Cited by
Items 201–216 of 216
Change of Optimal Values: A Pre-calculated Metric
Bai, F. (2020) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra40945.2020.9197163
“This metric is quite popular which has been extensively used in robotics, for example, the active control/planning strategy [5][6][7][8][9], graph pruning [10][11], online sparse pose-graph construction [12][13], path planning on a pose graph [14] and so forth.”
MethodRobust navigation for industrial service robots
Deray, J. (2020) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-331092
Image Mosaicking Considering Pairwise Registrability in Structure Inspection with Underwater Robots
Hong, S. (2021) · The Journal of Korea Robotics Society · doi:10.7746/jkros.2021.16.3.238
Valencia, R., & Andrade‐Cetto, J. (2017) · Springer tracts in advanced robotics · doi:10.1007/978-3-319-60603-3_6
Self-citationVisual metric and semantic localization for UGV
Zhang, H. (2022) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/162442
3D mapping and path planning from range data
Teniente, E. H. (2016) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-96287
Cao, L., Liang, S., Yang, H., & Tian, X. (2025) · doi:10.1109/icnlp65360.2025.11108402
“To evaluate the quality of the new gesture, Ila et al. [8] defined the mutual information gain of the new edges in the gesture graph, and searched for paths using a fast exploratory random tree to select the path that minimizes the map entropy.”
Dagstuhl Reports, Volume 5, Issue 11, November 2015, Complete Issue
Informatik, S. D. L.-Z. F. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/dagrep.5.11
Dense outdoor 3D mapping and navigation with Pose SLAM
Teniente, E. H., Carreño, R. V., & Andrade‐Cetto, J. (2011) · RECERCAT (Consorci de Serveis Universitaris de Catalunya)
Self-citationExploiting graph structure in Active SLAM
Fermín, L., & CASTELLANOS GÓMEZ, J. Á. (2018) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)
Graph matching using position coordinates and local features for image analysis
Sanromà, G. (2012) · Rovira & Virgili repository
Efficient Incremental SLAM via Information-Guided Gating and Selective Partial Optimization
Arablouei, R. (2026) · Robotics · doi:10.3390/robotics15050087
“Several works [21–23] employ information-theoretic criteria to construct sparse yet reliable pose graphs that approximate the estimation quality of the full graph, for example, by selecting a near-D-optimal subset of loop closures or constraints that maximizes the determinant of the Fisher…”
Wang, J., Mo, Z., Chang, K., Zhou, T., & Liu, X. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6959718
Localização e mapeamento simultâneos em grandes ambientes : uma abordagem híbrida
Alves, E. D. S. (2012) · RIUnB Institutional Repository (University of Brasília) · doi:10.26512/2012.12.d.17075
Temporal Scalable Visual SLAM using a Reduced Pose Graph
Johannsson, H., Kaess, M., Fallon, M. F., & Leonard, J. J. (2012) · Edinburgh Research Explorer (University of Edinburgh)
Ardiansyah, A. F. (2026) · Institutional Repositories DataBase (IRDB) · doi:10.34382/0002007565
Metadata
- Authors
- Ila, V., Porta, J. M., & Andrade-Cetto, J.
- Affiliations
- Georgia Institute of Technology (US)
- Consejo Superior de Investigaciones Científicas (ES)
- ORCID
- Venue
- IEEE Transactions on Robotics
- Published
- 2010-02
- Volume
- 26
- Issue
- 1
- Pages
- 78-93
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W2096052462
- Cited by
- 183
- References
- 46
- Citations by year
- 2026: 3 · 2025: 3 · 2024: 7 · 2023: 6 · 2022: 6 · 2021: 6 · 2020: 11 · 2019: 13 · 2018: 16 · 2017: 19 · 2016: 20 · 2015: 15 · 2014: 18 · 2013: 14 · 2012: 11
- FWCI
- 16.83
- Type
- journal article
- Language
- en
- Open access
- green
- hdl.handle.net
- Locations
- IEEE Transactions on Robotics (publishedVersion)
- LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) (publishedVersion, other-oa)
- UPCommons institutional repository (Universitat Politècnica de Catalunya) (publishedVersion, other-oa)
- DIGITAL.CSIC (Spanish National Research Council (CSIC)) (submittedVersion, other-oa)
- RECERCAT (Consorci de Serveis Universitaris de Catalunya) (submittedVersion, public-domain)
- Funders
- European Commission
- Ministerio de Ciencia e Innovación
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotics and Sensor-Based Localization
- Physical Sciences › Computer Science › Artificial Intelligence › Target Tracking and Data Fusion in Sensor Networks
- Physical Sciences › Engineering › Aerospace Engineering › Inertial Sensor and Navigation
- Keywords
- information filter, loop closure, data association, expected information gain, open-loop operation, balanced trees, interval arithmetic, robot trajectory estimation, computational efficiency
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.