Optimal scheduling of measurement sensors for coordinate data collection about space objects

Nowadays, the problem of optimal planning of observations by ground-based sensors is becoming more and more urgent. This paper formalizes the scheduling problem for collecting coordinate information about space objects by optical and radio-technical sensors. It is proposed a method of reducing the planning problem to the construction of a tree and searching for a branch with the maximum sum of priorities of the vertices belonging to it. For this formulation, an optimal algorithm of scheduling for the case of one measuring sensor is proposed. At the same time, this approach to plan generation allows using other faster quasi-optimal algorithms, such as neural networks or genetic algorithms, in case of insufficient computational resource.