We consider programmable matter as a collection of simple computational elements (or
particles) with limited (constant-size) memory that self-organize to solve system-wide …

The gathering (or multi-agent rendezvous) problem requires a set of mobile agents,
arbitrarily positioned at different nodes of a network to group within finite time at the same …

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 …

In networked environments supporting mobile agents, a pressing problem is the presence of
network sites harmful for the agents. In this paper we consider the danger posed by a node …

Current mobile agent algorithms for map** faults in computer networks assume that the
network is static. However, for large classes of highly dynamic networks (eg, wireless mobile …

This paper studies the well-known problem of gathering multiple mobile agents moving in a
graph, but unlike previous results, we consider the problem in the presence of an …

We consider the problem of locating a black hole in synchronous anonymous networks
using finite state agents. A black hole is a harmful node in the network that destroys any …

We prove that, for the black hole search problem in networks of arbitrary but known topology,
the pebble model of agent interaction is computationally as powerful as the whiteboard …

As the size and use of networks continue to increase, network anomalies and faults are
commonplace. Consequently, effective detection of such network issues is crucial for the …

We consider the map construction problem in a simple, connected graph by a set of mobile
computation entities or agents that start from scattered locations throughout the graph. The …