The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
| dc.contributor.author | Bender, Michael A. | en_US |
| dc.contributor.author | Slonim, Donna K. | en_US |
| dc.date.accessioned | 2023-03-29T14:39:18Z | |
| dc.date.available | 2023-03-29T14:39:18Z | |
| dc.date.issued | 1995-09 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149248 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-535 | |
| dc.title | The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs | en_US |
