2020
DOI: 10.1007/978-3-030-44051-0_42
|View full text |Cite
|
Sign up to set email alerts
|

CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2
2

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…On a node there can be at most one robot at any time. It should be pointed out that similar models, where a set of finite automata manipulates passive materials in a square grid, have been considered in [6,17,24] under connectivity preservation requirements, and in [16] without connectivity constraints.…”
Section: Framework and Backgroundmentioning
confidence: 99%
“…On a node there can be at most one robot at any time. It should be pointed out that similar models, where a set of finite automata manipulates passive materials in a square grid, have been considered in [6,17,24] under connectivity preservation requirements, and in [16] without connectivity constraints.…”
Section: Framework and Backgroundmentioning
confidence: 99%
“…The results of this section summarize joint work with Amira Abdel-Rahman, Aaron Becker, Daniel Biediger, Kenny Cheung, Neil Gershenfeld, Sabrina Hugo, Ben Jenett, Phillip Keldenich, Eike Niehs, Christian Rieck, Arne Schmidt, Christian Scheffer, and Michael Yannuzzi. See our papers [15,25] for further details; the shown video [1] is available at https://www.ibr.cs.tu-bs.de/users/fekete/ Videos/SoCG/2020/SpaceAnts SoCG.mp4.…”
Section: %mentioning
confidence: 99%