The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Uncertainty-aware receding horizon exploration and mapping using aerial robots
Abstract
This paper presents a novel path planning algorithm for autonomous, uncertainty-aware exploration and mapping of unknown environments using aerial robots. The proposed planner follows a two-step, receding horizon, belief space-based approach. At first, in an online computed tree the algorithm finds the branch that optimizes the amount of space expected to be explored. The first viewpoint configuration of this branch is selected, but the path towards it is decided through a second planning step. Within that, a new tree is sampled, admissible branches arriving at the reference viewpoint are found and the robot belief about its state and the tracked landmarks of the environment is propagated. The branch that minimizes the expected localization and mapping uncertainty is selected, the corresponding path is executed by the robot and the whole process is iteratively repeated. The proposed planner is capable of running online onboard a small aerial robot and its performance is evaluated using experimental studies in a challenging environment.
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
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
Aloimonos, J., Weiss, I., & Bandyopadhyay, A. (1988) · International Journal of Computer Vision · doi:10.1007/bf00133571 · Cited by 931 · cited 1×
“Early works describe the importance of active vision for problems like structure from motion [8], while the work in [17] focused on integrating trajectory planning with SLAM.”
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
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
On 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
Cited by
FUEL: Fast UAV Exploration Using Incremental Frontier Structure and Hierarchical Planning
Zhou, B., Zhang, Y., Chen, X., & Shen, S. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3051563 · Cited by 351
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
An Efficient Sampling-Based Method for Online Informative Path Planning in Unknown Environments
Schmid, L., Pantic, M., Khanna, R., Ott, L., Siegwart, R., & Nieto, J. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.2969191 · Cited by 308
Metadata
- Authors
- Papachristos, C., Khattak, S., & Alexis, K.
- Venue
- 2017 IEEE International Conference on Robotics and Automation (ICRA)
- Publisher
- IEEE
- Published
- 2017-05
- Pages
- 4568-4575
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2739036405
- Cited by
- 185
- References
- 5
- FWCI
- 31.24
- Type
- conference paper
- Language
- en
- Open access
- closed
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.