pub struct ContinuousAStarPlanner {
pub obstacles: Vec<Vec<[f64; 2]>>,
pub step_size: f64,
pub collisionthreshold: f64,
}Expand description
2D continuous space A* planner with polygon obstacles
Fields§
§obstacles: Vec<Vec<[f64; 2]>>Obstacle polygons (each polygon is a vector of 2D points)
step_size: f64Step size for edge discretization
collisionthreshold: f64Collision distance threshold
Implementations§
Source§impl ContinuousAStarPlanner
impl ContinuousAStarPlanner
Sourcepub fn new(
obstacles: Vec<Vec<[f64; 2]>>,
step_size: f64,
collisionthreshold: f64,
) -> Self
pub fn new( obstacles: Vec<Vec<[f64; 2]>>, step_size: f64, collisionthreshold: f64, ) -> Self
Create a new continuous space A* planner
Sourcepub fn is_in_collision(&self, point: &[f64; 2]) -> bool
pub fn is_in_collision(&self, point: &[f64; 2]) -> bool
Check if a point is in collision with any obstacle
Trait Implementations§
Source§impl Clone for ContinuousAStarPlanner
impl Clone for ContinuousAStarPlanner
Source§fn clone(&self) -> ContinuousAStarPlanner
fn clone(&self) -> ContinuousAStarPlanner
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 moreAuto Trait Implementations§
impl Freeze for ContinuousAStarPlanner
impl RefUnwindSafe for ContinuousAStarPlanner
impl Send for ContinuousAStarPlanner
impl Sync for ContinuousAStarPlanner
impl Unpin for ContinuousAStarPlanner
impl UnwindSafe for ContinuousAStarPlanner
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.