Reconstructing visibility graphs with simple robots

DOI10.1016/J.TCS.2012.01.008zbMATH Open1243.68286OpenAlexW2108167214MaRDI QIDQ442263FDOQ442263

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

Recommendations

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

zbMATH Keywords

visibility graphsensorssimple robot

Mathematics Subject Classification ID

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

Cites Work

• Planning Algorithms
• The polygon exploration problem
• Visibility Algorithms in the Plane
• Title not available (Why is that?)
• A polygon is determined by its angles
• Mapping in unknown graph-like worlds

Cited In (7)

• Title not available (Why is that?)
• Reconstructing visibility graphs with simple robots
• Simple agents learn to find their way: an introduction on mapping polygons
• Mapping a polygon with holes using a compass
• Mapping a Polygon with Holes Using a Compass
• Mapping simple polygons: how robots benefit from looking back
• How simple robots benefit from looking back

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)