Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296): Difference between revisions

@@ Property / describes a project that uses @@
+ROS
@@ Property / describes a project that uses: ROS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.artint.2019.02.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2911544206
@@ Property / OpenAlex ID: W2911544206 / rank @@
+Normal rank
@@ Property / cites work @@
+Searching for targets who want to be found
@@ Property / cites work: Searching for targets who want to be found / rank @@
+Normal rank
@@ Property / cites work @@
+Yet more on the linear search problem
@@ Property / cites work: Yet more on the linear search problem / rank @@
+Normal rank
@@ Property / cites work @@
+Searching in the plane
@@ Property / cites work: Searching in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
+Normal rank
@@ Property / cites work @@
+Agent searching in a tree and the optimality of iterative deepening
+Normal rank
@@ Property / cites work @@
+The Rendezvous Search Problem
@@ Property / cites work: The Rendezvous Search Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Rendezvous Search on the Line with Indistinguishable Players
+Normal rank
@@ Property / cites work @@
+Note: Two rendezvous search problems on the line
@@ Property / cites work: Note: Two rendezvous search problems on the line / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934584
@@ Property / cites work: Q2934584 / rank @@
+Normal rank
@@ Property / cites work @@
+Asynchronous Deterministic Rendezvous on the Line
@@ Property / cites work: Asynchronous Deterministic Rendezvous on the Line / rank @@
+Normal rank
@@ Property / cites work @@
+Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
+Normal rank
@@ Property / cites work @@
+Rendezvous Search on the Line with Distinguishable Players
+Normal rank
@@ Property / cites work @@
+Rendezvous Search on the Line
@@ Property / cites work: Rendezvous Search on the Line / rank @@
+Normal rank
@@ Property / cites work @@
+Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
+Normal rank
@@ Property / cites work @@
+Asynchronous deterministic rendezvous in graphs
@@ Property / cites work: Asynchronous deterministic rendezvous in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic rendezvous in graphs
@@ Property / cites work: Deterministic rendezvous in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+How to meet asynchronously (almost) everywhere
@@ Property / cites work: How to meet asynchronously (almost) everywhere / rank @@
+Normal rank
@@ Property / cites work @@
+How to meet asynchronously at polynomial cost
@@ Property / cites work: How to meet asynchronously at polynomial cost / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+How to meet in anonymous network
@@ Property / cites work: How to meet in anonymous network / rank @@
+Normal rank
@@ Property / cites work @@
+The rendezvous problem on discrete locations
@@ Property / cites work: The rendezvous problem on discrete locations / rank @@
+Normal rank
@@ Property / cites work @@
+Rendezvous in Higher Dimensions
@@ Property / cites work: Rendezvous in Higher Dimensions / rank @@
+Normal rank
@@ Property / cites work @@
+Two Dimensional Rendezvous Search
@@ Property / cites work: Two Dimensional Rendezvous Search / rank @@
+Normal rank
@@ Property / cites work @@
+Q2783190
@@ Property / cites work: Q2783190 / rank @@
+Normal rank
@@ Property / cites work @@
+Tell Me Where I Am So I Can Meet You Sooner
@@ Property / cites work: Tell Me Where I Am So I Can Meet You Sooner / rank @@
+Normal rank
@@ Property / cites work @@
+Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
+Normal rank
@@ Property / cites work @@
+Gathering of asynchronous robots with limited visibility
+Normal rank
@@ Property / cites work @@
+Structural Information and Communication Complexity
+Normal rank
@@ Property / cites work @@
+Gathering few fat mobile robots in the plane
@@ Property / cites work: Gathering few fat mobile robots in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501371
@@ Property / cites work: Q5501371 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic gathering with crash faults
@@ Property / cites work: Deterministic gathering with crash faults / rank @@
+Normal rank
@@ Property / cites work @@
+Rendezvous of Two Robots with Constant Memory
@@ Property / cites work: Rendezvous of Two Robots with Constant Memory / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
+Normal rank
@@ Property / cites work @@
+LATIN 2004: Theoretical Informatics
@@ Property / cites work: LATIN 2004: Theoretical Informatics / rank @@
+Normal rank
@@ Property / cites work @@
+Q2762510
@@ Property / cites work: Q2762510 / rank @@
+Normal rank
@@ Property / cites work @@
+The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
+Normal rank
@@ Property / cites work @@
+How to learn an unknown environment. I
@@ Property / cites work: How to learn an unknown environment. I / rank @@
+Normal rank
@@ Property / cites work @@
+Q3150180
@@ Property / cites work: Q3150180 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4335188
@@ Property / cites work: Q4335188 / rank @@
+Normal rank
@@ Property / cites work @@
+Exploring unknown environments with obstacles
@@ Property / cites work: Exploring unknown environments with obstacles / rank @@
+Normal rank
@@ Property / cites work @@
+A competitive analysis of algorithms for searching unknown scenes
+Normal rank
@@ Property / cites work @@
+Spanning-tree based coverage of continuous areas by a mobile robot
+Normal rank
@@ Property / cites work @@
+Competitive on-line coverage of grid environments by a mobile robot
+Normal rank
@@ Property / cites work @@
+Polygon exploration with time-discrete vision
@@ Property / cites work: Polygon exploration with time-discrete vision / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case optimal exploration of terrains with obstacles
+Normal rank
@@ Property / cites work @@
+The giving tree: Constructing trees for efficient offline and online multi-robot coverage
+Normal rank
@@ Property / cites work @@
+Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
+Normal rank