Revisiting Boustrophedon Coverage Planning as a Generalized Traveling Salesman Problem @aslteam
Revisiting Boustrophedon Coverage Planning as a Generalized Traveling Salesman Problem  @aslteam
Uploaded July 2019 | Updated November 2026, 10 hours ago
Coverage path planning is an omnipresent problem in aerial remote sensing. In this work we present a coverage path planner based on exact cellular decomposition that quickly finds an optimal coverage path in a polygon with potential no-flight-zones. This video mainly shows an outdoor experiment, where we survey a sloped terrain with trees at low altitude.

The video accompanies our paper

Bähnemann, Rik, et al. "Revisiting Boustrophedon Coverage Path Planning as a Generalized Traveling Salesman Problem." Field and Service Robotics. Springer, Cham, 2019.

and the code is available online.

github.com/ethz-asl/polygon_coverage_planning

This work was supported by Urs Endress Foundation's project FindMine.

ue-stiftung.org/findmine
Revisiting Boustrophedon Coverage Planning as a Generalized Traveling Salesman ProblemAerial Layouting: Design of a Compliant and Actuated End-Effector for Precise Marking on CeilingsISAR: A Benchmark for Single- and Few-Shot Object Instance Segmentation and Re-IdentificationPixel wise Anomaly Detection in Complex Driving ScenesPredicting Unobserved Space for Planningvia Depth Map AugmentationAutonomous Christmas Lab 2022An Open-Source System for Vision-Based Micro-Aerial Vehicle Mapping, Planning, and FlightSampling-based Motion Planning for Active Multirotor System Identification[T-RO 2026] Allocation for Omnidirectional Aerial Robots: Incorporating Power DynamicsRegistration Study Case: Rail yard[ICRA22] Collaborative Robot Mapping using Spectral Graph AnalysisCollaborative Transportation
aslteam |

Revisiting Boustrophedon Coverage Planning as a Generalized Traveling Salesman Problem

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER