6 papers
Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
Sándor P. Fekete, Ramin Kosfeld, Peter Kramer +3
We study Multi-Agent Path Finding for arrangements of labeled agents in the interior of a simply connected domain: Given a unique start and target position for each agent, the goal…
Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces
Aaron T. Becker, Sándor P. Fekete, Li Huang +5
We investigate algorithmic approaches for targeted drug delivery in a complex, maze-like environment, such as a vascular system. The basic scenario is given by a large swarm of mic…
Efficiently Reconfiguring a Connected Swarm of Labeled Robots
Sándor P. Fekete, Peter Kramer, Christian Rieck +2
When considering motion planning for a swarm of labeled robots, we need to rearrange a given start configuration into a desired target configuration via a sequence of parallel,…
Dispersive Vertex Guarding for Simple and Non-Simple Polygons
Sándor P. Fekete, Joseph S. B. Mitchell, Christian Rieck +2
We study the Dispersive Art Gallery Problem with vertex guards: Given a polygon , with pairwise geodesic Euclidean vertex distance of at least , and a rational numb…
Maximum Polygon Packing: The CG:SHOP Challenge 2024
Sándor P. Fekete, Phillip Keldenich, Dominik Krupke +1
We give an overview of the 2024 Computational Geometry Challenge targeting the problem \textsc{Maximum Polygon Packing}: Given a convex region in the plane, and a collection of…
Reconfiguration of a 2D Structure Using Spatio-Temporal Planning and Load Transferring
Javier Garcia, Michael Yannuzzi, Peter Kramer +3
We present progress on the problem of reconfiguring a 2D arrangement of building material by a cooperative group of robots. These robots must avoid collisions, deadlocks, and are s…