Mapping simple polygons: how robots benefit from looking back (Q1939675): Difference between revisions

@@ Property / OpenAlex ID @@
+W2048209083
@@ Property / OpenAlex ID: W2048209083 / rank @@
+Normal rank
@@ Property / cites work @@
+The theory of search games and rendezvous.
@@ Property / cites work: The theory of search games and rendezvous. / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing Visibility Graphs with Simple Robots
+Normal rank
@@ Property / cites work @@
+Q4436038
@@ Property / cites work: Q4436038 / rank @@
+Normal rank
@@ Property / cites work @@
+How Simple Robots Benefit from Looking Back
@@ Property / cites work: How Simple Robots Benefit from Looking Back / rank @@
+Normal rank
@@ Property / cites work @@
+Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
+Normal rank
@@ Property / cites work @@
+Reconstructing a Simple Polygon from Its Angles
@@ Property / cites work: Reconstructing a Simple Polygon from Its Angles / rank @@
+Normal rank
@@ Property / cites work @@
+Gathering of asynchronous robots with limited visibility
+Normal rank
@@ Property / cites work @@
+Visibility Algorithms in the Plane
@@ Property / cites work: Visibility Algorithms in the Plane / rank @@
+Normal rank
@@ Property / cites work @@
+Mobile Agent Rendezvous in a Synchronous Torus
@@ Property / cites work: Mobile Agent Rendezvous in a Synchronous Torus / rank @@
+Normal rank
@@ Property / cites work @@
+Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
+Normal rank
@@ Property / cites work @@
+Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
+Normal rank