2026-07-20T07:17:24Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7239 2024-03-06T10:40:04Z ddc:004 open_access

Zapping Zika with a Mosquito-Managing Drone: Computing Optimal Flight Patterns with Minimum Turn Cost (Multimedia Contribution) Becker, Aaron T. Debboun, Mustapha Fekete, Sándor P. Krupke, Dominik Nguyen, An Covering tours turn cost complexity exact optimization We present results arising from the problem of sweeping a mosquito-infested area with an Un-manned Aerial Vehicle (UAV) equipped with an electrified metal grid. This is related to the Traveling Salesman Problem, the Lawn Mower Problem and, most closely, Milling with TurnCost. Planning a good trajectory can be reduced to considering penalty and budget variants of covering a grid graph with minimum turn cost. On the theoretical side, we show the solution of a problem from The Open Problems Project that had been open for more than 15 years, and hint at approximation algorithms. On the practical side, we describe an exact method based on Integer Programming that is able to compute provably optimal instances with over 500 pixels. These solutions are actually used for practical trajectories, as demonstrated in the video. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Aaron T. Becker and Mustapha Debboun and Sándor P. Fekete and Dominik Krupke and An Nguyen 2017 Is Part Of LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SoCG.2017.62 urn:nbn:de:0030-drops-72394 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.62 eng https://creativecommons.org/licenses/by/3.0/legalcode