The problem of selection of a minimal set of visual landmarks

MaRDI QIDQ4919207zbMATH OpenFDO

Authors Anna Gorbenko, Vladimir Popov

Publication date 8 May 2013

Full work available at URL http://www.m-hikari.com/ams/ams-2012/ams-93-96-2012/index.html

zbMATH Keywords

landmarks selectionNP-completevisual landmarks

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Artificial intelligence for robotics (68T40)

Recommendations

• Computational experiments for the problem of selection of a minimal set of visual landmarks
• Learning to select distinctive landmarks for mobile robot navigation
• scientific article; zbMATH DE number 1944879
• Visually-guided robot navigation: from artificial to natural landmarks
• Reliable mobile robot navigation from unreliable visual cues

Cited in

(3)

• On the problem of placement of visual landmarks
• Learning to select distinctive landmarks for mobile robot navigation
• Computational experiments for the problem of selection of a minimal set of visual landmarks

This page was built for publication: The problem of selection of a minimal set of visual landmarks

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