path_planning/obstacles/

obstacles_2d_f32.rs

/* Copyright (C) 2020 Dylan Staatz - All Rights Reserved. */

pub use parry2d as parry;

////////////////////////////////////////////////////////////////////////////////

use std::collections::hash_map::IntoIter;
use std::collections::HashMap;
use std::f32::consts::TAU;
use std::iter::FromIterator;

use nalgebra::storage::Storage;
use nalgebra::{Const, Vector};
use parry::bounding_volume::{BoundingVolume, AABB};
use parry::math::{Isometry, Point, Real, Rotation, DIM};
use parry::na::Unit;
use parry::query::intersection_test;
use parry::shape::{
  Ball, Capsule, Compound, ConvexPolygon, Cuboid, HalfSpace,
  RoundConvexPolygon, RoundCuboid, RoundTriangle, Segment, Shape, SharedShape,
  Triangle,
};
use serde::{Deserialize, Serialize};

use crate::cspace::leader_follower::LeaderFollowerCSpace;
use crate::cspace::{CSpace, EuclideanSpace};
use crate::error::{Error, Result};
use crate::params::FromParams;
use crate::trajectories::FullTrajectory;

use super::params::{Obstacle2dParams, Offset2dParams, Shape2dParams};
use super::{AppearingObstacle, Behavior, Obstacle, ObstacleId, ObstacleSpace};

pub type X = Real;
pub const D: usize = DIM;
pub type O = Obstacle2df32;
pub type OS = ObstacleSpace2df32;

/// A set of a bunch of obstacles
#[derive(Clone, Serialize, Deserialize)]
#[serde(
  from = "Vec<(ObstacleId, Obstacle2df32)>",
  into = "Vec<(ObstacleId, Obstacle2df32)>"
)]
pub struct ObstacleSpace2df32 {
  obstacles: HashMap<ObstacleId, Obstacle2df32>,
}

impl ObstacleSpace2df32 {
  fn internal_empty() -> Self {
    Self {
      obstacles: HashMap::new(),
    }
  }

  fn internal_add_obstacles<I>(&mut self, obstacles: I)
  where
    I: IntoIterator<Item = (ObstacleId, Obstacle2df32)>,
  {
    obstacles.into_iter().for_each(|(obs_id, obs)| {
      self.obstacles.insert(obs_id, obs);
    })
  }

  fn internal_get_obstacles(
    &self,
    obstacles: &[ObstacleId],
  ) -> Vec<&Obstacle2df32> {
    obstacles
      .iter()
      .filter_map(|obs_id| self.obstacles.get(obs_id))
      .collect()
  }

  fn internal_get_sensed_obstacles(&self) -> Vec<(ObstacleId, &Obstacle2df32)> {
    self
      .obstacles
      .iter()
      .filter(|(_id, obs)| obs.sensed)
      .map(|(id, obs)| (*id, obs))
      .collect()
  }

  fn internal_get_not_sensed_obstacles(
    &self,
  ) -> Vec<(ObstacleId, &Obstacle2df32)> {
    self
      .obstacles
      .iter()
      .filter(|(_id, obs)| !obs.sensed)
      .map(|(id, obs)| (*id, obs))
      .collect()
  }

  fn internal_get_all_obstacle_ids(&self) -> Vec<ObstacleId> {
    self.obstacles.keys().cloned().collect()
  }

  fn internal_remove_obstacles(&mut self, obstacles: &[ObstacleId]) {
    obstacles.iter().for_each(|obs_id| {
      self.obstacles.remove(obs_id);
    })
  }

  fn internal_count(&self) -> usize {
    self.obstacles.len()
  }

  fn internal_check_sensors<S>(
    &mut self,
    pose: &Vector<X, Const<D>, S>,
    radius: X,
  ) -> Vec<ObstacleId>
  where
    S: Storage<X, Const<D>>,
  {
    // TODO: Implement some kind of line of sight based sensing
    let ball = Ball::new(radius);
    let offset = Point::from(pose.clone_owned()).into();

    let mut added = Vec::new();
    for obs in self.obstacles.iter_mut() {
      if !obs.1.sensed {
        if obs.1.intersects_shape(&offset, &ball) {
          obs.1.sensed = true;
          added.push(*obs.0);
        }
      }
    }
    added
  }
}

