We study the problem of exploring an unknown undirected connected graph. Beginning in
some start vertex, a searcher must visit each node of the graph by traversing edges. Upon …

In this paper we consider the group search problem, or evacu-ation problem, in which k
mobile entities (\calM\calE s) located on the line perform search for a specific destination …

This paper is concerned with online coverage of unknown planar environments by a mobile
robot of size D operating with a limited energy capacity battery. The battery capacity is …

This paper is concerned with an online tethered coverage (TC), in which a mobile robot of
size D is attached to a fixed point S by a cable of finite length L. Starting at S, the robot has to …

Motion planning is a fundamental problem in robotics. It comes in a variety of forms, but the
simplest version is as follows. We are given a robot system B, which may consist of several …

The node searching problem (aka treasure hunt) is a fundamental task performed by mobile
agents in a network and can be viewed as an online version of the shortest path problem: an …

Two mobile robots are initially placed at the same point on an infinite line. Each robot may
move on the line in either direction not exceeding its maximal speed. The robots need to find …

A mobile agent navigating along edges of a simple connected unweighted graph, either
finite or countably infinite, has to find an inert target (treasure) hidden in one of the nodes …

Polygons are one of the fundamental building blocks in geometric modeling, and they are
used to represent a wide variety of shapes and figures in computer graphics, vision, pattern …

We study the classic problem of searching for a hidden target in the line and the $ m $-ray
star, in a setting in which the searcher has some prediction on the hider's position. We first …