pub struct RRTConfig {
pub max_iterations: usize,
pub step_size: f64,
pub goal_bias: f64,
pub seed: Option<u64>,
pub use_rrt_star: bool,
pub neighborhood_radius: Option<f64>,
pub bidirectional: bool,
}Expand description
Configuration options for the RRT algorithm
Fields§
§max_iterations: usizeMaximum number of iterations before giving up
step_size: f64Maximum step size for tree extension
goal_bias: f64Goal bias (probability of sampling the goal directly)
seed: Option<u64>Optional random seed for reproducibility
use_rrt_star: boolWhether to use RRT* algorithm for optimality
neighborhood_radius: Option<f64>Neighborhood radius for RRT* rewiring
bidirectional: boolWhether to use bi-directional RRT (RRT-Connect)
Trait Implementations§
Auto Trait Implementations§
impl Freeze for RRTConfig
impl RefUnwindSafe for RRTConfig
impl Send for RRTConfig
impl Sync for RRTConfig
impl Unpin for RRTConfig
impl UnwindSafe for RRTConfig
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.