2006
DOI: 10.1109/tac.2006.876950
|View full text |Cite
|
Sign up to set email alerts
|

A Grammatical Approach to Self-Organizing Robotic Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
89
0

Year Published

2006
2006
2022
2022

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 116 publications
(90 citation statements)
references
References 24 publications
1
89
0
Order By: Relevance
“…Systems and languages for the assembly of shapes and structures have seen increasing attention recently [9], [10], [11], [12], [13], [14]. These works focus on operational aspects of getting pieces into place to form a structure, rather than physical properties of those structures or the systems doing the assembling.…”
Section: Related Workmentioning
confidence: 99%
“…Systems and languages for the assembly of shapes and structures have seen increasing attention recently [9], [10], [11], [12], [13], [14]. These works focus on operational aspects of getting pieces into place to form a structure, rather than physical properties of those structures or the systems doing the assembling.…”
Section: Related Workmentioning
confidence: 99%
“…The algorithms are inspired by cellular automata and control is based on geometric rules. Klavins et al (2006) have tackled the problem of defining a class of graph grammars that can be used to model and direct distributed robotic self-assembly. The authors show how a grammar that generates a desired, pre-specified target morphology can be synthesized.…”
Section: Related Workmentioning
confidence: 99%
“…No comprehensive dynamical systems model or programming discipline has yet been developed for these systems, although the graph grammar approach built on here and introduced elsewhere [8] is an important start. Besides the grammatical approach, the most relevant work toward understanding self-assembly "programs" in a stochastic setting is in nucleic acid design [5], where the free-energy landscape associated with DNA hybridization reactions can be engineered.…”
Section: Related Workmentioning
confidence: 99%
“…The following definition is similar to that in [8], except adapted for graphs with two edge types and restricted to rules of the form described above. It states formally how trajectories are obtained by rewriting a graph locally according to a binary or unary rule.…”
Section: A Graphs and Rewrite Rulesmentioning
confidence: 99%
See 1 more Smart Citation