pub struct RRTPlanner { /* private fields */ }Expand description
Rapidly-exploring Random Tree (RRT) planner
Implementations§
Source§impl RRTPlanner
impl RRTPlanner
Sourcepub fn new(config: RRTConfig, dimension: usize) -> Self
pub fn new(config: RRTConfig, dimension: usize) -> Self
Create a new RRT planner with the given configuration
Sourcepub fn with_collision_checker<F>(self, collisionchecker: F) -> Self
pub fn with_collision_checker<F>(self, collisionchecker: F) -> Self
Set the collision checking function
The function should return true if there is a collision between the two points
Sourcepub fn with_bounds(
self,
min_bounds: Array1<f64>,
max_bounds: Array1<f64>,
) -> SpatialResult<Self>
pub fn with_bounds( self, min_bounds: Array1<f64>, max_bounds: Array1<f64>, ) -> SpatialResult<Self>
Set the bounds of the configuration space
Sourcepub fn find_path(
&mut self,
start: ArrayView1<'_, f64>,
goal: ArrayView1<'_, f64>,
goal_threshold: f64,
) -> SpatialResult<Option<Path<Array1<f64>>>>
pub fn find_path( &mut self, start: ArrayView1<'_, f64>, goal: ArrayView1<'_, f64>, goal_threshold: f64, ) -> SpatialResult<Option<Path<Array1<f64>>>>
Find the path from start to goal using RRT
Trait Implementations§
Source§impl Clone for RRTPlanner
impl Clone for RRTPlanner
Auto Trait Implementations§
impl Freeze for RRTPlanner
impl !RefUnwindSafe for RRTPlanner
impl !Send for RRTPlanner
impl !Sync for RRTPlanner
impl Unpin for RRTPlanner
impl !UnwindSafe for RRTPlanner
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.