Rendezvous in planar environments with obstacles and unknown initial distance
From MaRDI portal
Publication:2321296
DOI10.1016/j.artint.2019.02.001zbMath1478.68378OpenAlexW2911544206MaRDI QIDQ2321296
Andrew Beveridge, Volkan Isler, Deniz Ozsoyeller
Publication date: 28 August 2019
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2019.02.001
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)
Related Items (2)
The faulty Satnav (GPS) problem: search for home in networks with unreliable directions ⋮ Rendezvous Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Worst-case optimal exploration of terrains with obstacles
- Gathering of asynchronous robots with limited visibility
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- A competitive analysis of algorithms for searching unknown scenes
- Searching in the plane
- How to meet in anonymous network
- Gathering few fat mobile robots in the plane
- The giving tree: Constructing trees for efficient offline and online multi-robot coverage
- Polygon exploration with time-discrete vision
- Agent searching in a tree and the optimality of iterative deepening
- Competitive on-line coverage of grid environments by a mobile robot
- Spanning-tree based coverage of continuous areas by a mobile robot
- Asynchronous deterministic rendezvous in graphs
- Deterministic rendezvous in graphs
- Yet more on the linear search problem
- Rendezvous of Two Robots with Constant Memory
- How to meet asynchronously (almost) everywhere
- Rendezvous in Higher Dimensions
- The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
- Tell Me Where I Am So I Can Meet You Sooner
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
- Asynchronous Deterministic Rendezvous on the Line
- Two Dimensional Rendezvous Search
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- How to learn an unknown environment. I
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Note: Two rendezvous search problems on the line
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Searching for targets who want to be found
- Rendezvous Search on the Line
- Deterministic gathering with crash faults
- The Rendezvous Search Problem
- Rendezvous Search on the Line with Distinguishable Players
- Rendezvous Search on the Line with Indistinguishable Players
- Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
- How to meet asynchronously at polynomial cost
- Structural Information and Communication Complexity
- Algorithms and Computation
- The rendezvous problem on discrete locations
- LATIN 2004: Theoretical Informatics
- Exploring unknown environments with obstacles
This page was built for publication: Rendezvous in planar environments with obstacles and unknown initial distance
