Skip to main content

LidarGraphSlamConfig

Struct LidarGraphSlamConfig 

Source
pub struct LidarGraphSlamConfig {
Show 24 fields pub front_end: ScanToMapConfig, pub node_translation: f64, pub node_yaw: f64, pub loop_search_radius: f64, pub loop_min_node_gap: usize, pub loop_max_candidates: usize, pub loop_map_neighbors: usize, pub loop_correspondence_schedule: [f64; 3], pub loop_min_inlier_ratio: f64, pub loop_max_mean_residual: f64, pub loop_max_correction_translation: f64, pub loop_max_correction_yaw: f64, pub loop_ambiguity_check: bool, pub loop_ambiguity_shifts: [f64; 3], pub loop_ambiguity_ratio: f64, pub loop_ambiguity_separation: f64, pub odometry_sigma: (f64, f64), pub odometry_scale_sigma: f64, pub odometry_yaw_sigma: f64, pub degeneracy_ratio: f64, pub loop_sigma: (f64, f64), pub reoptimize_threshold: (f64, f64), pub deferred_optimization: bool, pub pose_graph: PoseGraphConfig,
}
Expand description

Tuning parameters for LidarGraphSlam.

Fields§

§front_end: ScanToMapConfig

Local scan-to-map front end.

§node_translation: f64

Front-end translation between pose-graph nodes [m].

§node_yaw: f64

Front-end rotation between pose-graph nodes [rad].

§loop_search_radius: f64

Older nodes within this distance of the new node are loop candidates [m].

§loop_min_node_gap: usize

Candidates must be at least this many nodes older than the new node (at least 1).

§loop_max_candidates: usize

At most this many nearest candidates are verified per new node.

§loop_map_neighbors: usize

The candidate’s map uses nodes candidate ± loop_map_neighbors.

§loop_correspondence_schedule: [f64; 3]

Correspondence radii for the coarse-to-fine loop registration [m].

§loop_min_inlier_ratio: f64

Minimum fraction of scan points matched at the finest radius.

§loop_max_mean_residual: f64

Maximum mean point-to-line residual at the finest radius [m].

§loop_max_correction_translation: f64

Maximum loop correction translation relative to the estimate [m].

§loop_max_correction_yaw: f64

Maximum loop correction rotation relative to the estimate [rad].

§loop_ambiguity_check: bool

Reject loop matches that are not unique (perceptual aliasing): the accepted solution is re-registered from seeds shifted by ±loop_ambiguity_shifts along x and y, and any distinct alternative that scores nearly as well makes the match ambiguous.

§loop_ambiguity_shifts: [f64; 3]

Seed shifts [m] used by the ambiguity check.

§loop_ambiguity_ratio: f64

An alternative is “nearly as good” when its inlier ratio is at least this fraction of the best match’s.

§loop_ambiguity_separation: f64

Alternatives closer than this to the best match are the same solution [m].

§odometry_sigma: (f64, f64)

Base standard deviations (xy [m], yaw [rad]) of an odometry edge.

§odometry_scale_sigma: f64

Odometry translation uncertainty per meter travelled in a direction the front end cannot observe (no match, or a degenerate match).

§odometry_yaw_sigma: f64

Odometry heading uncertainty per meter travelled without any accepted scan match [rad/m].

§degeneracy_ratio: f64

A match is treated as fully degenerate along its weakest translation direction when λ_min / λ_max of the translational Hessian is 0, and fully constrained at or above this ratio (linear in between).

§loop_sigma: (f64, f64)

Standard deviations (xy [m], yaw [rad]) of a loop edge.

§reoptimize_threshold: (f64, f64)

A new loop edge triggers re-optimization only when it disagrees with the current graph by more than (xy [m], yaw [rad]); consistent edges are kept and folded in by the next optimization.

§deferred_optimization: bool

When true, LidarGraphSlam::update only queues loop detection and marks the graph as needing re-optimization; the caller spreads that work over frames with LidarGraphSlam::background_step (for interactive applications).

§pose_graph: PoseGraphConfig

Back-end optimizer settings.

Trait Implementations§

Source§

impl Clone for LidarGraphSlamConfig

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 LidarGraphSlamConfig

Source§

impl Debug for LidarGraphSlamConfig

Source§

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

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

impl Default for LidarGraphSlamConfig

Source§

fn default() -> Self

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

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
§

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