On validating planar worlds

MaRDI QIDQ2768382zbMATH OpenFDO

Authors Vida Dujmović, Sue Whitesides

Publication date 22 July 2002

zbMATH Keywords

embeddinglinear time algorithmmap validation problemplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Robot map verification of a graph world
• scientific article; zbMATH DE number 910901
• How to learn an unknown environment. I
• The Robot Localization Problem
• Mapping in unknown graph-like worlds

Cited in

(4)

• On the polynomially solvable problem of designing behavior of the intelligent robot
• Robot map verification of a graph world
• Optimal graph exploration without good maps
• Tree exploration with advice

This page was built for publication: On validating planar worlds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768382)