Copertina

Efficient Reconfiguration of Tile Arrangements by a Single Active Robot

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Becker, Aaron T., Fekete, Sándor P., Friemel, Jonas, Kosfeld, Ramin, Kramer, Peter, Kube, Harm, Rieck, Christian, Scheffer, Christian, Schmidt, Arne
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Computational Geometry Data Structures and Algorithms Robotics F.2.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

Sliding Squares in Parallel
di: Akitaya, Hugo A., et al.
Pubblicazione: (2024)

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

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

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

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

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

Simple in-place yet comparison-optimal Mergesort
di: Siebert, Christian
Pubblicazione: (2025)

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

Minimizing the Weighted Makespan with Restarts on a Single Machine
di: Amouzandeh, Aflatoun, et al.
Pubblicazione: (2025)

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

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
di: Duan, Ran, et al.
Pubblicazione: (2025)

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

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

Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures
di: Hinnenthal, Kristian, et al.
Pubblicazione: (2024)

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $Δ$-Coloring
di: Assadi, Sepehr, et al.
Pubblicazione: (2022)

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

Sliding Cubes in Parallel
di: Akitaya, Hugo A., et al.
Pubblicazione: (2026)

Calculation of the Comparative Efficiency of Algorithms Using a Single Metric
di: Chakraborty, Arya
Pubblicazione: (2024)

The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs
di: Chauhan, Archit, et al.
Pubblicazione: (2024)

The Power of Graph Doubling: Computing Ultrabubbles in a Bidirected Graph by Reducing to Weak Superbubbles
di: Schmidt, Sebastian, et al.
Pubblicazione: (2026)

Negative-Weight Single-Source Shortest Paths in Near-linear Time
di: Bernstein, Aaron, et al.
Pubblicazione: (2022)

Online Combinatorial Optimization with Graphical Dependencies
di: Gao, Zhimeng, et al.
Pubblicazione: (2025)

Offline green bin packing and its constrained variant
di: Gong, Mingyang, et al.
Pubblicazione: (2026)

Exploiting Low Scanwidth to Resolve Soft Polytomies
di: Bruchhold, Sebastian, et al.
Pubblicazione: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
di: Awofeso, Christine, et al.
Pubblicazione: (2025)

Online computation of normalized substring complexity
di: Kucherov, Gregory, et al.
Pubblicazione: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
di: Gong, Mingyang, et al.
Pubblicazione: (2025)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
di: Blomer, Valentin, et al.
Pubblicazione: (2026)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
di: Mosenzon, Ron
Pubblicazione: (2025)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
di: Lindermayr, Alexander, et al.
Pubblicazione: (2025)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
di: Emmerich, Michael
Pubblicazione: (2025)

Connected Components in Linear Work and Near-Optimal Time
di: Farhadi, Alireza, et al.
Pubblicazione: (2023)

Online $b$-Matching with Stochastic Rewards
di: Albers, Susanne, et al.
Pubblicazione: (2024)

Hierarchical Exponential Search Via K-Spines
di: Dong, Bob
Pubblicazione: (2025)

On the satisfability of random k-Horn formulae
di: Istrate, Gabriel
Pubblicazione: (2000)