Deterministic polynomial approach in the plane

DOI10.1007/S00446-014-0216-5MaRDI QIDQ2353250zbMATH OpenOpenAlexFDO

Authors Yoann Dieudonné, Andrzej Pelc

Publication date 8 July 2015

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-014-0216-5

zbMATH Keywords

deterministic algorithmmobile agentpolynomial timerendezvousplaneinfinite grid

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Recommendations

• Deterministic Polynomial Approach in the Plane
• Asynchronous approach in the plane: a deterministic polynomial algorithm
• Asynchronous approach in the plane: a deterministic polynomial algorithm
• Algorithms and Computation
• How to meet asynchronously (almost) everywhere

Cites work

• scientific article; zbMATH DE number 1688369 (Why is no real title available?)
• scientific article; zbMATH DE number 2038783 (Why is no real title available?)
• scientific article; zbMATH DE number 2102782 (Why is no real title available?)
• Almost optimal asynchronous rendezvous in infinite multidimensional grids
• Anonymous Meeting in Networks
• Asynchronous deterministic rendezvous in graphs
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Delays induce an exponential memory gap for rendezvous in trees
• Deterministic rendezvous in graphs
• Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Gathering asynchronous oblivious mobile robots in a ring
• Gathering despite mischief
• How to Meet in Anonymous Network
• How to meet asynchronously (almost) everywhere
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• LATIN 2004: Theoretical Informatics
• Minimax Rendezvous on the Line
• Probability and Computing
• Randomized Rendez-Vous with Limited Memory
• Rendezvous search on a graph
• Rendezvous search on labeled networks
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
• Tell Me Where I Am So I Can Meet You Sooner
• The Rendezvous Search Problem
• The rendezvous problem on discrete locations
• The theory of search games and rendezvous.

Cited in

(8)

• On deterministic rendezvous at a node of agents with arbitrary velocities
• Asynchronous approach in the plane: a deterministic polynomial algorithm
• Almost universal anonymous rendezvous in the plane
• Reaching a target in the plane with no information
• Deterministic Polynomial Approach in the Plane
• Deterministic meeting of sniffing agents in the plane
• Meeting in a polygon by anonymous oblivious robots
• Asynchronous approach in the plane: a deterministic polynomial algorithm

This page was built for publication: Deterministic polynomial approach in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353250)