Reconstructing visibility graphs with simple robots

DOI10.1016/j.tcs.2012.01.008zbMath1243.68286OpenAlexW2108167214MaRDI QIDQ442263

Matúš Mihalák, Subhash Suri, Davide Bilò, Peter Widmayer, Elias Vicari, Yann Disser

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)

Related Items

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

Cites Work

• Unnamed Item
• A polygon is determined by its angles
• The Polygon Exploration Problem
• Mapping in unknown graph-like worlds
• Visibility Algorithms in the Plane
• Planning Algorithms