By Topic

Self-assembly from the point of view of its pieces

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Klavins, E. ; Dept. of Electr. Eng., Washington Univ., Seattle, WA

A graph grammar can be used to describe or direct the changing connection topology of a collection of, for example, self-organizing robots. Productions in a grammar describe the legal local interactions in which the robots may engage and the resulting global structures and processes that form can be analyzed by looking at the set of reachable graphs generated by the grammar. In this paper we discuss the relationship between a grammar and its characteristic automata set, which describes the trajectories of the grammar from the "point of view" of the components of the initial graph. The automata set of a grammar is essentially a Petri-Net description of these pathways and is related to the grammar as a metabolic network is related to a set of chemical reactions. It is useful for the analysis of the behavior of the grammar

Published in:

American Control Conference, 2006

Date of Conference:

14-16 June 2006