History-Aware Autonomous Exploration in Confined Environments Using MAVs
Authors:
- 1 October 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
Abstract
Many scenarios require a robot to be able to explore its 3D environment online without human supervision. This is especially relevant for inspection tasks and search and rescue missions. To solve this high-dimensional path planning problem, sampling-based exploration algorithms have proven successful. However, these do not necessarily scale well to larger environments or spaces with narrow openings. This paper presents a 3D exploration planner based on the principles of Next-Best Views (NBVs). In this approach, a Micro-Aerial Vehicle (MAV)equipped with a limited field-of-view depth sensor randomly samples its configuration space to find promising future viewpoints. In order to obtain high sampling efficiency, our planner maintains and uses a history of visited places, and locally optimizes the robot's orientation with respect to unobserved space. We evaluate our method in several simulated scenarios, and compare it against a state-of-the-art exploration algorithm. The experiments show substantial improvements in exploration time (2 × faster), computation time, and path length, and advantages in handling difficult situations such as escaping dead-ends (up to 20 × faster). Finally, we validate the on-line capability of our algorithm on a computational constrained real world MAV.Keywords
All Related Versions
This publication has 30 references indexed in Scilit:
- Sampling-based robotic information gathering algorithmsThe International Journal of Robotics Research, 2014
- A comparison of path planning strategies for autonomous exploration and mapping of unknown environmentsAutonomous Robots, 2012
- Beyond Frontier Exploration2008
- Autonomous exploration and mapping of abandoned minesIEEE Robotics & Automation Magazine, 2004
- Navigation Strategies for Exploring Indoor EnvironmentsThe International Journal of Robotics Research, 2002
- A behavior-based architecture for autonomous underwater explorationInformation Sciences, 2002
- RRT-connect: An efficient approach to single-query path planning2000
- Frontier-based exploration using multiple robots1998
- Some NP-hard polygon decomposition problemsIEEE Transactions on Information Theory, 1983
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977