We consider a router on the Internet analyzing the statistical properties of a TCP/IP packet
stream. A fundamental difficulty with measuring trafic behavior on the Internet is that there is …

A finite automaton, simply referred to as a robot, has to explore a graph whose nodes are
unlabeled and whose edge ports are locally labeled at each node. The robot has no a priori …

An n‐node tree has to be explored by k mobile agents (robots), starting at its root. Every
edge of the tree must be traversed by at least one robot, and exploration must be completed …

We use distributed computing tools to provide a new perspective on the behavior of
cooperative biological ensembles. We introduce the Ants Nearby Treasure Search (ANTS) …

Two 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 …

We introduce a new problem in the domain of mobile robots, which we term dispersion. In
this problem, n robots are placed in an n node graph arbitrarily and must coordinate with …

A finite automaton, simply referred to as a robot, has to explore a graph, that is, visit all the
nodes of the graph. The robot has no a priori knowledge of the topology of the graph, nor of …

Mobile agent computing is being used in fields as diverse as artificial intelligence,
computational economics and robotics. Agents' ability to adapt dynamically and execute …

Abstract Consider the Ants Nearby Treasure Search (ANTS) problem, where n mobile
agents, initially placed at the origin of an infinite grid, collaboratively search for an …

We consider the problem of exploring an anonymous unoriented ring by a team of k
identical, oblivious, asynchronous mobile robots that can view the environment but cannot …