Deterministic rendezvous problem
id:
deterministic-rendezvous-problem-322-15331500
title:
Deterministic rendezvous problem
text:
The deterministic rendezvous problem is a variant of the rendezvous problem where the players, or robots, must find each other by following a deterministic sequence of instructions. Although each robot follows the same instruction sequence, a unique label assigned to each robot is used for symmetry breaking. Typically, the robots act synchronously, though non-synchronous versions of the deterministic rendezvous problem exist.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Deterministic_rendezvous_problem
date created:
date modified:
2024-03-18T16:21:15Z
main entity:
{"identifier":"Q28406537","url":"https://www.wikidata.org/entity/Q28406537"}
image:
fields total:
13
integrity:
13