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

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

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

Full text

Pdf (3.17 MB)

Source

International Conference on Autonomous Agents archive
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 table of contents

Estoril, Portugal

SESSION: Agent cooperation table of contents

Pages 615-622

Year of Publication: 2008

ISBN:978-0-9817381-1-6

Authors

Daniel Yamins	Harvard University, Cambridge, MA
Radhika Nagpal	Harvard University, Cambridge, MA

Sponsors

AAAI : Association for the Advancement of Artifical Intelligence
ACM: Association for Computing Machinery

Publisher

International Foundation for Autonomous Agents and Multiagent Systems Richland, SC

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 38, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

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

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Harold Abelson , Don Allen , Daniel Coore , Chris Hanson , George Homsy , Thomas F. Knight, Jr. , Radhika Nagpal , Erik Rauch , Gerald Jay Sussman , Ron Weiss, Amorphous computing, Communications of the ACM, v.43 n.5, p.74-82, May 2000 [doi>10.1145/332833.332842]
	2	William Joseph Butera , V. Michael Bove, Jr., Programming a paintable computer, Massachusetts Institute of Technology, 2002
	3	J. Conway. The game of life. Scientific American, March 1970.
	4	N. DeBruijn. A combinatorial problem. Indagationes Math., 8, 1946.
	5	E. Klavins. Directed self-assembly using graph grammars. In Foundations of Nanoscience, 2004.
	6	M. Kloetzer and C. Belta. Hierarchical abstractions for robotic swarms. In Proc. IEEE ICRA 06, 2006.
	7	R. Nagpal. Programmable Self-Assembly. PhD thesis, MIT, 2001.
	8	R. Olfati-Saber et al. In Proc. CDC03, 2003.
	9	G. Poulton et al. Agent Theories, Architectures, and Languages, 2004.
	10	Daniela Rus , Zack Butler , Keith Kotay , Marsette Vona, Self-reconfiguring robots, Communications of the ACM, v.45 n.3, March 2002 [doi>10.1145/504729.504752]
	11	John Von Neumann , Arthur W. Burks, Theory of Self-Reproducing Automata, University of Illinois Press, Champaign, IL, 1966
	12	G. Werner Allen et al. Monitoring volcanic eruptions. In Proc. EWSN 05, 2005.
	13	S. Wolfram. Rev. Mod. Phys., 55, 1983.
	14	L. Wolpert. Positional information. J. Theor. Bio., 25(1), 1969.
	15	D. Yamins. A Theory of Local to Global for One-Dimensional Multi-Agent Systems. PhD thesis.