pub struct DijkstraPlanner { /* private fields */ }Expand description
World-coordinate Dijkstra planner implementing [PathPlanner].
Dijkstra is uniform-cost search: A* with a zero heuristic. This planner
shares the A* grid, obstacle inflation, and 8-connected motion model, so
its paths are optimal on the same grid that AStarPlanner searches.
The legacy matrix API (dijkstra_plan) is kept unchanged.
Implementations§
Source§impl DijkstraPlanner
impl DijkstraPlanner
Sourcepub fn try_new(
ox: &[f64],
oy: &[f64],
config: DijkstraConfig,
) -> RoboticsResult<Self>
pub fn try_new( ox: &[f64], oy: &[f64], config: DijkstraConfig, ) -> RoboticsResult<Self>
Builds the planner from obstacle coordinates.
Sourcepub fn from_obstacle_points(
obstacles: &Obstacles,
config: DijkstraConfig,
) -> RoboticsResult<Self>
pub fn from_obstacle_points( obstacles: &Obstacles, config: DijkstraConfig, ) -> RoboticsResult<Self>
Builds the planner from obstacle points.
Sourcepub fn plan(&self, start: Point2D, goal: Point2D) -> RoboticsResult<Path2D>
pub fn plan(&self, start: Point2D, goal: Point2D) -> RoboticsResult<Path2D>
Plans a shortest path from start to goal.
Sourcepub fn plan_with_observer(
&self,
start: Point2D,
goal: Point2D,
on_expand: impl FnMut(Point2D),
) -> RoboticsResult<Path2D>
pub fn plan_with_observer( &self, start: Point2D, goal: Point2D, on_expand: impl FnMut(Point2D), ) -> RoboticsResult<Path2D>
Plans a path, observing expanded cells in world coordinates.
Uses the same observer contract as AStarPlanner::plan_with_observer,
including expansions made before an unsuccessful search returns.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for DijkstraPlanner
impl RefUnwindSafe for DijkstraPlanner
impl Send for DijkstraPlanner
impl Sync for DijkstraPlanner
impl Unpin for DijkstraPlanner
impl UnsafeUnpin for DijkstraPlanner
impl UnwindSafe for DijkstraPlanner
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.