Mapping simple polygons: how robots benefit from looking back
type: Item
instance of: scholarly article
title: Mapping simple polygons: how robots benefit from looking back
zbMATH Open document ID: 1259.68189
author: J. Chalopin
author: Shantanu Das
author: Y. Disser
author: Matúš Mihalák
author: Peter Widmayer
published in: Algorithmica
publication date: 2013-03-05T00:00:00Z
full work available at URL: http://hdl.handle.net/20.500.11850/63766
Mathematics Subject Classification ID: 68T40
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 6141214
zbMATH Keywords: polygon
zbMATH Keywords: mapping
zbMATH Keywords: visibility graph
zbMATH Keywords: rendezvous
zbMATH Keywords: robot
MaRDI profile type: Publication
OpenAlex ID: W2048209083
cites work: The theory of search games and rendezvous.
cites work: Reconstructing Visibility Graphs with Simple Robots
cites work: Q4436038
cites work: How Simple Robots Benefit from Looking Back
cites work: Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
cites work: Reconstructing a Simple Polygon from Its Angles
cites work: Gathering of asynchronous robots with limited visibility
cites work: Visibility Algorithms in the Plane
cites work: Mobile Agent Rendezvous in a Synchronous Torus
cites work: Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
cites work: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
DOI: 10.1007/S00453-011-9572-8
description: scientific article; zbMATH DE number 6141214