Planning observations of astronomical objects from a spacecraft taking into account constraints on the observation times

The paper discusses an approach to solving the problem of planning observations of astronomical objects in a specified catalogue from a spacecraft taking into account constraints on the time intervals for performing observations. It presents a formalization of the problem as the routing problem, which includes statements in the form of a travelling salesman problem and a mixed integer linear programming problem that can be solved by methods of integer programming. It provides examples of constructing optimized programs of observations of astronomical objects from an orbiting spacecraft, illustrating the feasibility of practical use of proposed methods for observation planning, including for carrying out observations from an orbiting spacecraft during flight intervals with varying light and shadow environments in orbit. It demonstrates the effectiveness of the proposed approach both for constructing optimized observation programs, and for analyzing conditions and determining possible observation parameters.