Search results for: SYNCHRONOUS TREE

• Time versus space trade-offs for randezvous in trees

  Publication

  • J. Czyzowicz
  • A. Kosowski
  • A. Pelc

  - DISTRIBUTED COMPUTING - Year 2014

  Two 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 trade-off between the optimal time of completing rendezvous and the size of memory...

  Full text to download in external service

• Collaborative Exploration of Trees by Energy-Constrained Mobile Robots

  Publication

  • S. Das
  • D. Dereniowski
  • C. Karousatou

  - THEORY OF COMPUTING SYSTEMS - Year 2018

  We study the problem of exploration of a tree by mobile agents (robots) that have limited energy. The energy constraint bounds the number of edges that can be traversed by a single agent. We use a team of agents to collectively explore the tree and the objective is to minimize the size of this team. The agents start at a single node, the designated root of the tree and the height of the tree is assumed to be less than the energy...

  Full text to download in external service