Cover Image

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fekete, Sándor P., Kosfeld, Ramin, Kramer, Peter, Neutzner, Jonas, Rieck, Christian, Scheffer, Christian
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry Data Structures and Algorithms F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Sliding Squares in Parallel
by: Akitaya, Hugo A., et al.
Published: (2024)

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

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

Coordinated Motion Planning is FPT on Discretized Simple Polygons
by: Deligkas, Argyrios, et al.
Published: (2026)

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

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
by: Garcia, Javier, et al.
Published: (2025)

Guarding Polyominoes Under $k$-Hop Visibility
by: Filtser, Omrit, et al.
Published: (2023)

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

Tile Reconfiguration by a Finite Automaton
by: Friemel, Jonas, et al.
Published: (2025)

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

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

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

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
by: de Berg, Mark, et al.
Published: (2026)

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

Structural Parameterization of Steiner Tree Packing
by: Hastrich, Niko, et al.
Published: (2025)

Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
by: Bauernöppel, Frank, et al.
Published: (2025)

Reconstructing Bounded Treelength Graphs with Linearithmic Shortest Path Distance Queries
by: Kaudan, Chirag, et al.
Published: (2026)

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

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

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
by: Bandopadhyay, Susobhan, et al.
Published: (2026)

Streaming Algorithms for Bin Packing and Vector Scheduling
by: Cormode, Graham, et al.
Published: (2019)

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
by: Le, Hung, et al.
Published: (2021)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
by: Buchin, Kevin, et al.
Published: (2026)

Optimal Window Queries on Line Segments using the Trapezoidal Search DAG
by: Brankovic, Milutin, et al.
Published: (2021)

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

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
by: Gudmundsson, Joachim, et al.
Published: (2021)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
by: Gudmundsson, Joachim, et al.
Published: (2021)

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
by: Gálvez, Waldo, et al.
Published: (2025)

A Framework for Algorithm Stability
by: Meulemans, Wouter, et al.
Published: (2017)

Planar Network Diversion
by: Bentert, Matthias, et al.
Published: (2025)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
by: Balzotti, Lorenzo
Published: (2020)

On the Connectivity of the Flip Graph of Plane Spanning Paths
by: Kleist, Linda, et al.
Published: (2024)

Simple in-place yet comparison-optimal Mergesort
by: Siebert, Christian
Published: (2025)

Revisiting Path Contraction and Cycle Contraction
by: Krithika, R., et al.
Published: (2024)

Approximately Partitioning Vertices into Short Paths
by: Gong, Mingyang, et al.
Published: (2026)

On the Approximability of Unsplittable Flow on a Path with Time Windows
by: Armbruster, Alexander, et al.
Published: (2025)

A Faster Directed Single-Source Shortest Path Algorithm
by: Duan, Ran, et al.
Published: (2026)