The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
Name
MIT-LCS-TM-535.pdf
Size
2.39 MB
Format
Adobe PDF
Checksum (MD5)
f1cb32853253020a32073730b911ffde
Author(s)
Bender, Michael A.
Slonim, Donna K.
Date Issued
September 1995
Series/Report no.
MIT-LCS-TM-535
Abstract
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 robots, which helps the robots recognize certain previously-seen nodes. We represent an algorithm in which the robots learn the graph and the homing sequence simultaneously by actively wandering through the graph.
Persistent DSpace Link
