$search

nearest_backward.cc

Go to the documentation of this file.

/*
 *  Copyright (C) 2010 UT-Austin & Austin Robot Technology, Michael Quinlan
 *  Copyright (C) 2011 UT-Austin & Austin Robot Technology
 *  License: Modified BSD Software License 
 */

#include <art_observers/QuadrilateralOps.h>
#include <art_observers/nearest_backward.h>

namespace observers
{

NearestBackward::NearestBackward(art_observers::ObserversConfig &config):
  Observer(config,
           art_msgs::Observation::Nearest_backward,
           std::string("Nearest_backward"))
{
  distance_filter_.configure();
  velocity_filter_.configure();
}

NearestBackward::~NearestBackward() 
{
}

// \brief  Update message with new data.
art_msgs::Observation
  NearestBackward::update(const art_msgs::ArtLanes &local_map,
                          const art_msgs::ArtLanes &obstacles, 
                          MapPose pose_)
{

  PolyOps polyOps;
  std::vector<poly> map_polys;
  int poly_index = -1;
  polyOps.GetPolys(local_map, map_polys);
  poly_index = polyOps.getClosestPoly(map_polys, pose_.map.x, pose_.map.y);

  art_msgs::ArtQuadrilateral robot_quad1 = local_map.polygons[poly_index];

  // get quadrilaterals ahead in the current lane
  art_msgs::ArtLanes lane_quads =
    quad_ops::filterLanes(robot_quad1, local_map,
                          *quad_ops::compare_backward_seg_lane);

  // get obstacles ahead in the current lane
  art_msgs::ArtLanes lane_obstacles =
    quad_ops::filterLanes(robot_quad1, obstacles,
                          *quad_ops::compare_backward_seg_lane);

  // reverse the vectors because the code that follows expects
  // polygons in order of distance from base polygon
  std::reverse(lane_quads.polygons.begin(), lane_quads.polygons.end());
  std::reverse(lane_obstacles.polygons.begin(), lane_obstacles.polygons.end());

  float distance = std::numeric_limits<float>::infinity();
  if (lane_obstacles.polygons.size()!=0)
    {
      // get distance along road from robot to nearest obstacle
      int target_id = lane_obstacles.polygons[0].poly_id;
      distance = 0;
      for (size_t i = 0; i < lane_quads.polygons.size(); i++)
        {
          distance += lane_quads.polygons[i].length;
          if (lane_quads.polygons[i].poly_id == target_id)
            break;
        }
    }

  // filter the distance by averaging over time
  float filt_distance;
  distance_filter_.update(distance, filt_distance);
  
  // calculate velocity of object (including filter)
  float prev_distance = observation_.distance;
  ros::Time current_update(ros::Time::now());
  double time_change = (current_update - prev_update_).toSec();
  float velocity = (filt_distance - prev_distance) / (time_change);
  float filt_velocity;
  velocity_filter_.update(velocity,filt_velocity);
  prev_update_ = current_update; // Reset prev_update time

  // Time to intersection (infinite if obstacle moving away)
  double time = std::numeric_limits<float>::infinity();
  if (filt_velocity < 0)      // Object getting closer, will intersect
    {
      if (filt_velocity > -0.1)     // avoid dividing by a tiny number
        {
          filt_velocity = 0.1;
        }
      time = fabs(filt_distance / filt_velocity);
    }

  // return the observation
  observation_.distance = filt_distance;
  observation_.velocity = filt_velocity;
  observation_.time = time;
  observation_.clear =  (time > 10.0);
  observation_.applicable = (velocity_filter_.isFull());
                   
  return observation_;
}

}; // namespace observers

---

art_observers
Author(s): Michael Quinlan, Jack O'Quin, Corbyn Salisbury
autogenerated on Fri Mar 1 14:13:50 2013