Document Open Access Logo

Tracking a Set of Moving Objects with Minimal Peak Power (Media Exposition)

Authors Sándor P. Fekete , Malte Hoffmann , Chek-Manh Loi , Michael Perk

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2026.102.pdf
  • Filesize: 1.23 MB
  • 7 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • Set cover
  • kinetic problems
  • geometric optimization
  • exact optimization

Metrics

Abstract

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.

Cite As Get BibTex

Sándor P. Fekete, Malte Hoffmann, Chek-Manh Loi, and Michael Perk. Tracking a Set of Moving Objects with Minimal Peak Power (Media Exposition). In 42nd International Symposium on Computational Geometry (SoCG 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 367, pp. 102:1-102:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.SoCG.2026.102

Author Details

Sándor P. Fekete
  • Department of Computer Science, TU Braunschweig, Germany
  • L3S Research Center, Hannover, Germany
Malte Hoffmann
  • Department of Computer Science, TU Braunschweig, Germany
Chek-Manh Loi
  • Department of Computer Science, TU Braunschweig, Germany
Michael Perk
  • Department of Computer Science, TU Braunschweig, Germany

Funding

This work was supported by the German Research Foundation (Deutsche Forschungsgemeinschaft, DFG) as part of project Computational Geometry: Solving Hard Optimization Problems (CG:SHOP) - 444569951.

Supplementary Materials

References

  1. Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, and Kim Whittlesey. Minimum-cost coverage of point sets by disks. In Symposium on Computational Geometry (SoCG), pages 449-458, 2006. URL: https://doi.org/10.1145/1137856.1137922.
  2. Julien Basch, Leonidas J. Guibas, and John Hershberger. Data structures for mobile data. J. Algorithms, 31(1):1-28, 1999. URL: https://doi.org/10.1006/JAGM.1998.0988.
  3. Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, and Michael Segal. Mobile facility location. In International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), pages 46-53, 2000. URL: https://doi.org/10.1145/345848.345858.
  4. Adam P. Cohen, Susan A. Shaheen, and Emily M. Farrar. Urban air mobility: History, ecosystem, market potential, and challenges. IEEE Transactions on Intelligent Transportation Systems, 22(9):6074-6087, 2021. URL: https://doi.org/10.1109/TITS.2021.3082767.
  5. Erik D Demaine, Sándor P Fekete, Phillip Keldenich, Dominik Krupke, and Joseph S. B. Mitchell. Computing convex partitions for point sets in the plane: The CG:SHOP Challenge 2020. arXiv preprint arXiv:2004.04207, 2020. URL: https://arxiv.org/abs/2004.04207.
  6. Erik D Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, and Joseph S. B. Mitchell. Area-optimal simple polygonalizations: The CG Challenge 2019. Journal of Experimental Algorithmics (JEA), 27(2):1-12, 2022. URL: https://doi.org/10.1145/3504000.
  7. Günther Eder, Martin Held, Steinþór Jasonarson, Philipp Mayer, and Peter Palfrader. Salzburg database of polygonal data: Polygons and their generators. Data in Brief, 31:105984, 2020. URL: https://doi.org/10.1016/j.dib.2020.105984.
  8. Sándor P. Fekete, Phillip Keldenich, and Michael Perk. Exact Algorithms for Minimum Dilation Triangulation. In Symposium on Computational Geometry (SoCG), pages 48:1-48:18, 2025. URL: https://doi.org/10.4230/LIPIcs.SoCG.2025.48.
  9. Sándor Fekete, Malte Hoffmann, Chek-Manh Loi, and Michael Perk. Drone air traffic control: Tracking a set of moving objects with minimal power, 2026. URL: https://doi.org/10.5281/zenodo.18955730.
  10. Xuening Gao, Longkun Guo, and Kewen Liao. Fast approximation algorithms for multiple coverage with unit disks. In Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), pages 185-193, 2022. URL: https://doi.org/10.1109/WoWMoM54355.2022.00037.
  11. Mariem Guitouni, Chek-Manh Loi, Sándor P. Fekete, Michael Perk, and Aaron T. Becker. Multi-covering a point set by m disks with minimum total area. In ICRA, pages 3000-3006. IEEE, 2025. URL: https://doi.org/10.1109/ICRA55743.2025.11127835.
  12. Ziyun Huang, Qilong Feng, Jianxin Wang, and Jinhui Xu. PTAS for minimum cost multi-covering with disks. In Symposium on Discrete Algorithms (SODA), pages 840-859, 2021. URL: https://doi.org/10.1137/1.9781611976465.53.
  13. Ziyun Huang, Qilong Feng, Jianxin Wang, and Jinhui Xu. PTAS for minimum cost multicovering with disks. SIAM Journal on Computing, 53(4):1181-1215, 2024. URL: https://doi.org/10.1137/22M1523352.
  14. Chek-Manh Loi, Michael Perk, Malte Hoffmann, and Sándor P. Fekete. Drone air traffic control: Tracking a set of moving objects with minimal power. In IEEE International Conference on Robotics and Automation (ICRA), 2026. To appear. Google Scholar
  15. Chek-Manh Loi, Michael Perk, Malte Hoffmann, and Sándor Fekete. Drone air traffic control: Tracking a set of moving objects with minimal power, 2026. URL: https://doi.org/10.48550/arXiv.2603.05286.
  16. Franco Mazzenga, Romeo Giuliano, and Alessandro Vizzarri. 5G-based synchronous network for air traffic monitoring in urban air mobility. IEEE Access, 12:188542-188559, 2024. URL: https://doi.org/10.1109/ACCESS.2024.3513212.
  17. Microsoft. Azure Speech in Foundry Tools, 2026. URL: https://azure.microsoft.com/en-us/products/ai-foundry/tools/speech.
  18. G. Reinelt. TSPLIB-A Traveling Salesman Problem Library. ORSA Journal of Computing, 3(4):376-384, 1991. URL: https://doi.org/10.1287/ijoc.3.4.376.
  19. Andre Rohe. VLSI data set. URL: https://www.math.uwaterloo.ca/tsp/vlsi/index.html.
  20. The Manim Community Developers. Manim – Mathematical Animation Framework, 2026. URL: https://www.manim.community/.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact