Active Pose SLAM
Open accessThe DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
We present an active exploration strategy that complements Pose SLAM [1] and optimal navigation in Pose SLAM [2]. The method evaluates the utility of exploratory and place revisiting sequences and chooses the one that minimizes overall map and path entropies. The technique considers trajectories of similar path length taking marginal pose uncertainties into account. An advantage of the proposed strategy with respect to competing approaches is that to evaluate information gain over the map, only a very coarse prior map estimate needs to be computed. Its coarseness is independent and does not jeopardize the Pose SLAM estimate. Moreover, a replanning scheme is devised to detect significant localization improvement during path execution. The approach is tested in simulations in a common publicly available dataset comparing favorably against frontier based exploration.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343
Planning and acting in partially observable stochastic domains
Kaelbling, L. P., Littman, M. L., & Cassandra, A. R. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00023-x · Cited by 4,149
A frontier-based approach for autonomous exploration
Yamauchi, B. (2002) · Proceedings 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation CIRA'97. 'Towards New Computational Principles for Robotics and Automation' · doi:10.1109/cira.1997.613851 · Cited by 1,695
iSAM2: Incremental smoothing and mapping using the Bayes tree
Kaess, M., Johannsson, H., Roberts, R., Ila, V., Leonard, J. J., & Dellaert, F. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364911430419 · Cited by 1,362
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
Square 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
Information 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
Information based adaptive robotic exploration
Bourgault, F., Makarenko, A. A., Williams, S. B., Grocholsky, B., & Durrant-Whyte, H. F. (2003) · IEEE/RSJ International Conference on Intelligent Robots and System · doi:10.1109/irds.2002.1041446 · Cited by 453 · cited 1×
“[13] alternatively propos ed a utility function for exploration that trades off the poten ial reduction of vehicle localization uncertainty, measured a s entropy over a feature-based map, and the information gaine d over an occupancy grid.”
BackgroundAutonomous exploration: driven by uncertainty
Whaite, P., & Ferrie, F. P. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.584097 · Cited by 240
Martinez-Cantin, R., de Freitas, N., Brochu, E., Castellanos, J., & Doucet, A. (2009) · Autonomous Robots · doi:10.1007/s10514-009-9130-2 · Cited by 217
Research works printed but not linked: 14
- 10.1109/TRO.2006.886264 · DOI · Paper page
- 10.1109/ROBOT.1985.1087316 · DOI · Paper page
- 10.1109/ROBOT.2008.4543484 · DOI
- huang, 2005, Multi-step look-ahead trajectory planning in SLAM: Possibility and necessity, IEEE Int Conf Robot Automat, 1091
- 10.1177/02783649922066484 · DOI · Paper page
- howard, 2003, The Robotics Data Set Repository (Radish)
- konolige, 2004, Large-scale map-making, Proc Nat Conf Artif Intell, 457
- 10.1109/ROBOT.2005.1570193 · DOI · Paper page
- 10.1109/ICRA.2011.5979742 · DOI · Paper page
- 10.1109/IROS.2009.5354277 · DOI
- 10.1007/s10514-006-9043-2 · DOI
- 10.1177/0278364904045479 · DOI · Paper page
- 10.1177/0278364909341659 · DOI · Paper page
- 10.1109/TSMCB.2010.2043528 · DOI
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
“Initial work considered the uncertainty of the map and the robot to be independent [246] or conditionally inde-”
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. D., & Leonard, J. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-138892 · Cited by 3,048
A Survey on Active Simultaneous Localization and Mapping: State of the Art and New Frontiers
Placed, J. A., Strader, J., Carrillo, H., Atanasov, N., Indelman, V., Carlone, L., & Castellanos, J. A. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2023.3248510 · Cited by 332
Indelman, V., Carlone, L., & Dellaert, F. (2015) · The International Journal of Robotics Research · doi:10.1177/0278364914561102 · Cited by 154
Carrillo, H., Dames, P., Kumar, V., & Castellanos, J. A. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139224 · Cited by 94
“The utility function from [5] takes the form:”
BackgroundMethodInfluentialActive SLAM and Exploration with Particle Filters Using Kullback-Leibler Divergence
Carlone, L., Du, J., Kaouk Ng, M., Bona, B., & Indri, M. (2014) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-013-9981-9 · Cited by 94
“The works [12, 13] instead discuss the active SLAM problem when using pose graph”
BackgroundPotential information fields for mobile robot exploration
Vallvé, J., & Andrade-Cetto, J. (2015) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2014.08.009 · Cited by 50
“Moreover, the resolution at which the occupancy grid map is computed is finer than what we were able to compute in [17].”
BackgroundMethodInfluentialSelf-citation
Metadata
- Authors
- Valencia, R., Valls Miro, J., Dissanayake, G., & Andrade-Cetto, J.
- Venue
- 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems
- Publisher
- IEEE
- Published
- 2012-10
- Pages
- 1885-1891
- OpenAlex
- W1988757690
- Cited by
- 86
- References
- 12
- FWCI
- 12.55
- Type
- conference paper
- Language
- en
- Open access
- green
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.