Skip to main content

LidarGridMap

Struct LidarGridMap 

Source
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 space
  • 0.5 = unknown
  • 1.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: usize

Implementations§

Source§

impl LidarGridMap

Source

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
Source

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
Source

pub fn get_index(&self, x: f64, y: f64) -> Option<(usize, usize)>

Get grid index from world coordinates.

Source

pub fn get_occupancy(&self, x: f64, y: f64) -> Option<f64>

Get occupancy value at world coordinates.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

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

Checks if self is actually part of its subset T (and can be converted to it).
§

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

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V