Fast minimum uncertainty search on a graph map representation
The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
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 · cited 1×
“In both cases, and unlike the metrics used in the configuration space, the evolution of the uncertainty or information metrics are nonmonotonic, and so far there is no optimistic heuristic that allows the use of the plethora of well-know and effective non-uniform path planner such as: A* [26] or D* [27] [28].”
MethodPrinciples 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 · cited 2×
“To obtain the graph based map needed by our approach, the FaMUS algorithm, we use the g2o graph optimizer [31] with the Gauss-Newton method and one iteration.”
MethodiSAM: 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 2×
“Specifically, we can use a graph-based SLAM algorithm such as: iSAM [13], FrameSLAM [14], or RSLAM [15], that does not need beforehand knowledge of the environment and can produce a good estimate of the environment enclosed in a pose/feature graph.”
MethodThe 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 · cited 1×
“that stems from the family of uncertainty criteria proposed by Kiefer in [23],”
BackgroundFast replanning for navigation in unknown terrain
Koenig, S., & Likhachev, M. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2004.838026 · Cited by 697 · cited 2×
“In both cases, and unlike the metrics used in the configuration space, the evolution of the uncertainty or information metrics are nonmonotonic, and so far there is no optimistic heuristic that allows the use of the plethora of well-know and effective non-uniform path planner such as: A* [26] or D* [27] [28].”
MethodPukelsheim, 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 · cited 1×
“• A-optimality criterion (A-opt) [18]: This criterion targets the minimization of the variance and it is defined as”
BackgroundInformation Gain-based Exploration Using Rao-Blackwellized Particle Filters
Stachniss, C., Grisetti, G., & Burgard, W. (2005) · Robotics: Science and Systems I · doi:10.15607/rss.2005.i.009 · Cited by 542 · cited 1×
“It is worth mentioning here that the FaMUS algorithm follows the classical active SLAM behaviour demonstrated in the literature [32] i.”
MethodFrameSLAM: From Bundle Adjustment to Real-Time Visual Mapping
Konolige, K., & Agrawal, M. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2004832 · Cited by 532 · cited 2×
“Specifically, we can use a graph-based SLAM algorithm such as: iSAM [13], FrameSLAM [14], or RSLAM [15], that does not need beforehand knowledge of the environment and can produce a good estimate of the environment enclosed in a pose/feature graph.”
MethodFoundations of Optimum Experimental Design
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90077-7 · Cited by 345
The New College Vision and Laser Data Set
Smith, M., Baldwin, I., Churchill, W., Paul, R., & Newman, P. (2009) · The International Journal of Robotics Research · doi:10.1177/0278364909103911 · Cited by 311 · cited 1×
“Specifically for the real data, we use the Bicocca [29], New college [30], and Intel datasets and for the simulated counterpart, we use the Manhattan dataset.”
MethodThe Belief Roadmap: Efficient Planning in Belief Space by Factoring the Covariance
Prentice, S., & Roy, N. (2009) · The International Journal of Robotics Research · doi:10.1177/0278364909341659 · Cited by 269 · cited 1×
“Therefore, it seems more natural to use another space such as the belief ( B) or information (I) space [ 6] [8] [2].”
BackgroundOn the Efficient Design of Statistical Investigations
Wald, A. (1943) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731454 · Cited by 255 · cited 1×
“• D-optimality criterion (D-opt) [19]: This criterion aims at capturing the full dimension of the covariance matrix and at first glance it can be defined as”
BackgroundAnytime path planning and replanning in dynamic environments
van den Berg, J., Ferguson, D., & Kuffner, J. (2006) · Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. · doi:10.1109/robot.2006.1642056 · Cited by 241 · cited 1×
“The proposal of optimistic heuristics of the uncertainty should be the focus of future work in the path planning under uncertainty research if we desire to use the incremental, computationally tractable y et complete path planning solutions of [ 27], [28] and [33], among others.”
MethodGlobal A-Optimal Robot Exploration in SLAM
Sim, R., & Roy, N. (2006) · Proceedings of the 2005 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2005.1570193 · Cited by 238 · cited 2×
“es the covariance matrix, entropy and mutual information [10]– [12].”
BackgroundMethodPlanning in information space for a quadrotor helicopter in a GPS-denied environment
He, R., Prentice, S., & Roy, N. (2008) · 2008 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2008.4543471 · Cited by 218
RSLAM: A System for Large-Scale Mapping in Constant-Time Using Stereo
Mei, C., Sibley, G., Cummins, M., Newman, P., & Reid, I. (2011) · International Journal of Computer Vision · doi:10.1007/s11263-010-0361-7 · Cited by 193 · cited 3×
“Specifically, we can use a graph-base d SLAM algorithm such as: iSAM [ 13], FrameSLAM [14], or RSLAM [15], that does not need beforehand knowledge of the environment and can produce a good estimate of the environment enclosed in a pose/feature graph.”
MethodOn the comparison of uncertainty criteria for active SLAM
Carrillo, H., Reid, I., & Castellanos, J. A. (2012) · 2012 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2012.6224890 · Cited by 144
Self-citationOn the Efficiency of Experimental Designs
Ehrenfeld, S. (1955) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728541 · Cited by 118
The Belief Roadmap: Efficient Planning in Linear POMDPs by Factoring the Covariance
Prentice, S., & Roy, N. (2010) · Springer tracts in advanced robotics · doi:10.1007/978-3-642-14743-2_25 · Cited by 102
Pukelsheim, F. (2006) · Society for Industrial and Applied Mathematics eBooks · Cited by 93
A Comparison of Decision Making Criteria and Optimization Methods for Active Robotic Sensing
Mihaylova, L. S., Lefebvre, T., Bruyninckx, H., Gadeyne, K., & Schutter, J. D. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36487-0_35 · Cited by 70
Planning with uncertainty in position an optimal and efficient planner
González, J. P., & Stentz, A. (2005) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2005.1545048 · Cited by 64 · cited 1×
“[5] and Lambert et al.”
Safe path planning in an uncertain-configuration space
Lambert, A., & Gruyer, D. (2004) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2003.1242246 · Cited by 58 · cited 2×
“[3] have proposed the integration of the uncertainty in the path planning process.”
BackgroundPath planning in belief space with pose SLAM
Valencia, R., Andrade-Cetto, J., & Porta, J. M. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5979742 · Cited by 42 · cited 1×
“[9] have proved experimentally that taking into account the uncertainty in the planning process leads to an accurate and safe navigation process.”
BackgroundMotion planning with uncertainty: the information space approach
Barraquand, J., & Ferbach, P. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1995.525465 · Cited by 35 · cited 1×
“Therefore, it seems more natural to use another space such as the belief ( B) or information (I) space [ 6] [8] [2].”
BackgroundTask Planning With Active Sensing For Autonomous Compliant Motion
Lefebvre, T., Bruyninckx, H., & Schutter, J. D. (2005) · The International Journal of Robotics Research · doi:10.1177/0278364904050079 · Cited by 27 · cited 1×
“According to the TOED [ 16] [17] D-opt gives the most accurate approximation of the uncertainty enclosed in the covariance matrix, but in the context of active SLAM or planning under uncertainty [ 10]–[12] and [21], have shown that using the definition in ( 3) to compute theD-opt does not produce a meaningful metric (…”
MethodA multisine approach for trajectory optimization based on information gain
Mihaylova, L. S., Schutter, J. D., & Bruyninckx, H. (2003) · Robotics and Autonomous Systems · doi:10.1016/s0921-8890(03)00036-8 · Cited by 18
A multisine approach for trajectory optimization based on information gain
Mihaylova, L. S., Schutter, J. D., & Bruyninckx, H. (2003) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/irds.2002.1041467 · Cited by 9
Tolerance-weighted L-optimal experiment design for active sensing
Geeter, J. D., Schutter, J. D., Bruyninckx, H., Brussel, H. V., & Decréton, M. (2002) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.1998.724838 · Cited by 5
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
“One of these frameworks is the Theory of Optimal Experimental Design (TOED) [198] which, applied to active SLAM [42], [44], allows selecting future robot action based on the predicted map uncertainty.”
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
“The aim of SLAM is not just to build a nice looking map but to use it further to carry out higher level tasks such as planning [3] and navigation [26].”
BackgroundSelf-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
“Some planners seek to maximize the probability of success or rather to minimize an expected cost by taking into account the sensing uncertainty (Carrillo et al., 2012; Gonzalez & Stentz, 2009; Pepy & Lambert, 2006; Platt et al., 2010; Prentice & Roy, 2009; van den Berg, Abbeel, & Goldberg, 2011) while other path plann…”
BackgroundAdvances 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
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.