costmap_queue.h

Go to the documentation of this file.

/*
 * Software License Agreement (BSD License)
 *
 *  Copyright (c) 2017, Locus Robotics
 *  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 the copyright holder 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 HOLDER 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.
 */
 
#ifndef COSTMAP_QUEUE_COSTMAP_QUEUE_H
#define COSTMAP_QUEUE_COSTMAP_QUEUE_H
 
#include <nav_core2/costmap.h>
#include <costmap_queue/map_based_queue.h>
#include <nav_grid/vector_nav_grid.h>
#include <algorithm>
#include <limits>
#include <memory>
#include <vector>
 
namespace costmap_queue
{
class CellData
{
public:
  CellData(const double d, const unsigned int x, const unsigned int y, const unsigned int sx, const unsigned int sy) :
    distance_(d), x_(x), y_(y), src_x_(sx), src_y_(sy)
  {
  }
 
  CellData() :
    distance_(std::numeric_limits<double>::max()), x_(0), y_(0), src_x_(0), src_y_(0)
  {
  }
 
  double distance_;
  unsigned int x_, y_;
  unsigned int src_x_, src_y_;
};
 
class CostmapQueue : public MapBasedQueue<CellData>
{
public:
  explicit CostmapQueue(nav_core2::Costmap& costmap, bool manhattan = false);
 
  void reset() override;
 
  void enqueueCell(unsigned int x, unsigned int y);
 
  CellData getNextCell();
 
  virtual int getMaxDistance() const { return std::max(costmap_.getWidth(), costmap_.getHeight()); }
 
  virtual bool validCellToQueue(const CellData& cell) { return true; }
 
  using Ptr = std::shared_ptr<CostmapQueue>;
protected:
  void enqueueCell(unsigned int cur_x, unsigned int cur_y, unsigned int src_x, unsigned int src_y);
 
  void computeCache();
 
  nav_core2::Costmap& costmap_;
 
  // This really should be VectorNavGrid<bool>, but since
  // vector<bool> is wacky, it would result in compile errors.
  nav_grid::VectorNavGrid<unsigned char> seen_;
  bool manhattan_;
protected:
  inline double distanceLookup(const unsigned int cur_x, const unsigned int cur_y,
                               const unsigned int src_x, const unsigned int src_y)
  {
    unsigned int dx = std::abs(static_cast<int>(cur_x) - static_cast<int>(src_x));
    unsigned int dy = std::abs(static_cast<int>(cur_y) - static_cast<int>(src_y));
    return cached_distances_[dx][dy];
  }
  std::vector<std::vector<double> > cached_distances_;
  int cached_max_distance_;
};
}  // namespace costmap_queue
 
#endif  // COSTMAP_QUEUE_COSTMAP_QUEUE_H