pub struct AdaptiveCostmapNamo { /* private fields */ }Expand description
Adaptive costmap state.
Implementations§
Source§impl AdaptiveCostmapNamo
impl AdaptiveCostmapNamo
pub fn new(config: AdaptiveCostmapNamoConfig) -> RoboticsResult<Self>
pub fn width(&self) -> i32
pub fn height(&self) -> i32
pub fn cell(&self, x: i32, y: i32) -> RoboticsResult<AdaptiveCostmapCell>
pub fn set_cell_state( &mut self, x: i32, y: i32, state: AdaptiveCostmapCellState, ) -> RoboticsResult<()>
pub fn mark_movable_obstacle(&mut self, x: i32, y: i32) -> RoboticsResult<()>
pub fn mark_static_obstacle(&mut self, x: i32, y: i32) -> RoboticsResult<()>
pub fn mark_unknown(&mut self, x: i32, y: i32) -> RoboticsResult<()>
Sourcepub fn update_movable_costs(
&mut self,
movable_cells: &[(i32, i32)],
observation: MotionProgressObservation,
) -> RoboticsResult<usize>
pub fn update_movable_costs( &mut self, movable_cells: &[(i32, i32)], observation: MotionProgressObservation, ) -> RoboticsResult<usize>
Update selected movable-obstacle cells from a progress observation.
Stuck observations increase cost toward lethal. Good progress decreases
cost back toward movable_initial_cost.
Sourcepub fn to_traversal_risk_cells(
&self,
block_lethal_movable: bool,
) -> Vec<Vec<TerrainRiskCell>>
pub fn to_traversal_risk_cells( &self, block_lethal_movable: bool, ) -> Vec<Vec<TerrainRiskCell>>
Convert the adaptive costmap into traversal-risk cells.
Trait Implementations§
Source§impl Clone for AdaptiveCostmapNamo
impl Clone for AdaptiveCostmapNamo
Source§fn clone(&self) -> AdaptiveCostmapNamo
fn clone(&self) -> AdaptiveCostmapNamo
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 moreSource§impl Debug for AdaptiveCostmapNamo
impl Debug for AdaptiveCostmapNamo
Source§impl PartialEq for AdaptiveCostmapNamo
impl PartialEq for AdaptiveCostmapNamo
impl StructuralPartialEq for AdaptiveCostmapNamo
Auto Trait Implementations§
impl Freeze for AdaptiveCostmapNamo
impl RefUnwindSafe for AdaptiveCostmapNamo
impl Send for AdaptiveCostmapNamo
impl Sync for AdaptiveCostmapNamo
impl Unpin for AdaptiveCostmapNamo
impl UnsafeUnpin for AdaptiveCostmapNamo
impl UnwindSafe for AdaptiveCostmapNamo
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 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.