How simple robots benefit from looking back

DOI10.1007/978-3-642-13073-1_21zbMATH Open1284.68587OpenAlexW1729886705MaRDI QIDQ3563005FDOQ3563005

Matúš Mihalák, J. Chalopin, Shantanu Das, Y. Disser, Peter Widmayer

Publication date: 28 May 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13073-1_21

Recommendations

• Mapping simple polygons: how robots benefit from looking back
• Mapping Simple Polygons
• Reconstructing visibility graphs with simple robots
• Reconstructing visibility graphs with simple robots
• Simple agents learn to find their way: an introduction on mapping polygons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Cited In (4)

• Reconstructing visibility graphs with simple robots
• A polygon is determined by its angles
• Simple Robots in Polygonal Environments: A Hierarchy
• Mapping simple polygons: how robots benefit from looking back

This page was built for publication: How simple robots benefit from looking back

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