impl FromParams for ObstacleSpace2df32 {
  type Params = Vec<<Obstacle2df32 as FromParams>::Params>;

  fn from_params(params: Self::Params) -> Result<Self> {
    let mut obs = Vec::new();
    for obs_params in params {
      obs.push(Obstacle2df32::from_params(obs_params)?);
    }

    Ok(obs.into_iter().collect())
  }
}

impl FromIterator<(ObstacleId, Obstacle2df32)> for ObstacleSpace2df32 {
  fn from_iter<I>(iter: I) -> Self
  where
    I: IntoIterator<Item = (ObstacleId, Obstacle2df32)>,
  {
    Self {
      obstacles: HashMap::from_iter(iter),
    }
  }
}

impl FromIterator<Obstacle2df32> for ObstacleSpace2df32 {
  fn from_iter<I>(iter: I) -> Self
  where
    I: IntoIterator<Item = Obstacle2df32>,
  {
    Self {
      obstacles: HashMap::from_iter(iter.into_iter().enumerate()),
    }
  }
}

impl IntoIterator for ObstacleSpace2df32 {
  type Item = (ObstacleId, Obstacle2df32);
  type IntoIter = IntoIter<ObstacleId, Obstacle2df32>;
  fn into_iter(self) -> Self::IntoIter {
    self.obstacles.into_iter()
  }
}

impl FromIterator<(Isometry<Real>, SharedShape)> for ObstacleSpace2df32 {
  fn from_iter<I>(iter: I) -> Self
  where
    I: IntoIterator<Item = (Isometry<Real>, SharedShape)>,
  {
    Self {
      obstacles: HashMap::from_iter(
        iter.into_iter().map(|obs| obs.into()).enumerate(),
      ),
    }
  }
}

impl From<Vec<(Isometry<Real>, SharedShape)>> for ObstacleSpace2df32 {
  fn from(static_obstacles: Vec<(Isometry<Real>, SharedShape)>) -> Self {
    static_obstacles.into_iter().collect()
  }
}

impl From<Vec<Obstacle2df32>> for ObstacleSpace2df32 {
  fn from(static_obstacles: Vec<Obstacle2df32>) -> Self {
    static_obstacles.into_iter().collect()
  }
}

impl From<Vec<(ObstacleId, Obstacle2df32)>> for ObstacleSpace2df32 {
  fn from(static_obstacles: Vec<(ObstacleId, Obstacle2df32)>) -> Self {
    static_obstacles.into_iter().collect()
  }
}

impl Into<Vec<(ObstacleId, Obstacle2df32)>> for ObstacleSpace2df32 {
  fn into(self) -> Vec<(ObstacleId, Obstacle2df32)> {
    self.into_iter().collect()
  }
}

mod euclidean {

  use super::*;

  const N: usize = D;
  type CS = EuclideanSpace<X, N>;

  impl Obstacle<X, CS, N> for ObstacleSpace2df32 {
    fn trajectory_free<TF, S1, S2>(&self, t: &TF) -> bool
    where
      TF: FullTrajectory<X, <CS as CSpace<X, N>>::Traj, S1, S2, N>,
      S1: Storage<X, Const<N>>,
      S2: Storage<X, Const<N>>,
    {
      let start = Point::from(t.start().clone_owned());
      let end = Point::from(t.end().clone_owned());
      let segment = Segment::new(start, end);
      let identity = Isometry::identity();

      self
        .obstacles
        .values()
        .filter(|obs| obs.sensed)
        .all(|obs| !obs.intersects_shape(&identity, &segment))
    }

    fn is_free<S>(&self, x: &Vector<X, Const<N>, S>) -> bool
    where
      S: Storage<X, Const<N>>,
    {
      let x = Point::from(x.clone_owned());
      self
        .obstacles
        .values()
        .filter(|obs| obs.sensed)
        .all(|obs| !obs.contains_point(&x))
    }
  }

  impl ObstacleSpace<X, CS, N> for ObstacleSpace2df32 {
    type Obs = Obstacle2df32;

