Uniform robot relocation is hard in only two directions even without obstacles

DOI10.1007/978-3-031-34034-5_2MaRDI QIDQ6149111zbMATH OpenFDO

Authors David Caballero, Angel A. Cantu, Timothy Gomez, Austin Luchsinger, Robert T. Schweller, Tim Wylie

Publication date 12 January 2024

Published in Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-34034-5_2

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites work

• Fast reconfiguration of robot swarms with uniform control signals
• Full tilt: universal constructors for general shapes with uniform external forces
• Hierarchical Shape Construction and Complexity for Slidable Polyominoes under Uniform External Forces
• Reconfiguring massive particle swarms with limited, global control

Cited in

(2)

• Uniform robot relocation is hard in only two directions even without obstacles
• Drainability and fillability of polyominoes in diverse models of global control

This page was built for publication: Uniform robot relocation is hard in only two directions even without obstacles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149111)