Skip to main content

RRTStar

Struct RRTStar 

Source
pub struct RRTStar {
Show 13 fields pub start: Node, pub end: Node, pub min_rand: f64, pub max_rand: f64, pub expand_dis: f64, pub path_resolution: f64, pub goal_sample_rate: i32, pub max_iter: i32, pub connect_circle_dist: f64, pub search_until_max_iter: bool, pub robot_radius: f64, pub obstacle_list: Vec<(f64, f64, f64)>, pub node_list: Vec<Node>,
}

Fields§

§start: Node§end: Node§min_rand: f64§max_rand: f64§expand_dis: f64§path_resolution: f64§goal_sample_rate: i32§max_iter: i32§connect_circle_dist: f64§search_until_max_iter: bool§robot_radius: f64§obstacle_list: Vec<(f64, f64, f64)>§node_list: Vec<Node>

Implementations§

Source§

impl RRTStar

Source

pub fn new( start: (f64, f64), goal: (f64, f64), obstacle_list: Vec<(f64, f64, f64)>, rand_area: (f64, f64), expand_dis: f64, path_resolution: f64, goal_sample_rate: i32, max_iter: i32, connect_circle_dist: f64, search_until_max_iter: bool, robot_radius: f64, ) -> Self

Source

pub fn planning(&mut self) -> Option<Vec<[f64; 2]>>

Source

pub fn planning_with_trace(&mut self, seed: u64) -> RrtStarSearchTrace

Run the same search with a seeded sampler and record each iteration. Recording does not alter parent selection, rewiring, or the stop condition. Memory stores only changed lightweight nodes and the current solution path.

Source

pub fn plan_from( &mut self, start: Point2D, goal: Point2D, ) -> RoboticsResult<Path2D>

Plan a path from the given start to goal, returning a [Path2D].

This is a convenience wrapper around planning() that accepts [Point2D], sets the start/goal, runs the planner, and returns [Path2D]. Requires &mut self because the underlying algorithm mutates internal state.

Source

pub fn get_tree(&self) -> &[Node]

Get the tree nodes for external inspection

Source

pub fn get_obstacles(&self) -> &[(f64, f64, f64)]

Get the obstacle list

Trait Implementations§

Source§

impl Clone for RRTStar

Source§

fn clone(&self) -> Self

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for RRTStar

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl PathPlanner for RRTStar

Source§

fn plan(&self, start: Point2D, goal: Point2D) -> Result<Path2D, RoboticsError>

Plans on a copy of this planner, so &self keeps its own tree; use RRTStar::plan_from to keep the tree for inspection.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
where F: FnOnce(&Self) -> bool,

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
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

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

Checks if self is actually part of its subset T (and can be converted to it).
§

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

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V