The power of team exploration: two robots can learn unlabeled directed graphs

@article{Bender1994ThePO,
  title={The power of team exploration: two robots can learn unlabeled directed graphs},
  author={Michael A. Bender and Donna K. Slonim},
  journal={Proceedings 35th Annual Symposium on Foundations of Computer Science},
  year={1994},
  pages={75-85}
}
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new type of homing sequence for two robots which helps the robots recognize certain previously-seen nodes. We then present an algorithm in which the robots learn the graph and the homing sequence simultaneously by wandering actively through the graph. Unlike most previous learning results using homing sequences, our algorithm… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 129 CITATIONS, ESTIMATED 90% COVERAGE

Structural Information and Communication Complexity

  • Lecture Notes in Computer Science
  • 2017
VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Learning Random Regular Graphs

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Principles of Distributed Systems

  • Lecture Notes in Computer Science
  • 2012
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Exploring Topological Environments

VIEW 9 EXCERPTS
CITES METHODS, RESULTS & BACKGROUND
HIGHLY INFLUENCED

Learning and vision algorithms for robot navigation

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1995
2019

CITATION STATISTICS

  • 16 Highly Influenced Citations

References

Publications referenced by this paper.