    fn empty() -> Self {
      Self::internal_empty()
    }

    fn add_obstacles<I>(&mut self, obstacles: I)
    where
      I: IntoIterator<Item = (ObstacleId, Self::Obs)>,
    {
      self.internal_add_obstacles(obstacles)
    }

    fn get_obstacles(&self, obstacles: &[ObstacleId]) -> Vec<&Self::Obs> {
      self.internal_get_obstacles(obstacles)
    }

    fn get_sensed_obstacles(&self) -> Vec<(ObstacleId, &Self::Obs)> {
      self.internal_get_sensed_obstacles()
    }

    fn get_not_sensed_obstacles(&self) -> Vec<(ObstacleId, &Self::Obs)> {
      self.internal_get_not_sensed_obstacles()
    }

    fn get_all_obstacle_ids(&self) -> Vec<ObstacleId> {
      self.internal_get_all_obstacle_ids()
    }

    fn remove_obstacles(&mut self, obstacles: &[ObstacleId]) {
      self.internal_remove_obstacles(obstacles)
    }

    fn count(&self) -> usize {
      self.internal_count()
    }

    fn check_sensors<S>(
      &mut self,
      pose: &Vector<X, Const<N>, S>,
      radius: X,
    ) -> Vec<ObstacleId>
    where
      S: Storage<X, Const<N>>,
    {
      self.internal_check_sensors(pose, radius)
    }
  }

  impl Obstacle<X, CS, N> for Obstacle2df32 {
    fn trajectory_free<TF, S1, S2>(&self, t: &TF) -> bool
    where
      TF: FullTrajectory<X, <CS as CSpace<X, N>>::Traj, S1, S2, N>,
      S1: Storage<X, Const<N>>,
      S2: Storage<X, Const<N>>,
    {
      let start = Point::from(t.start().clone_owned());
      let end = Point::from(t.end().clone_owned());
      let segment = Segment::new(start, end);
      let identity = Isometry::identity();

      !self.intersects_shape(&identity, &segment)
    }

    fn is_free<S>(&self, x: &Vector<X, Const<N>, S>) -> bool
    where
      S: Storage<X, Const<N>>,
    {
      let x = Point::from(x.clone_owned());
      !self.contains_point(&x)
    }
  }

  impl AppearingObstacle<X, CS, N> for Obstacle2df32 {
    fn can_sense<S>(&self, pose: &Vector<X, Const<N>, S>, radius: X) -> bool
    where
      S: Storage<X, Const<N>>,
    {
      if self.sensed {
        return true;
      }

      let ball = Ball::new(radius);
      let offset = Point::from(pose.clone_owned()).into();

      self.intersects_shape(&offset, &ball)
    }
  }
}

mod leader_follower {

  use super::*;

  const N: usize = D * 2;

  impl<CS> Obstacle<X, CS, N> for ObstacleSpace2df32
  where
    CS: LeaderFollowerCSpace<X, D, N>,
  {
    fn trajectory_free<TF, S1, S2>(&self, t: &TF) -> bool
    where
      TF: FullTrajectory<X, CS::Traj, S1, S2, N>,
      S1: Storage<X, Const<N>>,
      S2: Storage<X, Const<N>>,
    {
      // Breakout
      let lead_start = CS::get_leader(t.start());
      let lead_end = CS::get_leader(t.end());
      let fol_start = CS::get_follower(t.start());
      let fol_end = CS::get_follower(t.end());

      let identity = Isometry::identity();

      // Segment implementation
      let lead_traj = Segment::new(
        Point::from(lead_start.clone_owned()),
        Point::from(lead_end.clone_owned()),
      );
      let fol_traj = Segment::new(
        Point::from(fol_start.clone_owned()),
        Point::from(fol_end.clone_owned()),
      );
      let los_start = Segment::new(
        Point::from(lead_start.clone_owned()),
        Point::from(fol_start.clone_owned()),
      );
      let los_end = Segment::new(
        Point::from(lead_end.clone_owned()),
        Point::from(fol_end.clone_owned()),
      );
      let segments = [lead_traj, fol_traj, los_start, los_end];
      self.obstacles.values().filter(|obs| obs.sensed).all(|obs| {
        segments
          .iter()
          .all(|seg| !obs.intersects_shape(&identity, seg))
      })
    }

    fn is_free<S>(&self, x: &Vector<X, Const<N>, S>) -> bool
    where
      S: Storage<X, Const<N>>,
    {
      // Breakout
      let leader = CS::get_leader(x);
      let follower = CS::get_follower(x);

      let identity = Isometry::identity();

      // Segment implementation
      let segment = Segment::new(
        Point::from(leader.clone_owned()),
        Point::from(follower.clone_owned()),
      );

      self
        .obstacles
        .values()
        .filter(|obs| obs.sensed)
        .all(|obs| !obs.intersects_shape(&identity, &segment))
    }
  }

