Skip to main content

lamberthub: a hub of Lambert's problem solvers

A Python library designed to provide solutions to Lambert's problem, a classical problem in astrodynamics that involves determining the orbit of a spacecraft given two points in space and the time of flight between them. The problem is essential for trajectory planning, particularly for interplanetary missions.

This library implements multiple algorithms, each named after its author and publication year, for solving different variations of Lambert's problem. These algorithms can handle different types of orbits, including multi-revolution paths and direct transfers.


Python PyPI License: GPL v3 CI Coverage DOI

Installation

Multiple installation methods are supported:

Logo Platform Command
PyPI logo PyPI python -m pip install lamberthub
GitHub logo GitHub python -m pip install https://github.com/jorgepiloto/lamberthub/archive/main.zip

Available solvers

Algorithm Reference
gauss1809 C. F. Gauss, Theoria motus corporum coelestium in sectionibus conicis solem ambientium. 1809.
battin1984 R. H. Battin and R. M. Vaughan, “An elegant lambert algorithm,” Journal of Guidance, Control, and Dynamics, vol. 7, no. 6, pp. 662–670, 1984.
gooding1990 R. Gooding, “A procedure for the solution of lambert’s orbital boundary-value problem,” Celestial Mechanics and Dynamical Astronomy, vol. 48, no. 2, pp. 145–165, 1990.
avanzini2008 G. Avanzini, “A simple lambert algorithm,” Journal of Guidance, Control, and Dynamics, vol. 31, no. 6, pp. 1587–1594, 2008.
arora2013 N. Arora and R. P. Russell, “A fast and robust multiple revolution lambert algorithm using a cosine transformation,” Paper AAS, vol. 13, p. 728, 2013.
vallado2013 D. A. Vallado, Fundamentals of astrodynamics and applications. Springer Science & Business Media, 2013, vol. 12.
izzo2015 D. Izzo, “Revisiting lambert’s problem,” Celestial Mechanics and Dynamical Astronomy, vol. 121, no. 1, pp. 1–15, 2015.

Using a solver

Any Lambert's problem algorithm implemented in lamberthub is a Python function which accepts the following parameters:

from lamberthub import authorYYYY


v1, v2 = authorYYYY(
    mu, r1, r2, tof, M=0, prograde=True, low_path=True,  # Type of solution
    maxiter=35, atol=1e-5, rtol=1e-7, full_output=False  # Iteration config
)

where author is the name of the author which developed the solver and YYYY the year of publication. Any of the solvers hosted by the ALL_SOLVERS list.

Parameters

Parameters Type Description
mu float The gravitational parameter, that is, the mass of the attracting body times the gravitational constant.
r1 np.array Initial position vector.
r2 np.array Final position vector.
tof float Time of flight between initial and final vectors.
M int The number of revolutions. If zero (default), direct transfer is assumed.
prograde bool Controls the inclination of the final orbit. If True, inclination between 0 and 90 degrees. If False, inclination between 90 and 180 degrees.
low_path bool Selects the type of path when more than two solutions are available. No specific advantage unless there are mission constraints.
maxiter int Maximum number of iterations allowed when computing the solution.
atol float Absolute tolerance for the iterative method.
rtol float Relative tolerance for the iterative method.
full_output bool If True, returns additional information such as the number of iterations.

Returns

Returns Type Description
v1 np.array Initial velocity vector.
v2 np.array Final velocity vector.
numiter int Number of iterations (only if full_output is True).
tpi float Time per iteration (only if full_output is True).

Examples

Example: solving for a direct and prograde transfer orbit

Problem statement

Suppose you want to solve for the orbit of an interplanetary vehicle (that is Sun is the main attractor) form which you know that the initial and final positions are given by:

\vec{r_1} = \begin{bmatrix} 0.159321004 \\ 0.579266185 \\ 0.052359607 \end{bmatrix} \text{ [AU]} \quad \quad
\vec{r_2} = \begin{bmatrix} 0.057594337 \\ 0.605750797 \\ 0.068345246 \end{bmatrix} \text{ [AU]} \quad \quad

The time of flight is $\Delta t = 0.010794065$ years. The orbit is prograde and direct, thus $M=0$. Remember that when $M=0$, there is only one possible solution, so the low_path flag does not play any role in this problem.

Solution

For this problem, gooding1990 is used. Any other solver would work too. Next, the parameters of the problem are instantiated. Finally, the initial and final velocity vectors are computed.

from lamberthub import gooding1990
import numpy as np


mu_sun = 39.47692641
r1 = np.array([0.159321004, 0.579266185, 0.052359607])
r2 = np.array([0.057594337, 0.605750797, 0.068345246])
tof = 0.010794065

v1, v2 = gooding1990(mu_sun, r1, r2, tof, M=0, prograde=True)
print(f"Initial velocity: {v1} [AU / years]")
print(f"Final velocity:   {v2} [AU / years]")

Result

Initial velocity: [-9.303608  3.01862016  1.53636008] [AU / years]
Final velocity:   [-9.511186  1.88884006  1.42137810] [AU / years]

Directly taken from An Introduction to the Mathematics and Methods of Astrodynamics, revised edition, by R.H. Battin, problem 7-12.

Metadata

Release files for lamberthub 1.0.0

For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.

Source distribution (sdist)

Source distribution for lamberthub 1.0.0
File Size Uploaded
lamberthub-1.0.0.tar.gz 47.7 kB Details

Built distribution (wheel)

Table of built distributions (wheels) for lamberthub 1.0.0
File Interpreter ABI Platform
lamberthub-1.0.0-py3-none-any.whl Python 3 none any Details

Total release size: 104.2 kB

Release files / lamberthub-1.0.0.tar.gz

Download URL lamberthub-1.0.0.tar.gz
Size 47.7 kB
Tags Source
SHA-256 checksum
How to use checksums
cde13891f118dc51895d1a0c13cb9ae3c060d526429a789594427585bf431c91
BLAKE2b-256 checksum
How to use checksums
115392f74e57f1d375e04e4dd67a245079c09fc3bb0b81c992bedfc34a31e6b9
Upload date
Uploaded using Trusted Publishing?
What is trusted publishing?
Yes
Uploaded via twine/5.0.0 CPython/3.12.6

Release files / lamberthub-1.0.0-py3-none-any.whl

Download URL lamberthub-1.0.0-py3-none-any.whl
Size 56.4 kB
Tags Python 3
SHA-256 checksum
How to use checksums
3a1f7ebadad9e325a8e06ae3da4680b716aeeb51c765debd9491267356c92ef4
BLAKE2b-256 checksum
How to use checksums
9cc151bdff9d1f2dbfbf9e772f20ac415f8d2040fd0c7c991bbb46c37ef2f05d
Upload date
Uploaded using Trusted Publishing?
What is trusted publishing?
Yes
Uploaded via twine/5.0.0 CPython/3.12.6
Anthropic, PBC Visionary sponsor Bloomberg Visionary sponsor Hudson River Trading Visionary sponsor Meta Visionary sponsor NVIDIA Visionary sponsor Microsoft Sustainability sponsor Depot Continuous Integration AWS Cloud computing and Security Sponsor Datadog Monitoring Fastly CDN Google Download Analytics Sentry Error logging StatusPage Status page