Graph grammars for self assembling robotic systems

In this paper we define a class of graph grammars that can be used to model and direct distributed robotic assembly or formation forming processes. We focus on the problem of synthesizing a grammar so that it generates a given, prespecified assembly. In particular, to generate an acyclic graph we synthesize a binary grammar (rules involve at most two parts), and for a general graph we synthesize a ternary grammar (rules involve at most three parts). We then show a general result that implies that no binary grammar can generate a unique stable assembly. We conclude the paper with a discussion of how graph grammars can be used to direct the synthesis of parts floating in a fluid or for self-motive robotic parts.

[1]  Eric Klavins.  Toward the Control of Self-Assembling Systems , 2003, Control Problems in Robotics.

[2]  Panos M. Pardalos,et al.  Cooperative Control: Models, Applications, and Algorithms , 2003 .

[3]  Eric Klavins.  A Formal Model of a Multi-Robot Control and Communication Task , 2003 .

[4]  R L Thompson,et al.  Movable Finite Automata (MFA) models for biological systems. I: Bacteriophage assembly and operation. , 1988, Journal of theoretical biology.

[5]  Eric Klavins.  Automatically synthesized controllers for distributed assembly: Partial correctness , 2002 .

[6]  Yakov B. Kazanovich,et al.  A Combinatorial Approach to the Problem of Self-assembly , 1995, Discret. Appl. Math..

[7]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8]  Kazuhiro Saitou,et al.  Automated Optimal Design of Mechanical Conformational Switches , 1995, Artificial Life.

[9]  E. Winfree.  Algorithmic Self-Assembly of DNA: Theoretical Motivations and 2D Assembly Experiments , 2000, Journal of biomolecular structure & dynamics.

[10]  Vaughan R. Pratt,et al.  Modeling concurrency with geometry , 1991, POPL '91.

[11]  Kazuhiro Saitou,et al.  Conformational switching in self-assembling mechanical systems , 1999, IEEE Trans. Robotics Autom..

[12]  B Berger,et al.  Local rule-based theory of virus shell assembly. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[13]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[14]  Hartmut Ehrig,et al.  Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[15]  Hao Wang.  Notes on a class of tiling problems , 1975 .

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

[17]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[18]  Maja J. Mataric,et al.  From local to global behavior in intelligent self-assembly , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[19]  R. Ho.  Algebraic Topology , 2022 .

[20]  G. Whitesides,et al.  Self-Assembly of Mesoscale Objects into Ordered Two-Dimensional Arrays , 1997, Science.

[21]  Eric Klavins,et al.  Automatic synthesis of controllers for distributed assembly and formation forming , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).