  impl<CS> ObstacleSpace<X, CS, N> for ObstacleSpace2df32
  where
    CS: LeaderFollowerCSpace<X, D, N>,
  {
    type Obs = Obstacle2df32;

    fn empty() -> Self {
      Self::internal_empty()
    }

    fn add_obstacles<I>(&mut self, obstacles: I)
    where
      I: IntoIterator<Item = (ObstacleId, Self::Obs)>,
    {
      self.internal_add_obstacles(obstacles)
    }

    fn get_obstacles(&self, obstacles: &[ObstacleId]) -> Vec<&Self::Obs> {
      self.internal_get_obstacles(obstacles)
    }

    fn get_sensed_obstacles(&self) -> Vec<(ObstacleId, &Self::Obs)> {
      self.internal_get_sensed_obstacles()
    }

    fn get_not_sensed_obstacles(&self) -> Vec<(ObstacleId, &Self::Obs)> {
      self.internal_get_not_sensed_obstacles()
    }

    fn get_all_obstacle_ids(&self) -> Vec<ObstacleId> {
      self.internal_get_all_obstacle_ids()
    }

    fn remove_obstacles(&mut self, obstacles: &[ObstacleId]) {
      self.internal_remove_obstacles(obstacles)
    }

    fn count(&self) -> usize {
      self.internal_count()
    }

    fn check_sensors<S>(
      &mut self,
      pose: &Vector<X, Const<N>, S>,
      radius: X,
    ) -> Vec<ObstacleId>
    where
      S: Storage<X, Const<N>>,
    {
      let leader = CS::get_leader(pose);
      self.internal_check_sensors(&leader, radius)
    }
  }

  impl<CS> Obstacle<X, CS, N> for Obstacle2df32
  where
    CS: LeaderFollowerCSpace<X, D, N>,
  {
    fn trajectory_free<TF, S1, S2>(&self, t: &TF) -> bool
    where
      TF: FullTrajectory<X, <CS as CSpace<X, N>>::Traj, S1, S2, N>,
      S1: Storage<X, Const<N>>,
      S2: Storage<X, Const<N>>,
    {
      // Breakout
      let lead_start = CS::get_leader(t.start());
      let lead_end = CS::get_leader(t.end());
      let fol_start = CS::get_follower(t.start());
      let fol_end = CS::get_follower(t.end());

      let identity = Isometry::identity();

      // Segment implementation
      let lead_traj = Segment::new(
        Point::from(lead_start.clone_owned()),
        Point::from(lead_end.clone_owned()),
      );
      let fol_traj = Segment::new(
        Point::from(fol_start.clone_owned()),
        Point::from(fol_end.clone_owned()),
      );
      let los_start = Segment::new(
        Point::from(lead_start.clone_owned()),
        Point::from(fol_start.clone_owned()),
      );
      let los_end = Segment::new(
        Point::from(lead_end.clone_owned()),
        Point::from(fol_end.clone_owned()),
      );
      let segments = [lead_traj, fol_traj, los_start, los_end];
      segments
        .iter()
        .all(|seg| !self.intersects_shape(&identity, seg))
    }

    fn is_free<S>(&self, x: &Vector<X, Const<N>, S>) -> bool
    where
      S: Storage<X, Const<N>>,
    {
      // Breakout
      let leader = CS::get_leader(x);
      let follower = CS::get_follower(x);

      let identity = Isometry::identity();

      // Segment implementation
      let segment = Segment::new(
        Point::from(leader.clone_owned()),
        Point::from(follower.clone_owned()),
      );

      !self.intersects_shape(&identity, &segment)
    }
  }

