Asymptotically-Bounded 3D Frontier Exploration enhanced with Bayesian Information Gain
John Lewis, Meysam Basiri, and Pedro U. Lima

TL;DR
This paper introduces an OctoMap-based frontier exploration algorithm with predictable, asymptotically bounded performance, enhanced by Bayesian information gain estimation for more efficient large-scale robotic exploration.
Contribution
It presents a novel exploration method with fixed complexity scaling, integrating Bayesian regression to improve viewpoint selection without explicit voxel counting.
Findings
Achieves up to 54% reduction in total exploration time.
Maintains computational complexity of O(|F|) regardless of environment size.
Demonstrates effectiveness in both simulations and real-world experiments.
Abstract
Robotic exploration in large-scale environments is computationally demanding due to the high overhead of processing extensive frontiers. This article presents an OctoMap-based frontier exploration algorithm with predictable, asymptotically bounded performance. Unlike conventional methods whose complexity scales with environment size, our approach maintains a complexity of , where is the number of frontiers. This is achieved through strategic forward and inverse sensor modeling, which enables approximate yet efficient frontier detection and maintenance. To further enhance performance, we integrate a Bayesian regressor to estimate information gain, circumventing the need to explicitly count unknown voxels when prioritizing viewpoints. Simulations show the proposed method is more computationally efficient than the existing OctoMap-based methods…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
