Using a string to map the world

Literature and folklore is rife with a range of oracles that have been used by explorers to explore unknown environments. But how effective are these various oracles? This paper considers the power of string and string-like oracles to map an unknown embedded topological environment. We demonstrate that for undirected graphs, even very short strings can be used to explore an unknown environment but that significant performance improvements can be found when longer strings are available.

Authors

• Hui Wang 0068
• Michael Jenkin
• Patrick W. Dymond

Keywords

• Simultaneous localization and mapping
• Robot kinematics
• Measurement
• Conferences
• Robot motion
• Undirected
• Short Strings
• Sensory Information
• Shortest Path
• Free End
• Binary String
• Local Order
• Unknown Location
• String Length
• Depth-first
• Cost Of Algorithm
• Incident Edges