Mapping simple polygons: how robots benefit from looking back
From MaRDI portal
Publication:1939675
DOI10.1007/S00453-011-9572-8zbMATH Open1259.68189OpenAlexW2048209083MaRDI QIDQ1939675FDOQ1939675
Authors: J. Chalopin, Shantanu Das, Y. Disser, Matúš Mihalák, Peter Widmayer 
Publication date: 5 March 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/63766
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)
Cites Work
- The theory of search games and rendezvous.
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Gathering of asynchronous robots with limited visibility
- Visibility Algorithms in the Plane
- Title not available (Why is that?)
- Reconstructing visibility graphs with simple robots
- Reconstructing a simple polygon from its angles
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- Mobile Agent Rendezvous in a Synchronous Torus
- How simple robots benefit from looking back
Cited In (8)
- A general lower bound for collaborative tree exploration
- Reconstructing visibility graphs with simple robots
- Simple agents learn to find their way: an introduction on mapping polygons
- Reconstructing visibility graphs with simple robots
- Mapping a polygon with holes using a compass
- Mapping a Polygon with Holes Using a Compass
- How simple robots benefit from looking back
- Meeting in a polygon by anonymous oblivious robots
This page was built for publication: Mapping simple polygons: how robots benefit from looking back
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1939675)
