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

Authors:
Daniel Yamins;Radhika Nagpal
Affiliations:
Harvard University, Cambridge, MA;Harvard University, Cambridge, MA
Venue:
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Year:
2008

Citing 5
Cited 6

Amorphous computing

Communications of the ACM
Self-reconfiguring robots

Communications of the ACM - Robots: intelligence, versatility, adaptivity
Programming a paintable computer

Programming a paintable computer
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata
A theory of local-to-global algorithms for one-dimensional spatial multi-agent systems

A theory of local-to-global algorithms for one-dimensional spatial multi-agent systems

On the collective sort problem for distributed tuple spaces

Science of Computer Programming
A CA-Based Self-organizing Environment: A Configurable Adaptive Illumination Facility

PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
A computational framework for modelling multicellular biochemistry

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Distributed systems – from natural to engineered: three phases of inspiration by nature

International Journal of Bio-Inspired Computation
A Framework for Modelling and Simulating Networks of Cells

Electronic Notes in Theoretical Computer Science (ENTCS)
CA-based self-organizing environments

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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".