TL;DR
This paper introduces a novel online informative path planning algorithm inspired by RRT* that improves global coverage and utility maximization for autonomous exploration and 3D reconstruction on MAVs.
Contribution
It presents a new RRT*-based method that continuously refines candidate trajectories, achieving better global coverage and utility in unknown environments.
Findings
Outperforms state-of-the-art methods in simulation environments.
Demonstrates real-time planning and exploration on a MAV.
Proposes a novel TSDF-based gain and cost formulation.
Abstract
The ability to plan informative paths online is essential to robot autonomy. In particular, sampling-based approaches are often used as they are capable of using arbitrary information gain formulations. However, they are prone to local minima, resulting in sub-optimal trajectories, and sometimes do not reach global coverage. In this paper, we present a new RRT*-inspired online informative path planning algorithm. Our method continuously expands a single tree of candidate trajectories and rewires segments to maintain the tree and refine intermediate trajectories. This allows the algorithm to achieve global coverage and maximize the utility of a path in a global context, using a single objective function. We demonstrate the algorithm's capabilities in the applications of autonomous indoor exploration as well as accurate Truncated Signed Distance Field (TSDF)-based 3D reconstruction…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
