Mapping simple polygons: how robots benefit from looking back
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2006642 (Why is no real title available?)
- 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
- How simple robots benefit from looking back
- Mobile Agent Rendezvous in a Synchronous Torus
- Reconstructing a simple polygon from its angles
- Reconstructing visibility graphs with simple robots
- The theory of search games and rendezvous.
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- Visibility Algorithms in the Plane
Cited in
(8)- How simple robots benefit from looking back
- Meeting in a polygon by anonymous oblivious robots
- Reconstructing visibility graphs with simple robots
- Mapping a polygon with holes using a compass
- Reconstructing visibility graphs with simple robots
- Mapping a Polygon with Holes Using a Compass
- A general lower bound for collaborative tree exploration
- Simple agents learn to find their way: an introduction on mapping polygons
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)
