Aerial robots are a promising platform to perform autonomous inspection of infrastructures. For this application, the world is a large and unknown space, requiring light data structures to store its representation while performing autonomous exploration and path planning for obstacle avoidance. In this paper, we combine frontier cells based exploration with the Lazy Theta* path planning algorithm over the same light sparse grid—the octree implementation of octomap. Test-driven development has been adopted for the software implementation and the subsequent automated testing process. These tests provided insight into the amount of iterations needed to generate a path with different voxel configurations. The results for synthetic and real datasets are analyzed having as baseline a regular grid with the same resolution as the maximum resolution of the octree. The number of iterations needed to find frontier cells for exploration was smaller in all cases by, at least, one order of magnitude. For the Lazy Theta* algorithm there was a reduction in the number of iterations needed to find the solution in 75% of the cases. These reductions can be explained both by the existent grouping of regions with the same status and by the ability to confine inspection to the known voxels of the octree.

Obtaining synoptic observations of dynamic ocean phenomena such as fronts, eddies, oxygen minimum zones and blooms has been challenging primarily due to the large spatial scales involved. Traditional methods of observation with manned ships are expensive and, unless the vessel can survey at high-speed, unrealistic. Autonomous underwater vehicles (AUVs) are robotic platforms that have been making steady gains in sampling capabilities and impacting oceanographic observations especially in coastal areas. However, their reach is still limited by operating constraints related to their energy sources. Unmanned aerial vehicles (UAVs) recently introduced in coastal and polar oceanographic experiments have added to the mix in observation strategy and methods. They offer a tantalizing opportunity to bridge such scales in operational oceanography by coordinating with AUVs in the water-column to get in-situ measurements. In this paper, we articulate the principal challenges in operating UAVs with AUVs making synoptic observations for such targeted water-column sampling. We do so in the context of autonomous control and operation for networked robotics and describe novel experiments while articulating the key challenges and lessons learned.

Exploring large, unknown, and unstructured environments is challenging for Unmanned Aerial Vehicles (UAVs), but they are valuable tools to inspect large structures safely and efficiently. The Lazy Theta* path-planning algorithm is revisited and adapted to generate paths fast enough to be used in real time and outdoors in large 3D scenarios. In real unknown scenarios, a given minimum safety distance to the nearest obstacle or unknown space should be observed, increasing the associated obstacle detection queries, and creating a bottleneck in the path-planning algorithm. We have reduced the dimension of the problem by considering geometrical properties to speed up these computations. On the other hand, we have also applied a non-regular grid representation of the world to increase the performance of the path-planning algorithm. In particular, a sparse resolution grid in the form of an octree is used, organizing the measurements spatially, merging voxels when they are of the same state. Additionally, the number of neighbors is trimmed to match the sparse tree to reduce the number of obstacle detection queries. The development methodology adopted was Test-Driven Development (TDD) and the outcome was evaluated in real outdoors flights with a multirotor UAV. In the results, the performance shows over 90 percent decrease in overall path generation computation time. Furthermore, our approach scales well with the safety distance increases.

This paper addressed the challenge of exploring large, unknown, and unstructured industrial environments with an unmanned aerial vehicle (UAV). The resulting system combined well-known components and techniques with a new manoeuvre to use a low-cost 2D laser to measure a 3D structure. Our approach combined frontier-based exploration, the Lazy Theta* path planner, and a flyby sampling manoeuvre to create a 3D map of large scenarios. One of the novelties of our system is that all the algorithms relied on the multi-resolution of the octomap for the world representation. We used a Hardware-in-the-Loop (HitL) simulation environment to collect accurate measurements of the capability of the open-source system to run online and on-board the UAV in real-time. Our approach is compared to different reference heuristics under this simulation environment showing better performance in regards to the amount of explored space. With the proposed approach, the UAV is able to explore 93% of the search space under 30 min, generating a path without repetition that adjusts to the occupied space covering indoor locations, irregular structures, and suspended obstacles.

This paper is focused on the analysis and comparison of different data structures for 3D space representation in autonomous exploration of large marine structures with UAS. The classical and widely used frontier exploration approach is applied: the frontier cells, which are the locations in the world representation map that are explored and unoccupied but has unexplored space in its vicinity, are of particular interest as they yield the highest information gain. Thus, the data structures have been compared from the point of view of their performance to be applied in the frontier exploration approach. The same algorithm has been run for the different data structures under different scenarios, both with synthetic and real datasets gathered with an UAS. The results are analyzed in detail taking into account the amount of iterations required and the number of computed frontier cells.