  impl<CS> AppearingObstacle<X, CS, N> for Obstacle2df32
  where
    CS: LeaderFollowerCSpace<X, D, N>,
  {
    fn can_sense<S>(&self, pose: &Vector<X, Const<N>, S>, radius: X) -> bool
    where
      S: Storage<X, Const<N>>,
    {
      if self.sensed {
        return true;
      }

      let leader = CS::get_leader(pose);
      let ball = Ball::new(radius);
      let offset = Point::from(leader.clone_owned()).into();

      self.intersects_shape(&offset, &ball)
    }
  }
}

/// An obstacle that can be any of the 2d shapes supported by parry
/// except Compound, Polyline, or TriMesh
#[derive(Clone, Serialize, Deserialize)]
pub struct Obstacle2df32 {
  shape: SharedShape,
  offset: Isometry<X>,
  sensed: bool,
  aabb: AABB,
}

impl Obstacle2df32 {
  pub fn no_offset(shape: SharedShape) -> Self {
    Self::with_offset(shape, Isometry::identity())
  }

  pub fn with_offset(shape: SharedShape, offset: Isometry<X>) -> Self {
    Self::new(shape, offset, Behavior::default() == Behavior::Static)
  }

  pub fn new(shape: SharedShape, offset: Isometry<X>, sensed: bool) -> Self {
    let aabb = shape.compute_aabb(&offset);
    Self {
      shape,
      offset,
      sensed,
      aabb,
    }
  }

  pub fn shape(&self) -> &SharedShape {
    &self.shape
  }

  pub fn offset(&self) -> &Isometry<X> {
    &self.offset
  }

  pub fn sensed(&self) -> bool {
    self.sensed
  }

  pub fn aabb(&self) -> &AABB {
    &self.aabb
  }

  pub fn intersects(&self, other: &Self) -> bool {
    if !self.aabb.intersects(&other.aabb) {
      return false;
    }

    intersection_test(
      &self.offset,
      self.shape.0.as_ref(),
      &other.offset,
      other.shape.0.as_ref(),
    )
    .unwrap()
  }

  fn intersects_shape<S: Shape>(
    &self,
    offset: &Isometry<X>,
    shape: &S,
  ) -> bool {
    if !self.aabb.intersects(&shape.compute_aabb(offset)) {
      return false;
    }

    intersection_test(&self.offset, self.shape.0.as_ref(), offset, shape)
      .unwrap()
  }

  fn contains_point(&self, point: &Point<X>) -> bool {
    if !self.aabb.contains_local_point(point) {
      return false;
    }

    self.shape.contains_point(&self.offset, point)
  }
}

impl FromParams for Obstacle2df32 {
  type Params = Obstacle2dParams<X>;
  fn from_params(params: Self::Params) -> Result<Self> {
    let sensed = match params.behavior {
      Behavior::Static => true,
      Behavior::Appearing => false,
    };

    Ok(Obstacle2df32::new(
      SharedShape::from_params(params.shape)?,
      Isometry::from_params(params.offset)?,
      sensed,
    ))
  }
}

impl From<(Isometry<Real>, SharedShape)> for Obstacle2df32 {
  fn from(static_obstacle: (Isometry<Real>, SharedShape)) -> Self {
    Self::with_offset(static_obstacle.1, static_obstacle.0)
  }
}

impl FromParams for Isometry<X> {
  type Params = Offset2dParams<X>;
  fn from_params(params: Self::Params) -> Result<Self> {
    Ok(Isometry::new(
      params.translation,
      X::to_radians(params.angle),
    ))
  }
}

fn create_regular_polygon(sides: u8, scale: X) -> Vec<Point<X>> {
  let mut v = Vec::with_capacity(usize::from(sides));
  let mut point = Point::new(scale, 0.0);
  let rotation = Rotation::new(TAU / (sides as X));

  for _ in 0..(sides) {
    v.push(point.clone());
    point = rotation * point;
  }
  v
}

