Reconstructing visibility graphs with simple robots

DOI10.1016/J.TCS.2012.01.008MaRDI QIDQ442263zbMATHOpenAlexFDO

Authors Matúš Mihalák, Subhash Suri, D. Bilò, Y. Disser, E. Vicari, Peter Widmayer

Publication date 10 August 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.01.008

zbMATH Keywords

visibility graphsensorssimple robot

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Recommendations

• Reconstructing visibility graphs with simple robots
• scientific article; zbMATH DE number 5999543
• Mapping Simple Polygons
• Mapping simple polygons: how robots benefit from looking back
• How simple robots benefit from looking back

Cites work

• scientific article; zbMATH DE number 1629980 (Why is no real title available?)
• A polygon is determined by its angles
• Mapping in unknown graph-like worlds
• Planning Algorithms
• The polygon exploration problem
• Visibility Algorithms in the Plane

Cited in

(7)

• How simple robots benefit from looking back
• Mapping simple polygons: how robots benefit from looking back
• Mapping a polygon with holes using a compass
• Reconstructing visibility graphs with simple robots
• Mapping a Polygon with Holes Using a Compass
• Simple agents learn to find their way: an introduction on mapping polygons
• scientific article; zbMATH DE number 1161283 (Why is no real title available?)

This page was built for publication: Reconstructing visibility graphs with simple robots

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