The basic primitive for a mobile agent is the ability to visit all the nodes of the graph in a
systematic manner. This chapter considers the exploration of unknown graphs in full detail …

Robots are becoming an increasingly common part of scientific work within laboratory
environments. In this paper, we investigate the problem of designing\emph {schedules} for …

We consider the fundamental task of network exploration. A network is modeled as a simple
connected undirected n-node graph with unlabeled nodes, and all ports at any node of …

We define the following parameter of connected graphs. For a given graph G=(V,E) we place
one agent in each vertex v∈V. Every pair of agents sharing a common edge is declared to …

The paper formalizes a version of parallel online directed acyclic graph (DAG) exploration,
general enough to be readily mapped to many computational scenarios. In both the offline …

In this paper, we study the acquaintance time AC (G) defined for a connected graph G. We
focus on G (n, r, p), a random subgraph of a random geometric graph in which n vertices are …

We study the problem of multi-agent online graph exploration, in which a team of k agents
has to explore a given graph, starting and ending on the same node. The graph is initially …

In this paper, we study collision-free graph exploration in an anonymous pot labeled
network. Two identical mobile agents, starting from different nodes in $ G $ have to explore …

In this paper, the problem of exploring a grid environment in the offline setting has been
studied.\The goal is to propose an algorithm to find the minimum number of robots for …

Computing with mobile agents is rapidly becoming a topic of mainstream research in the
theory of distributed computing. The main research questions undertaken in this study …