impl FromParams for SharedShape {
  type Params = Shape2dParams<X>;
  fn from_params(params: Self::Params) -> Result<Self> {
    match params {
      Shape2dParams::Ball { radius } => Ok(SharedShape::new(Ball::new(radius))),
      Shape2dParams::Capsule { a, b, radius } => {
        Ok(SharedShape::new(Capsule::new(a.into(), b.into(), radius)))
      }
      Shape2dParams::Compound { shapes } => {
        let mut new_shapes = Vec::new();
        for (offset, shape) in shapes {
          new_shapes.push((
            Isometry::from_params(offset)?,
            SharedShape::from_params(shape)?,
          ))
        }
        Ok(SharedShape::new(Compound::new(new_shapes)))
      }
      Shape2dParams::RegularPolygon { sides, scale } => {
        let points = create_regular_polygon(sides, scale);
        let poly = ConvexPolygon::from_convex_hull(&points)
          .ok_or(Error::ConvexHullError)?;
        Ok(SharedShape::new(poly))
      }
      Shape2dParams::ConvexPolygon { points } => {
        let points: Vec<_> = points.into_iter().map(|p| p.into()).collect();
        let poly = ConvexPolygon::from_convex_hull(&points)
          .ok_or(Error::ConvexHullError)?;
        Ok(SharedShape::new(poly))
      }
      Shape2dParams::Cuboid { half_extents } => {
        Ok(SharedShape::new(Cuboid::new(half_extents)))
      }
      Shape2dParams::HalfSpace { normal } => Ok(SharedShape::new(
        HalfSpace::new(Unit::new_normalize(normal)),
      )),
      Shape2dParams::RoundRegularPolygon {
        sides,
        scale,
        border_radius,
      } => {
        let points = create_regular_polygon(sides, scale);
        let poly = ConvexPolygon::from_convex_hull(&points)
          .ok_or(Error::ConvexHullError)?;
        let poly = RoundConvexPolygon {
          base_shape: poly,
          border_radius: border_radius,
        };
        Ok(SharedShape::new(poly))
      }
      Shape2dParams::RoundConvexPolygon {
        points,
        border_radius,
      } => {
        let points: Vec<_> = points.into_iter().map(|p| p.into()).collect();
        let poly = ConvexPolygon::from_convex_hull(&points)
          .ok_or(Error::ConvexHullError)?;
        let poly = RoundConvexPolygon {
          base_shape: poly,
          border_radius: border_radius,
        };
        Ok(SharedShape::new(poly))
      }
      Shape2dParams::RoundCuboid {
        half_extents,
        border_radius,
      } => {
        let cube = Cuboid::new(half_extents);
        let cube = RoundCuboid {
          base_shape: cube,
          border_radius: border_radius,
        };
        Ok(SharedShape::new(cube))
      }
      Shape2dParams::RoundTriangle {
        a,
        b,
        c,
        border_radius,
      } => {
        let tri = Triangle::new(a.into(), b.into(), c.into());
        let tri = RoundTriangle {
          base_shape: tri,
          border_radius: border_radius,
        };
        Ok(SharedShape::new(tri))
      }
      Shape2dParams::Segment { a, b } => {
        Ok(SharedShape::new(Segment::new(a.into(), b.into())))
      }
      Shape2dParams::Triangle { a, b, c } => Ok(SharedShape::new(
        Triangle::new(a.into(), b.into(), c.into()),
      )),
    }
  }
}

#[cfg(test)]
mod tests {

  use parry::na::base::Unit;
  use parry::shape::{
    Ball, Capsule, ConvexPolygon, Cuboid, HalfSpace, RoundConvexPolygon,
    RoundCuboid, RoundTriangle, Segment, SharedShape, Triangle,
  };

  use crate::trajectories::{EuclideanTrajectory, FullTrajOwned};

  use super::*;

