pub struct MultipleShooting<'a, E: ErrorCtrl, T: MultishootNode<OT>, const VT: usize, const OT: usize> {
    pub prop: &'a Propagator<'a, SpacecraftDynamics<'a>, E>,
    pub targets: Vec<T>,
    pub x0: Spacecraft,
    pub xf: Orbit,
    pub current_iteration: usize,
    pub max_iterations: usize,
    pub improvement_threshold: f64,
    pub variables: [Variable; VT],
    pub all_dvs: Vec<SVector<f64, VT>>,
}
Expand description

Multiple shooting is an optimization method. Source of implementation: “Low Thrust Optimization in Cislunar and Translunar space”, 2018 Nathan Re (Parrish) OT: size of the objectives for each node (e.g. 3 if the objectives are X, Y, Z). VT: size of the variables for targeter node (e.g. 4 if the objectives are thrust direction (x,y,z) and thrust level).

Fields§

§prop: &'a Propagator<'a, SpacecraftDynamics<'a>, E>

The propagator setup (kind, stages, etc.)

§targets: Vec<T>

List of nodes of the optimal trajectory

§x0: Spacecraft

Starting point, must be a spacecraft equipped with a thruster

§xf: Orbit

Destination (Should this be the final node?)

§current_iteration: usize§max_iterations: usize

The maximum number of iterations allowed

§improvement_threshold: f64

Threshold after which the outer loop is considered to have converged, e.g. 0.01 means that a 1% of less improvement in case between two iterations will stop the iterations.

§variables: [Variable; VT]

The kind of correction to apply to achieve the objectives

§all_dvs: Vec<SVector<f64, VT>>

Implementations§

source§

impl<'a, E: ErrorCtrl> MultipleShooting<'a, E, Node, 3, 3>

source

pub fn linear_altitude_heuristic( x0: Spacecraft, xf: Orbit, node_count: usize, body_frame: Frame, prop: &'a Propagator<'a, SpacecraftDynamics<'_>, E>, cosm: Arc<Cosm> ) -> Result<Self, NyxError>

Builds a multiple shooting structure assuming that the optimal trajectory is near a linear heuristic in geodetic altitude and direction. For example, if x0 has an altitude of 100 km and xf has an altitude of 200 km, and 10 nodes are required over 10 minutes, then node 1 will be 110 km, node 2 220km, etc. body_frame must be a body fixed frame

source§

impl<'a, E: ErrorCtrl> MultipleShooting<'a, E, Node, 3, 3>

source

pub fn equidistant_nodes( x0: Spacecraft, xf: Orbit, node_count: usize, prop: &'a Propagator<'a, SpacecraftDynamics<'_>, E> ) -> Result<Self, NyxError>

Builds a multiple shooting structure assuming that the optimal trajectory is a straight line between the start and end points. The position of the nodes will be update at each iteration of the outer loop. NOTE: this may cause some nodes to be below the surface of a celestial object if in low orbit

source§

impl<'a, E: ErrorCtrl, T: MultishootNode<OT>, const VT: usize, const OT: usize> MultipleShooting<'a, E, T, VT, OT>

source

pub fn solve( &mut self, cost: CostFunction ) -> Result<MultipleShootingSolution<T, OT>, NyxError>

Solve the multiple shooting problem by finding the arrangement of nodes to minimize the cost function.

Trait Implementations§

source§

impl<'a, E: ErrorCtrl, T: MultishootNode<OT>, const VT: usize, const OT: usize> Display for MultipleShooting<'a, E, T, VT, OT>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, E, T, const VT: usize, const OT: usize> !RefUnwindSafe for MultipleShooting<'a, E, T, VT, OT>

§

impl<'a, E, T, const VT: usize, const OT: usize> Send for MultipleShooting<'a, E, T, VT, OT>where T: Send,

§

impl<'a, E, T, const VT: usize, const OT: usize> Sync for MultipleShooting<'a, E, T, VT, OT>where T: Sync,

§

impl<'a, E, T, const VT: usize, const OT: usize> Unpin for MultipleShooting<'a, E, T, VT, OT>where T: Unpin,

§

impl<'a, E, T, const VT: usize, const OT: usize> !UnwindSafe for MultipleShooting<'a, E, T, VT, OT>

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T> Pointable for T

§

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
§

impl<T> Printing<T> for Twhere T: Display,

§

fn to_str(self) -> String

Method to serialize. Decorates Vecs with square brackets and tuples with round ones. Implementation code is in printing.rs.
§

fn to_plainstr(self) -> String

Method to serialize in minimal form (space separated, no brackets) Implementation code is in printing.rs.
§

fn rd(self) -> String

Printable in red
§

fn gr(self) -> String

Printable in green
§

fn bl(self) -> String

Printable in blue
§

fn yl(self) -> String

Printable in yellow
§

fn mg(self) -> String

Printable in magenta
§

fn cy(self) -> String

Printable in cyan
§

fn wvec(self, f: &mut File) -> Result<(), Error>

Method to write vector(s) to file f (space separated, without brackets). Passes up io errors
§

fn pvec(self)

Method to print vector(s) to stdout (space separated,without brackets).
source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T> ToString for Twhere T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

§

fn vzip(self) -> V