Mapping simple polygons: how robots benefit from looking back
From MaRDI portal
Publication:1939675
DOI10.1007/s00453-011-9572-8zbMath1259.68189MaRDI QIDQ1939675
Jérémie Chalopin, Yann Disser, Shantanu Das, Peter Widmayer, Matúš Mihalák
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
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68T40: Artificial intelligence for robotics
Related Items
Mapping a Polygon with Holes Using a Compass, A general lower bound for collaborative tree exploration, Mapping a polygon with holes using a compass, Meeting in a polygon by anonymous oblivious robots, Simple agents learn to find their way: an introduction on mapping polygons
Cites Work
- Unnamed Item
- Gathering of asynchronous robots with limited visibility
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- The theory of search games and rendezvous.
- Reconstructing Visibility Graphs with Simple Robots
- Mobile Agent Rendezvous in a Synchronous Torus
- How Simple Robots Benefit from Looking Back
- Reconstructing a Simple Polygon from Its Angles
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Visibility Algorithms in the Plane