We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Piecemeal Graph Exploration by a Mobile Robot*

Thumbnail Image
Download
Name

MIT-LCS-TM-516.pdf

Size

1.38 MB

Format

Adobe PDF

Checksum (MD5)

ba1e422d869bebfc2dc9cca5167c3beb

Author(s)
Awerbuch, Baruch
•
Betke, Margrit
•
Rivest, Ronald
•
Singh, Mona
Date Issued
January 1995
Series/Report no.
MIT-LCS-TM-516
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.