In this paper, we consider the problem of exploring an unknown environment with a team of
robots. As in single-robot exploration the goal is to minimize the overall exploration time. The …

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 …

" Robotic Mapping and Exploration" is an important contribution in the area of simultaneous
localization and mapping (SLAM) for autonomous robots, which has been receiving a great …

Calculating differences between models is an important and challenging task in Model
Driven Engineering. Model differencing involves a number of steps starting with identifying …

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 …

The construction of computer systems that are intelligent, collaborative problem-solving
partners is an important goal for both the science of AI and its application. From the scientific …

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 …

In this chapter we review problems where an algorithm controls movements of an agent (eg
a robot) in an unknown environment, and receives the sensory inputs of the agent, which …

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 …