Struct LambertProblem 

pub struct LambertProblem { /* private fields */ }

Solved Lambert boundary-value problem.

use pykep_core::astro::lambert::{LambertPath, LambertProblem};

let problem = LambertProblem::new(
    [1.0, 0.0, 0.0],
    [0.2, 1.1, 0.3],
    20.0,
    1.0,
    false,
    2,
)?;
assert_eq!(problem.solutions()[0].path, LambertPath::ZeroRevolution);

Implementations

impl LambertProblem

pub fn new( initial_position: Vector3, final_position: Vector3, time: f64, mu: f64, clockwise: bool, maximum_revolutions: usize, ) -> Result<Self>

Solves a Lambert problem and all feasible branches through maximum_revolutions.

Solution order is zero-revolution, then left/right for revolution counts 1..=maximum_revolutions.

Errors

Returns an error for non-finite input, non-positive time or mu, zero positions, coincident/collinear endpoints, or non-convergence.

pub const fn initial_position(&self) -> Vector3

Initial position.

pub const fn final_position(&self) -> Vector3

Final position.

pub const fn time(&self) -> f64

Time of flight.

pub const fn mu(&self) -> f64

Gravitational parameter.

pub const fn clockwise(&self) -> bool

Whether clockwise/retrograde motion was requested.

pub fn maximum_revolutions(&self) -> usize

Maximum feasible revolution count returned.

pub fn solutions(&self) -> &[LambertSolution]

Ordered solution family.

Trait Implementations

impl Clone for LambertProblem

fn clone(&self) -> LambertProblem

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LambertProblem

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for LambertProblem

fn eq(&self, other: &LambertProblem) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for LambertProblem