pub struct RigidBodyPlanOutcome2D {
pub backend: &'static str,
pub poses: Vec<RigidBodyPose2D>,
pub path_length: f64,
pub heading_change: f64,
pub iterations: usize,
pub min_separation_margin: f64,
}Expand description
Backend-agnostic planning outcome.
Both the deterministic lattice backend and the sampling RRT backend report the same comparable metrics so a benchmark can place them side by side: the realized SE(2) path, its Euclidean position length, accumulated absolute heading change, the search effort (lattice expansions or RRT samples), and the tightest obstacle-separation margin along the path.
Fields§
§backend: &'static str§poses: Vec<RigidBodyPose2D>§path_length: f64§heading_change: f64§iterations: usize§min_separation_margin: f64Trait Implementations§
Source§impl Clone for RigidBodyPlanOutcome2D
impl Clone for RigidBodyPlanOutcome2D
Source§fn clone(&self) -> RigidBodyPlanOutcome2D
fn clone(&self) -> RigidBodyPlanOutcome2D
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for RigidBodyPlanOutcome2D
impl Debug for RigidBodyPlanOutcome2D
Source§impl PartialEq for RigidBodyPlanOutcome2D
impl PartialEq for RigidBodyPlanOutcome2D
impl StructuralPartialEq for RigidBodyPlanOutcome2D
Auto Trait Implementations§
impl Freeze for RigidBodyPlanOutcome2D
impl RefUnwindSafe for RigidBodyPlanOutcome2D
impl Send for RigidBodyPlanOutcome2D
impl Sync for RigidBodyPlanOutcome2D
impl Unpin for RigidBodyPlanOutcome2D
impl UnsafeUnpin for RigidBodyPlanOutcome2D
impl UnwindSafe for RigidBodyPlanOutcome2D
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,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§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.