pub struct LidarGridMap {
pub data: DMatrix<f64>,
pub min_x: f64,
pub min_y: f64,
pub max_x: f64,
pub max_y: f64,
pub resolution: f64,
pub x_width: usize,
pub y_width: usize,
pub center_ix: usize,
pub center_iy: usize,
}Expand description
LIDAR-based occupancy grid map.
Cell values:
0.0= free space0.5= unknown1.0= occupied (obstacle)
Fields§
§data: DMatrix<f64>§min_x: f64§min_y: f64§max_x: f64§max_y: f64§resolution: f64§x_width: usize§y_width: usize§center_ix: usize§center_iy: usizeImplementations§
Source§impl LidarGridMap
impl LidarGridMap
Sourcepub fn new(
ox: &[f64],
oy: &[f64],
resolution: f64,
method: GridMapMethod,
) -> Self
pub fn new( ox: &[f64], oy: &[f64], resolution: f64, method: GridMapMethod, ) -> Self
Create a new LIDAR grid map from obstacle positions in Cartesian coordinates.
§Arguments
ox- obstacle x coordinates [m]oy- obstacle y coordinates [m]resolution- grid cell size [m]method- algorithm to use for free-space detection
Sourcepub fn from_scan(
angles: &[f64],
distances: &[f64],
resolution: f64,
method: GridMapMethod,
) -> Self
pub fn from_scan( angles: &[f64], distances: &[f64], resolution: f64, method: GridMapMethod, ) -> Self
Create a LIDAR grid map from angle and distance pairs.
§Arguments
angles- lidar beam angles [rad]distances- corresponding distances [m]resolution- grid cell size [m]method- algorithm to use
Auto Trait Implementations§
impl Freeze for LidarGridMap
impl RefUnwindSafe for LidarGridMap
impl Send for LidarGridMap
impl Sync for LidarGridMap
impl Unpin for LidarGridMap
impl UnsafeUnpin for LidarGridMap
impl UnwindSafe for LidarGridMap
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.