Search results for: PROBLEM RENDEZVOUS

How to meet when you forget: logspace rendezvous in arbitrary graphs
PublicationTwo identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has been thoroughly studied, both for anonymous and for labeled agents, along with another basic task, that of exploring graphs by mobile agents. The rendezvous problem is known to be not easier than graph exploration. A wellknown recent result...

Rendezvous of DistanceAware Mobile Agents in Unknown Graphs
PublicationWe study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size...

Rendezvous of Heterogeneous Mobile Agents in EdgeWeighted Networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...

Rendezvous of heterogeneous mobile agents in edgeweighted networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...

How to meet when you forget: logspace rendezvous in arbitrary graphs
PublicationProblem rendezvous został dogłębnie zbadany, zarówno dla agendów anonimowych jak i poetykietowanych. zbadano też problem eksploracji grafu za pomocą agentów mobilnych.

Deterministic Rendezvous in Restricted Graphs
PublicationIn this paper we consider the problem of synchronous rendezvous in which two anonymous mobile entities (robots) A and B are expected to meet at the same time and point in a graph G = (V;E). Most of the work devoted to rendezvous in graphs assumes that robots have access to the same sets of nodes and edges, where the topology of connections may be initially known or unknown. In our work we assume the movement of robots is restricted...

Deterministic rendezvous of asynchronous boundedmemory agents in polygonal terrains
PublicationTwo mobile agents, modeled as points starting at differentlocations of an unknown terrain, have to meet. The terrain is a polygon with polygonal holes. We consider two versions of this rendezvous problem: exact RV, when the points representing the agents have to coincide at some time, and epsilonRV, when these points have to get at distance less than epsilon in the terrain. In any terrain, each agent chooses its trajectory, but...

Entangled rendezvous: a possible application of Bell nonlocality for mobile agents on networks
PublicationRendezvous is an old problem of assuring that two or more parties, initially separated, not knowing the position of each other, and not allowed to communicate, are striving to meet without preagreement on the meeting point. This problem has been extensively studied in classical computer science and has vivid importance to modern and future applications. Quantum nonlocality, like Bell inequality violation, has shown that in many...

Deterministic rendezvous of asynchronous boundedmemory agents in polygonal terrains
PublicationWe consider two versions of the rendezvous problem: exact RV, when the points representing agents have to coincide at some time, and eRV, when these points have to get at distance less than e in the terrain. In any terrain, each agent chooses its trajectory, but the movements of the agent on this trajectory are controlled by an adversary that may, e.g. speed up or slow down the agent.

Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
PublicationThis paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a distributed task for mobile agents grounded in the graph...

Taking advantage of symmetries: gathering of asynchronous oblivious robots on a ring
PublicationW pracy rozważano problem rendezvous (spotkania, zebrania) dla zbioru bezpamięciowych robotów umieszczonych na wierzchołkach cyklu nieskierowanego, niewyposażonych w urządzenia komunikacyjne. Przyjęto model systemu rozproszonego występujący w literaturze pod nazwą asynchronicznego systemu z cyklami LookComputeMove. Problem istnienia rozwiązania rozwiązano dla wszystkich konfiguracji poczatkowych składających się z więcej niż...

Time versus space tradeoffs for randezvous in trees
PublicationTwo identical (anonymous) mobile agents start from arbitrary nodes of an unknown tree and have to meet at some node. Agents move in synchronous rounds: in each round an agent can either stay at the current node or move to one of its neighbors. We consider deterministic algorithms for this rendezvous task. The main result of this paper is a tight tradeoff between the optimal time of completing rendezvous and the size of memory...

Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
PublicationOne of the recently considered models of robotbased computing makes use of identical, memoryless mobile units placed in nodes of an anonymous graph. The robots operate in LookComputeMove cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of the nodes adjacent to its current position (Compute), and in the latter case makes an instantaneous...