Solving Coverage Problems with Embedded Graph Grammars

DOI10.1007/978-3-540-71493-4_33MaRDI QIDQ3612991zbMATH OpenOpenAlexFDO

Authors John-Michael McNew, E. Klavins, Magnus Egerstedt

Publication date 11 March 2009

Published in Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71493-4_33

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Artificial intelligence for robotics (68T40) Automated systems (robots, etc.) in control theory (93C85)

Recommendations

• Graph grammars with path-controlled embedding
• scientific article; zbMATH DE number 777290
• scientific article; zbMATH DE number 4049103
• scientific article; zbMATH DE number 5003534
• scientific article; zbMATH DE number 3888930
• scientific article; zbMATH DE number 3885330
• scientific article; zbMATH DE number 3872712
• Integration of graph constraints into graph grammars
• scientific article; zbMATH DE number 1406158
• Controllable Combinatorial Coverage in Grammar-Based Testing

Cited in

(5)

• Containment in leader-follower networks with switching communication topologies
• Necessary and sufficient conditions for containment control of networked multi-agent systems
• From drinking philosophers to asynchronous path-following robots
• Controllable Combinatorial Coverage in Grammar-Based Testing
• Manipulability of leader-follower networks with the rigid-link approximation

This page was built for publication: Solving Coverage Problems with Embedded Graph Grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612991)