Image de couverture de livre

Efficiently Reconfiguring a Connected Swarm of Labeled Robots

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Fekete, Sándor P., Kramer, Peter, Rieck, Christian, Scheffer, Christian, Schmidt, Arne
Format:	Preprint
Publié:	2022
Sujets:	Computational Geometry Data Structures and Algorithms Robotics F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Efficient Reconfiguration of Tile Arrangements by a Single Active Robot
par: Becker, Aaron T., et autres
Publié: (2025)

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
par: Fekete, Sándor P., et autres
Publié: (2024)

Guarding Offices with Maximum Dispersion
par: Fekete, Sándor P., et autres
Publié: (2025)

Sliding Squares in Parallel
par: Akitaya, Hugo A., et autres
Publié: (2024)

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
par: Garcia, Javier, et autres
Publié: (2025)

Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
par: Aichholzer, Oswin, et autres
Publié: (2026)

Guarding Polyominoes Under $k$-Hop Visibility
par: Filtser, Omrit, et autres
Publié: (2023)

Maximum Polygon Packing: The CG:SHOP Challenge 2024
par: Fekete, Sándor P., et autres
Publié: (2024)

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
par: Fekete, Sándor P., et autres
Publié: (2025)

Tile Reconfiguration by a Finite Automaton
par: Friemel, Jonas, et autres
Publié: (2025)

Structure and Independence in Hyperbolic Uniform Disk Graphs
par: Bläsius, Thomas, et autres
Publié: (2024)

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
par: Gudmundsson, Joachim, et autres
Publié: (2021)

Drainability and Fillability of Polyominoes in Diverse Models of Global Control
par: Fekete, Sándor P., et autres
Publié: (2025)

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
par: Gálvez, Waldo, et autres
Publié: (2025)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
par: Jansson, Jesper, et autres
Publié: (2024)

Optimal Window Queries on Line Segments using the Trapezoidal Search DAG
par: Brankovic, Milutin, et autres
Publié: (2021)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
par: Gudmundsson, Joachim, et autres
Publié: (2021)

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
par: de Berg, Mark, et autres
Publié: (2026)

Dispersive Vertex Guarding for Simple and Non-Simple Polygons
par: Fekete, Sándor P., et autres
Publié: (2024)

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
par: Le, Hung, et autres
Publié: (2021)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
par: Buchin, Kevin, et autres
Publié: (2026)

Online Maximum Independent Set of Hyperrectangles
par: Advani, Rishi, et autres
Publié: (2023)

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
par: Grandoni, Fabrizio, et autres
Publié: (2024)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
par: Deligkas, Argyrios, et autres
Publié: (2026)

A Framework for Algorithm Stability
par: Meulemans, Wouter, et autres
Publié: (2017)

Planar Network Diversion
par: Bentert, Matthias, et autres
Publié: (2025)

Simple in-place yet comparison-optimal Mergesort
par: Siebert, Christian
Publié: (2025)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
par: Le, Hung, et autres
Publié: (2023)

Connected Components in Linear Work and Near-Optimal Time
par: Farhadi, Alireza, et autres
Publié: (2023)

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
par: Hommelsheim, Felix, et autres
Publié: (2025)

Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces
par: Becker, Aaron T., et autres
Publié: (2024)

Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses
par: Chen, Lin, et autres
Publié: (2025)

Line Cover and Related Problems
par: Bentert, Matthias, et autres
Publié: (2025)

Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures
par: Hinnenthal, Kristian, et autres
Publié: (2024)

Tilt Automata: Gathering Particles With Uniform External Control
par: Fekete, Sándor P., et autres
Publié: (2026)

Multiplication of 0-1 matrices via clustering
par: Jansson, Jesper, et autres
Publié: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
par: Kowaluk, Mirosław, et autres
Publié: (2025)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
par: Elbassioni, Khaled
Publié: (2025)

Almost Tight Additive Guarantees for $k$-Edge-Connectivity
par: Kumar, Nikhil, et autres
Publié: (2025)

JFR: An Efficient Jump Frontier Relaxation Strategy for Bellman-Ford
par: Wang, Xin, et autres
Publié: (2025)