Skip to main content

LidarMclConfig

Struct LidarMclConfig 

Source
pub struct LidarMclConfig {
Show 20 fields pub particles: usize, pub translation_noise: f64, pub rotation_noise: f64, pub rotation_noise_per_meter: f64, pub hit_sigma: f64, pub random_weight: f64, pub beam_stride: usize, pub max_field_distance: f64, pub independent_beams: f64, pub poor_fit: f64, pub reset_fraction: f64, pub reset_candidates: usize, pub min_injection: f64, pub global_oversampling: usize, pub scan_match_candidates: usize, pub scan_match_interval: usize, pub scan_match_share: f64, pub alpha_slow: f64, pub alpha_fast: f64, pub seed: u64,
}
Expand description

Tuning parameters for LidarMcl.

Fields§

§particles: usize

Number of particles.

§translation_noise: f64

Translation noise per meter travelled [m/m].

§rotation_noise: f64

Rotation noise per radian turned [rad/rad].

§rotation_noise_per_meter: f64

Rotation noise per meter travelled [rad/m].

§hit_sigma: f64

Standard deviation of a beam end point around the nearest wall [m].

§random_weight: f64

Weight of the uniform “unexplained return” term per beam.

§beam_stride: usize

Use every beam_stride-th beam of a scan.

§max_field_distance: f64

Distances beyond this are treated as equally unlikely [m].

§independent_beams: f64

Effective number of independent beams: the per-beam geometric-mean likelihood is raised to this power. Beams are correlated, so a value below the beam count keeps the filter from collapsing too early.

§poor_fit: f64

A per-beam likelihood below this at the weighted particle mean counts as a poor fit (sensor-resetting localization).

§reset_fraction: f64

Fraction of particles re-drawn per update during a poor fit.

§reset_candidates: usize

A re-drawn particle is the best-scoring of this many uniform free poses, so recovery does not need a lucky draw.

§min_injection: f64

Fraction of particles replaced by scored free poses on every update, so a filter confidently locked onto a look-alike place keeps probing for the true one.

§global_oversampling: usize

Global (re)initialization scores this many times particles uniform poses against the first scan and keeps particles of them.

§scan_match_candidates: usize

Correlative scan matching proposes this many distinct candidate poses (0 disables it); global seeding and injected particles draw from them, so every place the scan fits keeps particles until motion tells the look-alikes apart.

§scan_match_interval: usize

Recompute the candidates every this many updates.

§scan_match_share: f64

Fraction of injected particles drawn around a candidate (the rest are scored uniform draws).

§alpha_slow: f64

Smoothing factors of the long- and short-term likelihood averages (augmented MCL, alpha_slow < alpha_fast).

§alpha_fast: f64§seed: u64

RNG seed.

Trait Implementations§

Source§

impl Clone for LidarMclConfig

Source§

fn clone(&self) -> Self

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Copy for LidarMclConfig

Source§

impl Debug for LidarMclConfig

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Default for LidarMclConfig

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl PartialEq for LidarMclConfig

Source§

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

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

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

Inequality operator !=. Read more
Source§

impl StructuralPartialEq for LidarMclConfig

Auto Trait Implementations§

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> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. 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

Source§

type Output = T

Should always be Self
Source§

impl<T> Scalar for T
where T: 'static + Clone + PartialEq + Debug,

§

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,

Source§

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>,

Source§

type Error = !

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

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

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

Source§

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