2026-09-05T11:58:35Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:25908 2026-06-23T13:00:37Z ddc:004 open_access

Tracking a Set of Moving Objects with Minimal Peak Power (Media Exposition) Fekete, Sándor P. Hoffmann, Malte Loi, Chek-Manh Perk, Michael Set cover kinetic problems geometric optimization exact optimization A common sensing problem is to use a set of stationary tracking locations to monitor a collection of moving devices. Given n objects that need to be tracked, each following its own trajectory, and m stationary traffic control stations, each with a sensing region that can be changed over time; how should we adjust the individual sensor ranges in order to optimize energy consumption? We illustrate how to combine geometric insights with mathematical optimization to find optimal solutions for the min max variant of the problem, which aims at minimizing peak power consumption. Instances with 500 moving objects and 25 stations can be solved in the order of seconds for scenarios that take minutes to play out in the real world, demonstrating real-time capability of our methods. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sándor P. Fekete and Malte Hoffmann and Chek-Manh Loi and Michael Perk 2026 Is Part Of LIPIcs, Volume 367, 42nd International Symposium on Computational Geometry (SoCG 2026) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SoCG.2026.102 urn:nbn:de:0030-drops-259087 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.102 eng https://creativecommons.org/licenses/by/4.0/legalcode