pub struct DWAPlanner { /* private fields */ }Expand description
Dynamic Window Approach local planner
Implementations§
Source§impl DWAPlanner
impl DWAPlanner
pub fn new(config: DWAConfig) -> Self
pub fn try_new(config: DWAConfig) -> RoboticsResult<Self>
pub fn with_defaults() -> Self
pub fn set_state(&mut self, state: DWAState)
pub fn try_set_state(&mut self, state: DWAState) -> RoboticsResult<()>
pub fn set_state_from_2d(&mut self, state: &State2D, omega: f64)
pub fn try_set_state_from_2d( &mut self, state: &State2D, omega: f64, ) -> RoboticsResult<()>
pub fn get_state(&self) -> &DWAState
pub fn state_2d(&self) -> State2D
pub fn set_goal(&mut self, goal: Point2D)
pub fn try_set_goal(&mut self, goal: Point2D) -> RoboticsResult<()>
pub fn set_obstacles(&mut self, obstacles: Vec<Point2D>)
pub fn try_set_obstacles( &mut self, obstacles: Vec<Point2D>, ) -> RoboticsResult<()>
pub fn set_obstacles_from_tuples(&mut self, obstacles: &[(f64, f64)])
pub fn set_obstacles_from_obstacles( &mut self, obstacles: &Obstacles, ) -> RoboticsResult<()>
pub fn get_best_trajectory(&self) -> &Trajectory
pub fn best_path(&self) -> Path2D
pub fn config(&self) -> &DWAConfig
pub fn plan_step(&mut self) -> DWAControl
pub fn try_plan_step(&mut self) -> RoboticsResult<DWAControl>
pub fn step(&mut self) -> DWAControl
pub fn try_step(&mut self) -> RoboticsResult<DWAControl>
pub fn is_goal_reached(&self) -> bool
pub fn distance_to_goal(&self) -> f64
pub fn try_plan_input(&mut self) -> RoboticsResult<ControlInput>
pub fn control_to_input(control: &DWAControl) -> ControlInput
Auto Trait Implementations§
impl Freeze for DWAPlanner
impl RefUnwindSafe for DWAPlanner
impl Send for DWAPlanner
impl Sync for DWAPlanner
impl Unpin for DWAPlanner
impl UnsafeUnpin for DWAPlanner
impl UnwindSafe for DWAPlanner
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.