pub struct PRMConfig {
pub num_samples: usize,
pub connection_radius: f64,
pub max_connections: usize,
pub seed: Option<u64>,
pub goal_bias: f64,
pub goal_threshold: f64,
pub bidirectional: bool,
pub lazy_evaluation: bool,
}Expand description
Configuration for the PRM planner
Fields§
§num_samples: usizeNumber of random samples to generate
connection_radius: f64Maximum distance for connecting nearby configurations
max_connections: usizeMaximum number of connections per node
seed: Option<u64>Random number generator seed
goal_bias: f64Bias towards the goal (probability of sampling near the goal)
goal_threshold: f64Threshold for considering a point close enough to the goal
bidirectional: boolEnable bidirectional search for faster pathfinding
lazy_evaluation: boolUse lazy evaluation for collision checking
Implementations§
Source§impl PRMConfig
impl PRMConfig
Sourcepub fn with_num_samples(self, numsamples: usize) -> Self
pub fn with_num_samples(self, numsamples: usize) -> Self
Set the number of random samples
Sourcepub fn with_connection_radius(self, radius: f64) -> Self
pub fn with_connection_radius(self, radius: f64) -> Self
Set the maximum connection radius
Sourcepub fn with_max_connections(self, maxconnections: usize) -> Self
pub fn with_max_connections(self, maxconnections: usize) -> Self
Set the maximum number of connections per node
Sourcepub fn with_goal_bias(self, bias: f64) -> Self
pub fn with_goal_bias(self, bias: f64) -> Self
Set the goal bias
Sourcepub fn with_goal_threshold(self, threshold: f64) -> Self
pub fn with_goal_threshold(self, threshold: f64) -> Self
Set the goal threshold
Sourcepub fn with_bidirectional(self, bidirectional: bool) -> Self
pub fn with_bidirectional(self, bidirectional: bool) -> Self
Enable bidirectional search
Sourcepub fn with_lazy_evaluation(self, lazyevaluation: bool) -> Self
pub fn with_lazy_evaluation(self, lazyevaluation: bool) -> Self
Enable lazy evaluation for collision checking
Trait Implementations§
Auto Trait Implementations§
impl Freeze for PRMConfig
impl RefUnwindSafe for PRMConfig
impl Send for PRMConfig
impl Sync for PRMConfig
impl Unpin for PRMConfig
impl UnwindSafe for PRMConfig
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.