  fn get_shapes() -> Vec<(Isometry<Real>, SharedShape)> {
    vec![
      SharedShape::new(Ball::new(0.5)),
      SharedShape::new(Capsule::new([0.0, 0.0].into(), [0.0, 1.0].into(), 0.5)),
      // Deserialization seems to fail for Compound shape
      SharedShape::new(
        ConvexPolygon::from_convex_hull(&[
          [0.5, 0.0].into(),
          [-0.5, 0.0].into(),
          [0.0, 1.0].into(),
          [0.0, 0.1].into(),
          [0.0, 0.0].into(),
        ])
        .unwrap(),
      ),
      SharedShape::new(Cuboid::new([0.5, 0.5].into())),
      SharedShape::new(HalfSpace::new(Unit::new_normalize([1.0, 1.0].into()))),
      // Deserialization seems to fail for Polyline shape
      SharedShape::new(RoundConvexPolygon {
        base_shape: ConvexPolygon::from_convex_hull(&[
          [0.5, 0.0].into(),
          [-0.5, 0.0].into(),
          [0.0, 1.0].into(),
          [0.0, 0.1].into(),
          [0.0, 0.0].into(),
        ])
        .unwrap(),
        border_radius: 0.1,
      }),
      SharedShape::new(RoundCuboid {
        base_shape: Cuboid::new([0.5, 0.5].into()),
        border_radius: 0.1,
      }),
      SharedShape::new(RoundTriangle {
        base_shape: Triangle::new(
          [0.5, 0.0].into(),
          [-0.5, 0.0].into(),
          [0.0, 1.0].into(),
        ),
        border_radius: 0.1,
      }),
      SharedShape::new(Segment::new([0.0, 0.0].into(), [1.0, 1.0].into())),
      // Deserialization seems to fail for TriMesh shape
      SharedShape::new(Triangle::new(
        [0.5, 0.0].into(),
        [-0.5, 0.0].into(),
        [0.0, 1.0].into(),
      )),
    ]
    .into_iter()
    .map(|i| (Isometry::<X>::identity(), i))
    .collect()
  }

  fn get_obstacle_space() -> ObstacleSpace2df32 {
    ObstacleSpace2df32::from(get_shapes())
  }

  fn get_obstacles() -> Vec<Obstacle2df32> {
    get_shapes().into_iter().map(Obstacle2df32::from).collect()
  }

  #[test]
  fn test_serialize_bincode_obstacles() {
    let obstacles = get_obstacles();
    let v = bincode::serialize(&obstacles).unwrap();
    let _: Vec<Obstacle2df32> = bincode::deserialize(&v).unwrap();
  }

  #[test]
  fn test_intersection_parry_obstacle() {
    let obstacle_space = get_obstacle_space();
    let t = FullTrajOwned::new(
      [0.0, 0.0].into(),
      [0.0, 1.0].into(),
      EuclideanTrajectory::new(),
    );
    assert_eq!(obstacle_space.trajectory_free(&t), false);

    let t = FullTrajOwned::new(
      [1.0, 10.0].into(),
      [0.0, 10.0].into(),
      EuclideanTrajectory::new(),
    );
    assert_eq!(obstacle_space.trajectory_free(&t), true);
  }

  #[test]
  fn test_intersection_ball() {
    let ball = Ball::new(0.75);
    let ball = Obstacle2df32::no_offset(SharedShape::new(ball));
    let t = FullTrajOwned::new(
      [0.0, 0.0].into(),
      [0.0, 1.0].into(),
      EuclideanTrajectory::new(),
    );
    assert_eq!(ball.trajectory_free(&t), false);
    let t = FullTrajOwned::new(
      [1.0, 0.0].into(),
      [0.0, 1.0].into(),
      EuclideanTrajectory::new(),
    );
    assert_eq!(ball.trajectory_free(&t), false);
    let t = FullTrajOwned::new(
      [-1.0, 0.0].into(),
      [1.0, 0.0].into(),
      EuclideanTrajectory::new(),
    );
    assert_eq!(ball.trajectory_free(&t), false);
    let t = FullTrajOwned::new(
      [1.0, -1.0].into(),
      [1.0, 1.0].into(),
      EuclideanTrajectory::new(),
    );
    assert_eq!(ball.trajectory_free(&t), true);
    let t = FullTrajOwned::new(
      [0.7500001, -1.0].into(),
      [0.7500001, 1.0].into(),
      EuclideanTrajectory::new(),
    );
    assert_eq!(ball.trajectory_free(&t), true);
  }
}