197 lines
7.2 KiB
C++
197 lines
7.2 KiB
C++
/*
|
|
* Software License Agreement (BSD License)
|
|
*
|
|
* Copyright (c) 2010-2012, Willow Garage, Inc.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* * Redistributions in binary form must reproduce the above
|
|
* copyright notice, this list of conditions and the following
|
|
* disclaimer in the documentation and/or other materials provided
|
|
* with the distribution.
|
|
* * Neither the name of Willow Garage, Inc. nor the names of its
|
|
* contributors may be used to endorse or promote products derived
|
|
* from this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
|
|
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
|
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
|
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
|
|
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
*
|
|
*/
|
|
|
|
/*
|
|
* Author: Paul Bovbel
|
|
*/
|
|
|
|
#include <pointcloud_to_laserscan/pointcloud_to_laserscan_nodelet.h>
|
|
#include <sensor_msgs/LaserScan.h>
|
|
#include <pluginlib/class_list_macros.h>
|
|
#include <sensor_msgs/point_cloud2_iterator.h>
|
|
#include <geometry_msgs/Point32.h>
|
|
|
|
namespace pointcloud_to_laserscan
|
|
{
|
|
|
|
PointCloudToLaserScanNodelet::PointCloudToLaserScanNodelet()
|
|
: tf2_(), tf2_listener_(tf2_)
|
|
{ }
|
|
|
|
|
|
void PointCloudToLaserScanNodelet::onInit()
|
|
{
|
|
nh_ = getMTNodeHandle();
|
|
private_nh_ = getMTPrivateNodeHandle();
|
|
|
|
private_nh_.param<std::string>("target_frame", target_frame_, "");
|
|
private_nh_.param<double>("min_height", min_height_, 0.0);
|
|
private_nh_.param<double>("max_height", max_height_, 1.0);
|
|
|
|
private_nh_.param<double>("angle_min", angle_min_, -M_PI/2.0);
|
|
private_nh_.param<double>("angle_max", angle_max_, M_PI/2.0);
|
|
private_nh_.param<double>("angle_increment", angle_increment_, M_PI/360.0);
|
|
private_nh_.param<double>("scan_time", scan_time_, 1.0/30.0);
|
|
private_nh_.param<double>("range_min", range_min_, 0.45);
|
|
private_nh_.param<double>("range_max", range_max_, 4.0);
|
|
|
|
int concurrency_level;
|
|
private_nh_.param<int>("concurrency_level", concurrency_level, true);
|
|
private_nh_.param<bool>("use_inf", use_inf_, true);
|
|
|
|
boost::mutex::scoped_lock lock(connect_mutex_);
|
|
|
|
// Only queue one pointcloud per running thread
|
|
if(concurrency_level > 0)
|
|
{
|
|
input_queue_size_ = concurrency_level;
|
|
}else{
|
|
input_queue_size_ = boost::thread::hardware_concurrency();
|
|
}
|
|
|
|
pub_ = nh_.advertise<sensor_msgs::LaserScan>("scan", 10,
|
|
boost::bind(&PointCloudToLaserScanNodelet::connectCb, this),
|
|
boost::bind(&PointCloudToLaserScanNodelet::disconnectCb, this));
|
|
}
|
|
|
|
void PointCloudToLaserScanNodelet::connectCb()
|
|
{
|
|
boost::mutex::scoped_lock lock(connect_mutex_);
|
|
if (!sub_ && pub_.getNumSubscribers() > 0) {
|
|
NODELET_DEBUG("Got a subscriber to laserscan, starting subscriber to point cloud");
|
|
sub_.reset(new FilteredSub(nh_, "cloud_in", input_queue_size_));
|
|
if(!target_frame_.empty())
|
|
{
|
|
message_filter_.reset(new MessageFilter(*sub_, tf2_, target_frame_, input_queue_size_, nh_));
|
|
message_filter_->registerCallback(boost::bind(&PointCloudToLaserScanNodelet::cloudCb, this, _1));
|
|
}else{
|
|
sub_->registerCallback(boost::bind(&PointCloudToLaserScanNodelet::cloudCb, this, _1));
|
|
}
|
|
}
|
|
}
|
|
|
|
void PointCloudToLaserScanNodelet::disconnectCb()
|
|
{
|
|
boost::mutex::scoped_lock lock(connect_mutex_);
|
|
if (pub_.getNumSubscribers() == 0) {
|
|
NODELET_DEBUG("No subscibers to laserscan, shutting down subscriber to point cloud");
|
|
if(!target_frame_.empty())
|
|
{
|
|
message_filter_.reset();
|
|
}
|
|
sub_.reset();
|
|
}
|
|
}
|
|
|
|
void PointCloudToLaserScanNodelet::cloudCb(const sensor_msgs::PointCloud2ConstPtr &cloud_msg)
|
|
{
|
|
if(target_frame_.empty()){
|
|
target_frame_ = cloud_msg->header.frame_id;
|
|
}
|
|
|
|
//build laserscan output
|
|
sensor_msgs::LaserScan output;
|
|
output.header = cloud_msg->header;
|
|
output.header.frame_id = target_frame_;
|
|
output.angle_min = angle_min_;
|
|
output.angle_max = angle_max_;
|
|
output.angle_increment = angle_increment_;
|
|
output.time_increment = 0.0;
|
|
output.scan_time = scan_time_;
|
|
output.range_min = range_min_;
|
|
output.range_max = range_max_;
|
|
|
|
//determine amount of rays to create
|
|
uint32_t ranges_size = std::ceil((output.angle_max - output.angle_min) / output.angle_increment);
|
|
|
|
//determine if laserscan rays with no obstacle data will evaluate to infinity or max_range
|
|
if(use_inf_){
|
|
output.ranges.assign(ranges_size, std::numeric_limits<double>::infinity());
|
|
}else{
|
|
output.ranges.assign(ranges_size, output.range_max + 1.0);
|
|
}
|
|
|
|
sensor_msgs::PointCloud2ConstIterator<float> iter_x(*cloud_msg, "x");
|
|
sensor_msgs::PointCloud2ConstIterator<float> iter_y(*cloud_msg, "y");
|
|
sensor_msgs::PointCloud2ConstIterator<float> iter_z(*cloud_msg, "z");
|
|
|
|
geometry_msgs::Point32 point;
|
|
for(; iter_x != iter_x.end(); ++iter_x, ++iter_y, ++iter_z){
|
|
|
|
point.x = *iter_x;
|
|
point.y = *iter_y;
|
|
point.z = *iter_z;
|
|
if(!(output.header.frame_id == cloud_msg->header.frame_id)){
|
|
point = tf2_.transform(point, output.header.frame_id, output.header.stamp, cloud_msg->header.frame_id);
|
|
}
|
|
|
|
if ( std::isnan(point.x) || std::isnan(point.y) || std::isnan(point.z) ){
|
|
NODELET_DEBUG("rejected for nan in point(%f, %f, %f)\n", point.x, point.y, point.z);
|
|
continue;
|
|
}
|
|
|
|
if (point.z > max_height_ || point.z < min_height_){
|
|
NODELET_DEBUG("rejected for height %f not in range (%f, %f)\n", point.z, min_height_, max_height_);
|
|
continue;
|
|
}
|
|
|
|
double range = hypot(point.x,point.y);
|
|
if (range < range_min_){
|
|
NODELET_DEBUG("rejected for range %f below minimum value %f. Point: (%f, %f, %f)", range, range_min_, point.x, point.y, point.z);
|
|
continue;
|
|
}
|
|
|
|
double angle = atan2(point.y, point.x);
|
|
if (angle < output.angle_min || angle > output.angle_max){
|
|
NODELET_DEBUG("rejected for angle %f not in range (%f, %f)\n", angle, output.angle_min, output.angle_max);
|
|
continue;
|
|
}
|
|
|
|
//overwrite range at laserscan ray if new range is smaller
|
|
int index = (angle - output.angle_min) / output.angle_increment;
|
|
if (range < output.ranges[index]){
|
|
output.ranges[index] = range;
|
|
}
|
|
|
|
}
|
|
pub_.publish(output);
|
|
}
|
|
|
|
}
|
|
|
|
PLUGINLIB_DECLARE_CLASS(pointcloud_to_laserscan, PointCloudToLaserScanNodelet, pointcloud_to_laserscan::PointCloudToLaserScanNodelet, nodelet::Nodelet);
|
|
|