Searching for a non-adversarial, uncooperative agent on a cycle

DOI10.1016/j.tcs.2019.08.031zbMath1436.68042OpenAlexW2970627438MaRDI QIDQ2285151

Stefan Dobrev, Jorge Urrutia, Evangelos Kranakis, Toshinori Sakai, Maxime Godon, Jurek Czyzowicz

Publication date: 16 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.08.031

zbMATH Keywords

cyclemovementspeedsearchrobotdirection

Mathematics Subject Classification ID

Distributed systems (68M14) Artificial intelligence for robotics (68T40)

Related Items (2)

Bike assisted evacuation on a line ⋮ Impact of knowledge on the cost of treasure hunt in trees

Cites Work

• Unnamed Item
• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane
• Theory of optimal search
• The theory of search games and rendezvous.
• Gathering asynchronous oblivious mobile robots in a ring
• On the linear search problem
• Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
• Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs
• Collaboration Without Communication: Evacuating Two Robots from a Disk
• Evacuating Robots via Unknown Exit in a Disk

This page was built for publication: Searching for a non-adversarial, uncooperative agent on a cycle