Full simulation videos, bounding box construction with Finite Automata
[this is the LONG video with the details. Overview (short) at • Recognition and Reconfiguration of Lattice... ]
Two finite automata robots build a bounding box around arbitrary polyominos. See full ICRA 2020 paper https://www.ibr.cs.tu-bs.de/users/fek... for details. All code @ https://github.com/AlienHunterD/2DTil...
A finite automata is a state-machine with no memory, which is why this paper is interesting.
ICRA 2020 Paper: “Recognition and Reconfiguration of Lattice-Based Cellular Structures by Simple Robots", authors: Eike Niehs, Arne Schmidt, Christian Scheffer, Daniel E. Biediger, Michael Yannuzzi, Benjamin Jenett, Amira Abdel-Rahman, Kenneth C. Cheung, Aaron T. Becker, and Sándor P. Fekete.
Table of Contents:
00:00 - NASA logo
08:40 - Shrine (example suggested by reviewer)
14:17 - IEEE logo
20:04 - UH logo
21:06 - Square 8x8
22:43 - SmallHook
23:21 - Backwards C
23:47 - Leggy 'n';
24:07 - Simple Z