On validating planar worlds

Authors:
Vida Dujmoviác;Sue Whitesides
Affiliations:
-;School of Computer Science, McGill University, 3480 University ST., Montreal, Québec, Canada
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 2
Cited 4

Exploring unknown environments

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The power of a pebble: exploring and mapping directed graphs

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Optimal graph exploration without good maps

Theoretical Computer Science
Tree exploration with advice

Information and Computation
Pure topological mapping in mobile robotics

IEEE Transactions on Robotics
Tree exploration with an oracle

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an optimal linear time algorithm for solving a map validation problem: a robot equipped with one portable marker must determine the correctness of a given map of its graph-like world, modelled as a possibly non-planar embedding of a planar graph.