Reconfiguring massive particle swarms with limited, global control

28Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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, until it hits a stationary obstacle or another stationary particle. In an open workspace, this system model is of limited use because it has only two controllable degrees of freedom - all particles receive the same inputs and move uniformly. We show that adding a maze of obstacles to the environment can make the system drastically more complex but also more useful. The resulting model matches ThinkFun's Tilt puzzle. If we are given a fixed set of stationary obstacles, we prove that it is NP-hard to decide whether a given initial configuration can be transformed into a desired target configuration. On the positive side, we provide constructive algorithms to design workspaces that efficiently implement arbitrary permutations between different configurations. © 2014 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Becker, A., Demaine, E. D., Fekete, S. P., Habibi, G., & McLurkin, J. (2013). Reconfiguring massive particle swarms with limited, global control. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8243 LNCS, pp. 51–66). Springer Verlag. https://doi.org/10.1007/978-3-642-45346-5_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free