LambertOrbitSolverSolveMinimumDurationMultipleRevolutionTransfer Method (Cartesian, Cartesian, Int32, LambertPathType, OrbitDirectionType)

public LambertResult SolveMinimumDurationMultipleRevolutionTransfer(
	Cartesian initialPosition,
	Cartesian finalPosition,
	int numberOfRevolutions,
	LambertPathType pathType,
	OrbitDirectionType directionOfFlight
)

Public Function SolveMinimumDurationMultipleRevolutionTransfer ( 
	initialPosition As Cartesian,
	finalPosition As Cartesian,
	numberOfRevolutions As Integer,
	pathType As LambertPathType,
	directionOfFlight As OrbitDirectionType
) As LambertResult

public:
LambertResult^ SolveMinimumDurationMultipleRevolutionTransfer(
	Cartesian initialPosition, 
	Cartesian finalPosition, 
	int numberOfRevolutions, 
	LambertPathType pathType, 
	OrbitDirectionType directionOfFlight
)

member SolveMinimumDurationMultipleRevolutionTransfer : 
        initialPosition : Cartesian * 
        finalPosition : Cartesian * 
        numberOfRevolutions : int * 
        pathType : LambertPathType * 
        directionOfFlight : OrbitDirectionType -> LambertResult 

Parameters

initialPosition

Type: AGI.Foundation.CoordinatesCartesian
The starting position of the orbit/transfer.

finalPosition

Type: AGI.Foundation.CoordinatesCartesian
The ending position of the orbit/transfer.

numberOfRevolutions

Type: SystemInt32
The number of revolutions to reach the final position.

pathType

Type: AGI.Foundation.PropagatorsLambertPathType
Specifies whether the Lambert algorithm should take the smaller or large semi-major axis path when the revolution count is greater than 0.

directionOfFlight

Type: AGI.Foundation.CoordinatesOrbitDirectionType
Determines if the flight path is prograde or retrograde.

Return Value

The minimum-duration, multiple-revolution solution is useful for providing a minimum bound on the possible durations of orbits that have the desired number of revolutions.

Multiple revolution transfers spanning odd multiples of π in angle subtended (e.g. 3pi, 5pi, etc.) are difficult for the solver to calculate, so loosening the tolerances or increasing the iteration count may be necessary for convergence if the vectors are separated by angles that are close to odd multiples of pi.

Furthermore, this method does not include an orbital plane vector used for those transfers.

Reference