pub struct OccupancyGridMap {
pub grid: Vec<Vec<f64>>,
pub config: OccupancyGridConfig,
}Expand description
Occupancy grid map stored as log-odds values.
The grid is indexed as grid[ix][iy] where ix is the column (x-axis)
and iy is the row (y-axis). World coordinate (0, 0) maps to the
centre of the grid.
Fields§
§grid: Vec<Vec<f64>>Log-odds grid: grid[ix][iy].
config: OccupancyGridConfigConfiguration used to build this map.
Implementations§
Source§impl OccupancyGridMap
impl OccupancyGridMap
Sourcepub fn new(config: OccupancyGridConfig) -> Self
pub fn new(config: OccupancyGridConfig) -> Self
Create a new occupancy grid initialised to config.prior_log_odds.
Sourcepub fn update_with_scan(
&mut self,
robot_x: f64,
robot_y: f64,
robot_yaw: f64,
scan_ranges: &[f64],
angle_min: f64,
angle_increment: f64,
)
pub fn update_with_scan( &mut self, robot_x: f64, robot_y: f64, robot_yaw: f64, scan_ranges: &[f64], angle_min: f64, angle_increment: f64, )
Update the map from a single 2-D laser scan.
§Parameters
robot_x,robot_y– robot position in world coordinates [m].robot_yaw– robot heading [rad].scan_ranges– measured ranges for each beam [m].angle_min– angle of the first beam relative to the robot heading [rad].angle_increment– angular step between consecutive beams [rad].
Sourcepub fn get_probability(&self, ix: usize, iy: usize) -> f64
pub fn get_probability(&self, ix: usize, iy: usize) -> f64
Convert a log-odds value at (ix, iy) to an occupancy probability.
Returns a value in [0, 1] via 1 - 1 / (1 + exp(l)).
Auto Trait Implementations§
impl Freeze for OccupancyGridMap
impl RefUnwindSafe for OccupancyGridMap
impl Send for OccupancyGridMap
impl Sync for OccupancyGridMap
impl Unpin for OccupancyGridMap
impl UnsafeUnpin for OccupancyGridMap
impl UnwindSafe for OccupancyGridMap
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
§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.