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.
@cite_8 uses particles defined by a stochastic differential equation to explore the environment. @cite_4 calculates an explicit region-of-interest map based on the ideas of the NBVs.
@cite_4 @cite_8
2132129206 1996985406
We describe a new paradigm for exploration of unknown spaces based on maximizing the understanding of obstacles rather than the exposure of free space. We look at the interaction between multiple sensor readings and how they combine to resolve obstacles. Taking a next best view approach, we generate an inverse sensor model that identifies regions in space where a new sensor reading has maximal utility with respect to increasing the resolution of that reading. Fusion of multiple models is exploited to generate regions of interest that direct exploration in such a way as to maximize the robots understanding of its space. These techniques are applied to a team of small robots called Millibots. In this paper, we propose a stochastic differential equation-based exploration algorithm to enable exploration in three-dimensional indoor environments with a payload constrained micro-aerial vehicle (MAV). We are able to address computation, memory, and sensor limitations by considering only the known occupied space in the current map. We determine regions for further exploration based on the evolution of a stochastic differential equation that simulates the expansion of a system of particles with Newtonian dynamics. The regions of most significant particle expansion correlate to unexplored space. After identifying and processing these regions, the autonomous MAV navigates to these locations to enable fully autonomous exploration. The performance of the approach is demonstrated through numerical simulations and experimental results in single and multi-floor indoor experiments.