pub struct ScanToMapUpdate {
pub predicted_pose: Pose2D,
pub corrected_pose: Pose2D,
pub status: MatchStatus,
pub iterations: usize,
pub correspondences: usize,
pub mean_residual: f64,
pub hessian: Matrix3<f64>,
pub submap_points: usize,
pub inserted_keyframe: bool,
}Expand description
Diagnostics returned by ScanToMapMatcher::update.
Fields§
§predicted_pose: Pose2DPose predicted from the previous corrected pose and the odometry delta.
corrected_pose: Pose2DPose after registration (equal to predicted_pose unless accepted).
status: MatchStatusMatch status and gate decision.
iterations: usizeGauss-Newton iterations run.
correspondences: usizeCorrespondences used in the final iteration.
mean_residual: f64Mean absolute point-to-line residual after registration [m].
hessian: Matrix3<f64>Registration normal matrix (see ScanRegistration::hessian);
zero when no registration ran.
submap_points: usizeSubmap points inside the matching radius.
inserted_keyframe: boolWhether this scan was inserted into the submap as a keyframe.
Trait Implementations§
Source§impl Clone for ScanToMapUpdate
impl Clone for ScanToMapUpdate
impl Copy for ScanToMapUpdate
Source§impl Debug for ScanToMapUpdate
impl Debug for ScanToMapUpdate
Source§impl PartialEq for ScanToMapUpdate
impl PartialEq for ScanToMapUpdate
impl StructuralPartialEq for ScanToMapUpdate
Auto Trait Implementations§
impl Freeze for ScanToMapUpdate
impl RefUnwindSafe for ScanToMapUpdate
impl Send for ScanToMapUpdate
impl Sync for ScanToMapUpdate
impl Unpin for ScanToMapUpdate
impl UnsafeUnpin for ScanToMapUpdate
impl UnwindSafe for ScanToMapUpdate
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<T> Scalar for T
§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.