Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

HYBRID
2007
Springer

favoriteEmaildiscussreport

131views Control Systems» more HYBRID 2007»

Solving Coverage Problems with Embedded Graph Grammars

13 years 11 months ago

Solving Coverage Problems with Embedded Graph Grammars

Download faculty.washington.edu

We show how Embedded Graph Grammars (EGGs) are used to specify local interaction rules between mobile robots in a natural manner. This formalism allows us to treat local network topologies, geometric transition conditions, and individual robot dynamics and control modes in a unified framework. An example EGG is demonstrated that achieves sensor coverage in a provably stable and correct manner. The algorithm results in a global network with a lattice-like triangulation.

John-Michael McNew, Eric Klavins, Magnus Egerstedt

Real-time Traffic

Control Systems | Embedded Graph Grammars | HYBRID 2007 | Local Interaction Rules | Local Network Topologies |

claim paper

Related Content

» Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial kTrees

» Automatic Grammar Partitioning for Syntactic Parsing

» Strong Barrier Coverage with Directional Sensors

» An Efficient Algorithm for Solving the DyckCFL Reachability Problem on Trees

» Olog nLocalized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks

» Barrier Coverage for Variable BoundedRange LineofSight Guards

» Computing minimum distortion embeddings into a path for bipartite permutation graphs and t...

» A decentralised coordination algorithm for minimising conflict and maximising coverage in ...

» Effective error prediction using decision tree for ASR grammar network in call system

Post Info
More Details (n/a)

Added	16 Aug 2010
Updated	16 Aug 2010
Type	Conference
Year	2007
Where	HYBRID
Authors	John-Michael McNew, Eric Klavins, Magnus Egerstedt

Comments (0)