Geometry and Graphics of informational sets in problems on dynamical search for moving objects

The present paper is devoted to a geometric approach to the problems on dynamical search for moving objects. We construct time-dependent sets determined by distribution of information between the conflicting objects, and give basic examples of informational sets. We suggest a numerical method for constructing an approximation of informational sets which preserves their basic properties, and apply this method to finding the search trajectory for an object moving in a monotonic polygon.