Abstract: The four–impulse rendezvous of two spacecrafts moving initially on close near–circular coplanar orbits is investigated in linear statement. Numerical dependencies of the angles of application of impulses and their orientation of the angular distance of the transfer are found for the solutions satisfying sufficient optimality conditions. Simple analytical dependencies that approximate these numerical ones with sufficient accuracy are suggested. The use of these formulas allows to lead the process of determining optimal solution to the inversion of the matrix of influence, which coefficients are found analytically. The domains of existing optimal on primer–vector four–impulse solutions are investigated. The efficiency of ...
The minimum-time, low-constant-thrust, same circular orbit rendezvous problem is studied using a rel...
The problem of minimum-time, constant-thrust orbital transfer between coplanar circular orbits is re...
Abstract: The work describes algorithms for minimization in the spaces of impulse componen...
Abstract: The problem of a rendezvous of two spacecrafts on the close near-circular orbits...
The goal of this paper is to find the number of impulses, value of them and transfer orbit(s) parame...
Abstract: In this paper we show that there are four types of optimal solutions for the tra...
The minimum fuel rendezvous problem between several power-limited low-thrust spacecraft neighboring ...
In the present paper several strategies for impulsive orbit transfer between circular orbits are com...
The three-dimensional rendezvous between two spacecraft is considered: a target spacecraft on a circ...
Spacecraft maneuvers is a very important topic in aerospace engineering activities today. In a more ...
The orbital transfer has a significant role in any space mission. This transfers generally categoriz...
International audienceThis paper focuses on the fixed-time minimum-fuel out-of-plane rendezvous betw...
A method has been developed for determining optimal, i.e. minimum fuel, trajectories for the fixed-t...
Abstract The goal of the present paper is to study orbital coplanar maneuvers between circular orb...
The minimum-time, low-constant-thrust, same circular orbit rendezvous problem is studied using a rel...
The minimum-time, low-constant-thrust, same circular orbit rendezvous problem is studied using a rel...
The problem of minimum-time, constant-thrust orbital transfer between coplanar circular orbits is re...
Abstract: The work describes algorithms for minimization in the spaces of impulse componen...
Abstract: The problem of a rendezvous of two spacecrafts on the close near-circular orbits...
The goal of this paper is to find the number of impulses, value of them and transfer orbit(s) parame...
Abstract: In this paper we show that there are four types of optimal solutions for the tra...
The minimum fuel rendezvous problem between several power-limited low-thrust spacecraft neighboring ...
In the present paper several strategies for impulsive orbit transfer between circular orbits are com...
The three-dimensional rendezvous between two spacecraft is considered: a target spacecraft on a circ...
Spacecraft maneuvers is a very important topic in aerospace engineering activities today. In a more ...
The orbital transfer has a significant role in any space mission. This transfers generally categoriz...
International audienceThis paper focuses on the fixed-time minimum-fuel out-of-plane rendezvous betw...
A method has been developed for determining optimal, i.e. minimum fuel, trajectories for the fixed-t...
Abstract The goal of the present paper is to study orbital coplanar maneuvers between circular orb...
The minimum-time, low-constant-thrust, same circular orbit rendezvous problem is studied using a rel...
The minimum-time, low-constant-thrust, same circular orbit rendezvous problem is studied using a rel...
The problem of minimum-time, constant-thrust orbital transfer between coplanar circular orbits is re...
Abstract: The work describes algorithms for minimization in the spaces of impulse componen...