Imagen de Portada

Drone Air Traffic Control: Tracking a Set of Moving Objects with Minimal Power

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Loi, Chek-Manh, Perk, Michael, Hoffmann, Malte, Fekete, Sándor
Formato:	Preprint
Publicado:	2026
Materias:	Computational Geometry F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Multi-Covering a Point Set by $m$ Disks with Minimum Total Area
por: Guitouni, Mariem, et al.
Publicado: (2025)

Drainability and Fillability of Polyominoes in Diverse Models of Global Control
por: Fekete, Sándor P., et al.
Publicado: (2025)

Dispersive Vertex Guarding for Simple and Non-Simple Polygons
por: Fekete, Sándor P., et al.
Publicado: (2024)

Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces
por: Becker, Aaron T., et al.
Publicado: (2024)

Maximum Polygon Packing: The CG:SHOP Challenge 2024
por: Fekete, Sándor P., et al.
Publicado: (2024)

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
por: Fekete, Sándor P., et al.
Publicado: (2025)

Tilt Automata: Gathering Particles With Uniform External Control
por: Fekete, Sándor P., et al.
Publicado: (2026)

Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
por: Aichholzer, Oswin, et al.
Publicado: (2026)

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
por: Fekete, Sándor P., et al.
Publicado: (2024)

Guarding Offices with Maximum Dispersion
por: Fekete, Sándor P., et al.
Publicado: (2025)

Efficiently Reconfiguring a Connected Swarm of Labeled Robots
por: Fekete, Sándor P., et al.
Publicado: (2022)

Sliding Squares in Parallel
por: Akitaya, Hugo A., et al.
Publicado: (2024)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
por: Jansson, Jesper, et al.
Publicado: (2024)

How Low Can We Go? Minimizing Interaction Samples for Configurable Systems
por: Krupke, Dominik, et al.
Publicado: (2025)

Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters
por: Feng, Zhidan, et al.
Publicado: (2024)

Efficient Reconfiguration of Tile Arrangements by a Single Active Robot
por: Becker, Aaron T., et al.
Publicado: (2025)

Drawing Reeb Graphs
por: Chambers, Erin, et al.
Publicado: (2025)

Structure and Independence in Hyperbolic Uniform Disk Graphs
por: Bläsius, Thomas, et al.
Publicado: (2024)

Online Maximum Independent Set of Hyperrectangles
por: Advani, Rishi, et al.
Publicado: (2023)

Better Sampling Bounds for Restricted Delaunay Triangulations and a Star-Shaped Property for Restricted Voronoi Cells
por: Shewchuk, Jonathan Richard
Publicado: (2026)

Computing Largest Subsets of Points Whose Convex Hulls have Bounded Area and Diameter
por: Picarella, Gianmarco, et al.
Publicado: (2025)

Approximating Euclidean Shallow-Light Trees
por: Le, Hung, et al.
Publicado: (2025)

Online Competitive Searching for Rays in the Half-plane
por: Langetepe, Elmar, et al.
Publicado: (2025)

A near-linear time exact algorithm for the $L_1$-geodesic Fréchet distance between two curves on the boundary of a simple polygon
por: van der Horst, Thijs, et al.
Publicado: (2025)

Unfolding Polycubes with Orthogonally Convex Layers
por: Damian, Mirela, et al.
Publicado: (2024)

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
por: van der Horst, Thijs, et al.
Publicado: (2025)

Evolving Distributions Under Local Motion
por: Acharya, Aditya, et al.
Publicado: (2024)

Faster, Deterministic and Space Efficient Subtrajectory Clustering
por: van der Hoog, Ivor, et al.
Publicado: (2024)

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
por: Damian, Mirela, et al.
Publicado: (2003)

The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
por: van Renssen, Andrè, et al.
Publicado: (2022)

Faster Fréchet Distance Approximation through Truncated Smoothing
por: van der Horst, Thijs, et al.
Publicado: (2024)

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb{R}^2$
por: Aronov, Boris, et al.
Publicado: (2024)

Minimizing an Uncrossed Collection of Drawings
por: Hliněný, Petr, et al.
Publicado: (2023)

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
por: Grandoni, Fabrizio, et al.
Publicado: (2024)

Minimum-Length Coordinated Motions For Two Convex Centrally-Symmetric Robots
por: Kirkpatrick, David, et al.
Publicado: (2025)

Super Guarding and Dark Rays in Art Galleries
por: MIT CompGeom Group, et al.
Publicado: (2024)

The Spanning Ratio of the Directed $Θ_6$-Graph is 5
por: Bose, Prosenjit, et al.
Publicado: (2026)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
por: Le, Hung, et al.
Publicado: (2023)

Map-Matching Queries under Fréchet Distance on Low-Density Spanners
por: Buchin, Kevin, et al.
Publicado: (2024)

Intersection patterns of set systems on manifolds with slowly growing homological shatter functions
por: Avvakumov, Sergey, et al.
Publicado: (2026)