pub struct KalmanState<N: RealField, D: Dim>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>,
{ pub x: OVector<N, D>, pub X: OMatrix<N, D, D>, }
Expand description

Kalman state.

Linear representation as a state vector and the state covariance (symmetric positive semi-definite) matrix.

Fields§

§x: OVector<N, D>

State vector

§X: OMatrix<N, D, D>

State covariance matrix (symmetric positive semi-definite)

Implementations§

source§

impl<N: Copy + FromPrimitive + RealField, D: Dim> KalmanState<N, D>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>,

source

pub fn try_from(state: KalmanState<N, D>) -> Result<Self, &'static str>

source§

impl<N: Copy + FromPrimitive + RealField, D: Dim> KalmanState<N, D>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D> + Allocator<N, U1, D>,

source

pub fn kalman_state(UU: &Vec<OVector<N, D>>, kappa: N) -> KalmanState<N, D>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D> + Allocator<N, U1, D>,

Calculates the Kalman State from the ‘UU’ unscented duplex sigma points.

source

pub fn to_unscented_duplex( &self, scale: N ) -> Result<(Vec<OVector<N, D>>, N), &'static str>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>,

Calculates the unscented duplex sigma points from a Kalman State.

Will return an error if the covariance matrix is not PSD.

Trait Implementations§

source§

impl<N: Clone + RealField, D: Clone + Dim> Clone for KalmanState<N, D>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>,

source§

fn clone(&self) -> KalmanState<N, D>

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<N: RealField, D: Dim> Estimator<N, D> for KalmanState<N, D>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>,

source§

fn state(&self) -> Result<OVector<N, D>, &str>

The estimator’s estimate of the system’s state.
source§

impl<N: RealField, D: Dim, ZD: Dim> ExtendedLinearObserver<N, D, ZD> for KalmanState<N, D>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, ZD, ZD> + Allocator<N, ZD, D> + Allocator<N, D, ZD> + Allocator<N, D> + Allocator<N, ZD>,

source§

fn observe_innovation( &mut self, s: &OVector<N, ZD>, hx: &OMatrix<N, ZD, D>, noise: &CorrelatedNoise<N, ZD> ) -> Result<(), &str>

Uses a non-linear state observation with linear estimation model and additive noise.
source§

impl<N: RealField, D: Dim> ExtendedLinearPredictor<N, D> for KalmanState<N, D>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>,

source§

fn predict( &mut self, x_pred: &OVector<N, D>, fx: &OMatrix<N, D, D>, noise: &CorrelatedNoise<N, D> ) -> Result<(), &str>

Uses a non-linear state prediction with linear estimation model and additive noise.
source§

impl<N: Copy + FromPrimitive + RealField, D: Dim> From<KalmanState<N, D>> for UnscentedDuplexState<N, D>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D> + Allocator<N, U1, D>,

source§

fn from(state: KalmanState<N, D>) -> Self

Converts to this type from the input type.
source§

impl<N: Copy + RealField, D: Dim> KalmanEstimator<N, D> for KalmanState<N, D>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>,

source§

fn kalman_state(&self) -> Result<KalmanState<N, D>, &str>

The estimator’s estimate of the system’s KalmanState.
source§

impl<N: PartialEq + RealField, D: PartialEq + Dim> PartialEq for KalmanState<N, D>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>,

source§

fn eq(&self, other: &KalmanState<N, D>) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl<N: Copy + RealField, D: Dim> TryFrom<KalmanState<N, D>> for InformationRootState<N, D>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>,

§

type Error = &'static str

The type returned in the event of a conversion error.
source§

fn try_from(state: KalmanState<N, D>) -> Result<Self, Self::Error>

Performs the conversion.
source§

impl<N: RealField, D: Dim> TryFrom<KalmanState<N, D>> for InformationState<N, D>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>,

§

type Error = &'static str

The type returned in the event of a conversion error.
source§

fn try_from(state: KalmanState<N, D>) -> Result<Self, Self::Error>

Performs the conversion.
source§

impl<N: Copy + RealField, D: Dim> TryFrom<KalmanState<N, D>> for UDState<N, D>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>,

source§

fn try_from(state: KalmanState<N, D>) -> Result<Self, Self::Error>

Construct the UDState with a KalmanState.

The covariance matrix X is factorised into a U.d.U’ as a UD matrix.

§

type Error = &'static str

The type returned in the event of a conversion error.
source§

impl<N: RealField, D: Dim> StructuralPartialEq for KalmanState<N, D>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>,

Auto Trait Implementations§

§

impl<N, D> !RefUnwindSafe for KalmanState<N, D>

§

impl<N, D> !Send for KalmanState<N, D>

§

impl<N, D> !Sync for KalmanState<N, D>

§

impl<N, D> !Unpin for KalmanState<N, D>

§

impl<N, D> !UnwindSafe for KalmanState<N, D>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

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

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.

source§

impl<T> Same for T

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where 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> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

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

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

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

Performs the conversion.
source§

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

§

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

The type returned in the event of a conversion error.
source§

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

Performs the conversion.
§

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

§

fn vzip(self) -> V