pub struct PotentialFieldPlanner {
pub resolution: f64,
pub robot_radius: f64,
}Fields§
§resolution: f64§robot_radius: f64Implementations§
Source§impl PotentialFieldPlanner
impl PotentialFieldPlanner
pub fn new(resolution: f64, robot_radius: f64) -> Self
pub fn planning( &self, sx: f64, sy: f64, gx: f64, gy: f64, ox: &[f64], oy: &[f64], ) -> Option<(Vec<f64>, Vec<f64>)>
Sourcepub fn plan_with_obstacles(
&self,
start: Point2D,
goal: Point2D,
ox: &[f64],
oy: &[f64],
) -> RoboticsResult<Path2D>
pub fn plan_with_obstacles( &self, start: Point2D, goal: Point2D, ox: &[f64], oy: &[f64], ) -> RoboticsResult<Path2D>
Plan a path from start to goal while avoiding obstacles, returning a [Path2D].
This is a convenience wrapper around planning() that accepts
[Point2D] and returns [Path2D].
Auto Trait Implementations§
impl Freeze for PotentialFieldPlanner
impl RefUnwindSafe for PotentialFieldPlanner
impl Send for PotentialFieldPlanner
impl Sync for PotentialFieldPlanner
impl Unpin for PotentialFieldPlanner
impl UnsafeUnpin for PotentialFieldPlanner
impl UnwindSafe for PotentialFieldPlanner
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> 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 more§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.