Annotation: The methods are proposed (analytical and numerical based on motion equations integration) to evaluate probability of first approaches to small distances of satellites of cluster uncontrolled in flight in long time intervals. As the number of satellites injected into area of one base orbit grows, the necessity of evaluating such probability constantly increases – already at present their number in some cases exceeds hundred units. In flight, such satellites form in limited area of space rather compact cluster; the satellite density in such cluster exceeds by many orders the density of operating space objects at their functioning altitudes. Due to somewhat different satellite orbiting periods, the distances between them in flight direction continuously change, different precession motion of orbital planes determines their angular spread – approach in flight. It was determined that maximal probability of approach of whatever pair of satellites of cluster to small distances is the case if in some neighborhood of numbers of their flight orbits, simultaneously two events are realized – the satellites approach to minimal distances in flight direction and angular spread of their orb ital planes is close to zero. The conditions are determined of separation of whatever two satellites of cluster (their separation directions and velocities) – that ensure simultaneous realization of the above events in some neighborhood of number of flight orbits. The analytical relations were obtained that allow determining the corresponding numerical values of satellite approach parameters. For particular case – satellite separation at the equator – maximal probability of approach of two satellites of cluster to small distances is the case when their relative separation velocities are equal in flight direction and in perpendicular to this direction. For the option of injecting 12 satellites to the area of one base orbit of ~ 650 km altitude and  98 inclination, the parameters of satellites separation at the equator were determined that realize their uniform dispersion in the first orbits of autonomous flight. For 2 pairs (out of 66 formed for considered injection case) the conditions of maximal probability of their first approaches to small distances are realized. Using two developed methods evaluations of such probability were obtained.

Annotation: This article considers the problem of determination of propulsion system solid fuel burn-out time in the extraatmospheric flight segment taking the apparent acceleration and apparent speed measured by the inertial navigation system. Correlation analysis of the realized and nominal dependencies of the apparent acceleration and apparent speed of the launch vehicle on relative operating time of the propulsion system is suggested to be used to forecast the fuel burn-out time. In order to improve the accuracy of the forecast, and to decrease the amplitude and vibration rate of its results several channels simultaneously are suggested to be used for calculations with subsequent majority voting and digital filtration. As a result of the study, the procedure to forecast the time of solid fuel burn-out in the launch vehicle propulsion system in flight has been developed. Operability of the suggested procedure has been verified using the mathematical simulation of the launch vehicle flight for two operating modes of the propulsion system different from the nominal ones. Based on the statistical processing of the deviations of the predicted time of solid fuel burn-out versus the realized one it was determined that the forecast based on the results of apparent acceleration measurement has the greatest accuracy with the minimal number of operations. Suggested procedure is easily realized as the multistage adaptive algorithm and can be used in the guidance system of the solid-propellant launch vehicle in the extra-atmospheric flight segment for the numerical forecast of the reachable terminal parameters of flight, definition of command vector and development of the relevant thrust vector control commands.