pub struct PoseGraphConfig {
pub max_iterations: usize,
pub tolerance: f64,
pub linear_solver: LinearSolver,
}Expand description
Configuration for pose graph optimization.
Fields§
§max_iterations: usizeMaximum number of Gauss-Newton iterations.
tolerance: f64Convergence threshold on the update vector norm.
linear_solver: LinearSolverLinear backend used inside each nonlinear iteration.
Trait Implementations§
Source§impl Clone for PoseGraphConfig
impl Clone for PoseGraphConfig
impl Copy for PoseGraphConfig
Source§impl Debug for PoseGraphConfig
impl Debug for PoseGraphConfig
Auto Trait Implementations§
impl Freeze for PoseGraphConfig
impl RefUnwindSafe for PoseGraphConfig
impl Send for PoseGraphConfig
impl Sync for PoseGraphConfig
impl Unpin for PoseGraphConfig
impl UnsafeUnpin for PoseGraphConfig
impl UnwindSafe for PoseGraphConfig
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
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
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.