Abstract The Chinese Postman Problem has many applications, including robot exploration,
and analysing interactive system and Web site usability. This paper reviews the wide range …

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 …

We consider exploration problems where a robot has to construct a complete map of an
unknown environment. We assume that the environment is modeled by a directed, strongly …

In thin paper we show:(1) If the robot knows an upper bound on the number of vertices then
it can learn the graph afilcicntly with only one pebble.(2) If the robot does not know nn upper …

A robot has to construct a complete map of an unknown environment modeled as an
undirected connected graph. The task is to explore all nodes and edges of the graph using …

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 …

We show that two cooperating robots can learn exactly any strongly-connected directed
graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new …

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 …

A robot with k-bit memory has to explore a tree whose nodes are unlabeled and edge ports
are locally labeled at each node. The robot has no a priori knowledge of the topology of the …

In this paper, we present an algorithm for the exploration of an unknown graph by multiple
robots, which is never worse than depth-first search with a single robot. On trees, we prove …