Piecemeal Graph Exploration by a Mobile Robot*
| dc.contributor.author | Awerbuch, Baruch | en_US |
| dc.contributor.author | Betke, Margrit | en_US |
| dc.contributor.author | Rivest, Ronald | en_US |
| dc.contributor.author | Singh, Mona | en_US |
| dc.date.accessioned | 2023-03-29T14:38:33Z | |
| dc.date.available | 2023-03-29T14:38:33Z | |
| dc.date.issued | 1995-01 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149233 | |
| dc.description.abstract | We study how a mobile robot can piecemeal learn an unknown environment. The robot's goal is to learn a complete map of its environment, while satisfying the constraint that it must return every so often to its starting position (for refueling, say). The environment is modelled as an arbitrary, undirected graph, which is initially unknown to the robot. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-516 | |
| dc.title | Piecemeal Graph Exploration by a Mobile Robot* | en_US |
