On Some Problems of Guaranteed Search on Graphs

Pursuit-evasion differential games on graphs with no information on the evader are considered. Special attention is given to the following epsilon-search problem posed by Golovach. A topological graph embedded in three-dimensional Euclidean space is considered. For simplicity, its edges are assumed to be polygonal, only simple motions of the pursuers and the evader are allowed, and the graph is a phase constraint for all players. The goal of the pursuers is to construct a program depending only on the structure of the graph which ensures capturing the invisible evader, i. e., approaching the evader at a distance of at most e (in the intrinsic metric of the graph), where e is a given nonnegative number. The problem consists in finding the minimum number of pursuers (called the epsilon-search number) needed to capture the evader. Properties of the Golovach function, which assigns the epsilon-ssearch number to every nonnegative epsilon, are investigated. Golovach and Petrov proved that the Golovach function for the complete graph on more than five vertices may have non-unit jumps. The authors of this paper are aware of examples of similar degeneration for trees. These examples disprove the conjecture that the Golovach function of any planar graph has only unit jumps. A subclass of trees for which the Golovach function has only unit jumps is distinguished.