Automated global-to-local programming in 1-D spatial multi-agent systems

A spatial computer is a distributed multi-agent system that is embedded in a geometric space. A key challenge is engineering local agent interaction rules that enable spatial computers to robustly achieve global computational tasks. This paper develops a principled approach to global-to-local programming, for pattern formation problems in a one-dimensional multi-agent model. We present theoretical analysis that addresses the existence, construction, and resource tradeoffs of robust local rule solutions to global patterns, and which together form a "global-to-local compiler".

[1]  John H. Conway,et al.  The game of life. , 1996, The Hastings Center report.

[2]  Zack J. Butler,et al.  Self-reconfiguring robots , 2002, CACM.

[3]  Eric Klavins.  Directed Self-Assembly Using Graph Grammars , 2004 .

[4]  Matt Welsh,et al.  Monitoring volcanic eruptions with a wireless sensor network , 2005, Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005..

[5]  Chris Hanson,et al.  Amorphous computing , 2000, Commun. ACM.

[6]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[7]  Calin Belta,et al.  Hierarchical abstractions for robotic swarms , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[8]  V. Michael Bove,et al.  Programming a paintable computer , 2002 .

[9]  Radhika Nagpal,et al.  A theory of local-to-global algorithms for one-dimensional spatial multi-agent systems , 2008 .

[10]  Nicholas R. Jennings,et al.  Agent Theories, Architectures, and Languages: A Survey , 1995, ECAI Workshop on Agent Theories, Architectures, and Languages.

[11]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .