Abstract
A new strategy for exploring unknown planar graph-like environments with the help of a single market is introduced. Experiments carried on random environments verify a linear average cost of the exploration. The proposed approach can also be extended to environments that include both metric and topological data.
Cite
CITATION STYLE
APA
Rekleitis, I. M., Dujmovic, V., & Dudek, G. (1999). Efficient topological exploration. Proceedings - IEEE International Conference on Robotics and Automation, 1, 676–681. https://doi.org/10.1109/robot.1999.770053
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free