Drone viewpoint planning ensures multiple quality images per area

Ground Sample Distance Constrained k-Coverage Viewpoint Planning via Set Multi-Cover Formulation

Robotics

Summary

Getting good 3D models of buildings or structures with drones means taking multiple clear pictures of every spot. The authors show a way to choose drone viewpoints so that each part of the surface is seen enough times with good quality, using a new planning method. Their method smartly picks viewpoints by checking visibility and coverage needs, balancing quality and the number of drone positions. It works almost as well as a perfect but slow approach while being easier to understand and use.

What this means in practice

  • For drone inspection teams: Create efficient flight plans for inspecting structures with drones by ensuring each surface point is captured multiple times with quality constraints.
  • For mapping software developers: Improve drone 3D mapping tools by integrating viewpoint selection that respects image quality and coverage requirements.

Authors

Waleed Bin Khalid, Chul Min Yeum

Abstract

Drone-based 3D reconstruction and inspection require viewpoints that satisfy image-quality constraints while observing each surface region multiple times, which overlap-based planning heuristics do not guarantee. We study ground sample distance (GSD)-constrained $k$-coverage viewpoint selection for structures represented by surface voxels. Candidate viewpoints are generated along outward surface directions, screened with distance, viewing-angle, field-of-view, and occlusion tests, and augmented for voxels with insufficient visibility. Selection is then posed as set multi-cover with per-voxel coverage demands. We propose a dynamically weighted greedy heuristic that prioritizes remaining coverage deficits and scarce viewing alternatives, and compare it with sequential overlap-based pruning and an integer linear programming (ILP) formulation on the same candidate pools. Across two structures, four voxel resolutions, and three coverage requirements, the proposed approach achieves full or near-full $k$-coverage with compact viewpoint sets, using only 3.00--16.39\% more viewpoints than ILP while offering an interpretable selection process based on coverage deficits and viewpoint availability.