Solving Coverage Problems with Embedded Graph Grammars
From MaRDI portal
Publication:3612991
DOI10.1007/978-3-540-71493-4_33zbMath1221.68246MaRDI QIDQ3612991
Eric Klavins, John-Michael McNew, Magnus B. 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
93C85: Automated systems (robots, etc.) in control theory
68Q42: Grammars and rewriting systems
68T40: Artificial intelligence for robotics
Related Items
From drinking philosophers to asynchronous path-following robots, Necessary and sufficient conditions for containment control of networked multi-agent systems, Manipulability of leader-follower networks with the rigid-link approximation, Containment in leader-follower networks with switching communication topologies