pub struct CorridorLoopFrame {
pub truth: Pose2D,
pub odometry: Pose2D,
pub front_end: Pose2D,
pub estimate: Pose2D,
pub node_poses: Vec<Pose2D>,
pub loop_closure: Option<LoopClosure>,
pub optimized: bool,
pub scan: Vec<Vector2<f64>>,
}Expand description
State recorded after one LidarGraphSlam::update.
Fields§
§truth: Pose2DGround-truth pose.
odometry: Pose2DDead-reckoned wheel odometry.
front_end: Pose2DScan-to-map front-end pose (no loop closure).
estimate: Pose2DGraph SLAM pose estimate.
node_poses: Vec<Pose2D>Optimized node poses at this step.
loop_closure: Option<LoopClosure>Loop closure accepted at this step, if any.
optimized: boolWhether the graph was re-optimized at this step.
scan: Vec<Vector2<f64>>Noisy body-frame scan observed at this step.
Trait Implementations§
Source§impl Clone for CorridorLoopFrame
impl Clone for CorridorLoopFrame
Source§impl Debug for CorridorLoopFrame
impl Debug for CorridorLoopFrame
Source§impl PartialEq for CorridorLoopFrame
impl PartialEq for CorridorLoopFrame
impl StructuralPartialEq for CorridorLoopFrame
Auto Trait Implementations§
impl Freeze for CorridorLoopFrame
impl RefUnwindSafe for CorridorLoopFrame
impl Send for CorridorLoopFrame
impl Sync for CorridorLoopFrame
impl Unpin for CorridorLoopFrame
impl UnsafeUnpin for CorridorLoopFrame
impl UnwindSafe for CorridorLoopFrame
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.