Satellite constellation deployment maneuvers

Аuthors

Baranov A. А.^1*, Baranov A. A.^2**

1. Keldysh Institute of Applied Mathematics (Russian Academy of Sciences), 4, Miusskaya sq., Moscow, 125047, Russia
2. Bauman Moscow State Technical University, MSTU, 5, bldg. 1, 2-nd Baumanskaya str., Moscow, 105005, Russia

*e-mail: baranov@kiam1.rssi.ru
**e-mail: tol1c@yandex.ru

Abstract

The algorithm developed in Keldysh Institute of Applied Mathematics was successfully used for many years to calculate rendezvous task for the piloted and automated vehicle and orbital station [1,2]. This algorithm has become the main choice for calculating maneuvers of European ATV owing to being simple, reliable and efficient. The ideas that proved their efficiency in practice were used to develop the algorithm of calculating maneuvers of satellite constellation deployment [3,4]. This paper describes the ways of improving the algorithm, referred to in [4], for finding difference in the numbers of revolutions of the chaser vehicle and target vehicle and also provides algorithms of numeric-analytical definition of maneuver parameters themselves.

Keywords:

Optimal maneuvers, rendezvous task, satellite constellation, satellite constellation deployment, formation flying

Download