The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Fast minimum uncertainty search on a graph map representation
Abstract
This paper addresses the problem of path planning considering uncertainty criteria over the belief space. Specifically, we propose a path planning algorithm that uses a novel determinant-based measure of uncertainty and a reduced representation of the environment, in order to obtain the minimum uncertainty path from a roadmap. Our proposal does not require a priori knowledge of the environment due to the construction of the roadmap via a graph-based SLAM algorithm. We report experimental results of our proposal in four datasets that show its feasibility to obtain the minimum uncertainty path towards an autonomous navigation framework and we also show an improvement in the computation time with respect to the state of the art.
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
“One of these frameworks is the Theory of Optimal Experimental Design (TOED) [198] which, applied to active SLAM [41, 43], allows selecting future robot action based on the predicted map uncertainty.”
From Past, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age (2016) · cites this paper as [41]
Citations
Cites
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Principles of Robot Motion: Theory, Algorithms, and Implementations
Choset, H., & Latombe, J. (2005) · Medical Entomology and Zoology · Cited by 2,149
G2o: A general framework for graph optimization
Kummerle, R., Grisetti, G., Strasdat, H., Konolige, K., & Burgard, W. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5979949 · Cited by 1,982
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
The focussed D* algorithm for real-time replanning
Stentz, A. (1995) · Cited by 865
Robot Motion Planning and Control
(1998) · Lecture Notes in Control and Information Sciences · doi:10.1007/bfb0036069 · Cited by 831
General Equivalence Theory for Optimum Designs (Approximate Theory)
Kiefer, J. (1974) · The Annals of Statistics · doi:10.1214/aos/1176342810 · Cited by 761
Fast replanning for navigation in unknown terrain
Koenig, S., & Likhachev, M. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2004.838026 · Cited by 697
Pukelsheim, F. (2006) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719109 · Cited by 684
Locally Optimal Designs for Estimating Parameters
Chernoff, H. (1953) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728915 · Cited by 645
Research works printed but not linked: 2
- fedorov, 1972, Theory of Optimal Experiments (Probability and Mathematical Statistics)
- 2009, Robotics Advancement Through Webpublishing of Sensorial and Elaborated Extensive Data Sets (Project FP6-IST-045144)
Cited by
Past, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I., & Leonard, J. J. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2624754 · Cited by 3,596
Self-citationPast, present, and future of simultaneous localization and mapping: Toward the robust-perception age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I. D., & Leonard, J. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-138892 · Cited by 3,048
Self-citationRobust loop closing over time for pose graph SLAM
Latif, Y., Cadena, C., & Neira, J. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913498910 · Cited by 221
Self-citationGalceran, E., Campos, R., Palomeras, N., Ribas, D., Carreras, M., & Ridao, P. (2014) · Journal of Field Robotics · doi:10.1002/rob.21554 · Cited by 144
Advances in intelligent and autonomous navigation systems for small UAS
Bijjahalli, S., Sabatini, R., & Gardi, A. (2020) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2020.100617 · Cited by 123
Metadata
- Authors
- Carrillo, H., Latif, Y., Neira, J., & Castellanos, J. A.
- Affiliations
- Universidad de Zaragoza (ES)
- Venue
- 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems
- Publisher
- IEEE
- Published
- 2012-10
- Volume
- 14
- Pages
- 2504-2511
- ISSN
- 2153-0858 (ISSN-L)
- OpenAlex
- W2048500680
- Cited by
- 20
- References
- 33
- Citations by year
- 2022: 1 · 2020: 2 · 2017: 1 · 2016: 4 · 2015: 5 · 2014: 3 · 2013: 4
- FWCI
- 2.73
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (publishedVersion)
- Adelaide Research & Scholarship (AR&S) (University of Adelaide) (submittedVersion)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotics and Sensor-Based Localization
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Keywords
- path planning, uncertainty, belief space, roadmap, graph-based SLAM, autonomous navigation
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast minimum uncertainty search on a graph map representation. https://app.cochat.ai/papers/10.1109/iros.2012.6385927
- The paper
- Carrillo, H., Latif, Y., Neira, J., & Castellanos, J. A. (2012). Fast minimum uncertainty search on a graph map representation. 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems. https://doi.org/10.1109/iros.2012.6385927
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.