Particle computation: complexity, algorithms, and logic

We investigate algorithmic control of a large swarm of mobile particles (such as robots, sensors, or building material) that move in a 2D workspace using a global input signal (such as gravity or a magnetic field). Upon activation of the field, each particle moves maximally in the same direction unt...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Natural computing Ročník 18; číslo 1; s. 181 - 201
Hlavní autori:	Becker, Aaron T., Demaine, Erik D., Fekete, Sándor P., Lonsford, Jarrett, Morris-Wright, Rose
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Dordrecht Springer Netherlands 01.03.2019 Springer Nature B.V
Predmet:	Algorithms Artificial Intelligence Complex Systems Complexity Computer Science Computer simulation Configurations Digital electronics Evolutionary Biology Gates Gravitation Inverse problems Logic Logic circuits Permutations Processor Architectures Replicating Stability Theory of Computation Robot swarms Uniform inputs Nano-particles Programmable matter PSPACE-completeness Parallel motion planning NP-completeness Logic gates Array permutations Universal computation Efficient algorithms Complexity
ISSN:	1567-7818, 1572-9796
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!