pub struct CorridorLoopRun {
pub walls: Vec<LineSegment>,
pub lap_length: f64,
pub distance: f64,
pub frames: Vec<CorridorLoopFrame>,
pub node_scans: Vec<Vec<Vector2<f64>>>,
pub node_truth: Vec<Pose2D>,
pub node_odometry: Vec<Pose2D>,
pub node_front_end: Vec<Pose2D>,
pub final_node_poses: Vec<Pose2D>,
pub final_estimate: Pose2D,
pub loop_closures: Vec<LoopClosure>,
pub ambiguous_loop_rejections: usize,
}Expand description
A full recorded run of the corridor-loop scenario.
Fields§
§walls: Vec<LineSegment>Environment walls.
lap_length: f64Length of one lap of the corridor centerline [m].
distance: f64Total distance driven [m].
frames: Vec<CorridorLoopFrame>One frame per update, starting with the initial scan.
node_scans: Vec<Vec<Vector2<f64>>>Body-frame scan of each node.
node_truth: Vec<Pose2D>Ground truth at each node.
node_odometry: Vec<Pose2D>Wheel odometry at each node.
node_front_end: Vec<Pose2D>Front-end pose at each node.
final_node_poses: Vec<Pose2D>Node poses after a final optimization over all edges.
final_estimate: Pose2DPose estimate after the final optimization.
loop_closures: Vec<LoopClosure>All accepted loop closures.
ambiguous_loop_rejections: usizeLoop matches rejected as ambiguous (perceptual aliasing).
Implementations§
Source§impl CorridorLoopRun
impl CorridorLoopRun
Sourcepub fn is_wrong_loop(&self, closure: &LoopClosure, tolerance: f64) -> bool
pub fn is_wrong_loop(&self, closure: &LoopClosure, tolerance: f64) -> bool
Whether closure’s measured relative pose is off from ground truth by
more than tolerance meters (a false loop closure).
Sourcepub fn wrong_loop_closures(&self, tolerance: f64) -> usize
pub fn wrong_loop_closures(&self, tolerance: f64) -> usize
Number of false loop closures (see Self::is_wrong_loop).
Sourcepub fn first_loop_frame(&self) -> Option<usize>
pub fn first_loop_frame(&self) -> Option<usize>
Index of the first frame that accepted a loop closure.
Trait Implementations§
Source§impl Clone for CorridorLoopRun
impl Clone for CorridorLoopRun
Auto Trait Implementations§
impl Freeze for CorridorLoopRun
impl RefUnwindSafe for CorridorLoopRun
impl Send for CorridorLoopRun
impl Sync for CorridorLoopRun
impl Unpin for CorridorLoopRun
impl UnsafeUnpin for CorridorLoopRun
impl UnwindSafe for CorridorLoopRun
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.