Aditya Kumar Akash

Learn More
— We present and analyze methods for patrolling an environment with a distributed swarm of robots. Our approach uses a physical data structure – a distributed triangulation of the workspace. A large number of stationary " mapping " robots cover and triangulate the environment and a smaller number of mobile " patrolling " robots move amongst them. The focus(More)
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 the abstraction of a geometric exploration of a space by a robot, both of which have been extensively studied. We consider local exploration policies that use time-of-last-visit or(More)
  • 1