2 papers
cs.CG2016
Lower Bounds for Graph Exploration Using Local Policies
Aditya Kumar Akash, Sandor P. Fekete, Seoung Kyou Lee +3
We give lower bounds for various natural node- and edge-based local strategies for exploring a graph. We consider this problem both in the setting of an arbitrary graph as well as…
cs.RO2015
A Parallel Distributed Strategy for Arraying a Scattered Robot Swarm
Dominik Krupke, Michael Hemmer, James McLurkin +2
We consider the problem of organizing a scattered group of robots in two-dimensional space, with geometric maximum distance between robots. The communication graph of the s…