30 #ifndef PLANNER_CSPACE_PLANNER_3D_DISTANCE_MAP_H 31 #define PLANNER_CSPACE_PLANNER_3D_DISTANCE_MAP_H 35 #include <unordered_map> 83 std::vector<Astar::Vec>
pos;
108 return g_.operator[](pos);
112 return g_.operator[](pos);
114 inline const Astar::Gridmap<float>&
gridmap()
const 124 Astar::Gridmap<float>
g_;
135 std::unordered_map<Astar::Vec, bool, Astar::Vec>
edges_;
145 #endif // PLANNER_CSPACE_PLANNER_3D_DISTANCE_MAP_H
std::shared_ptr< GridAstarModel3D > Ptr
void init(const GridAstarModel3D::Ptr model, const Params &p)
CyclicVecInt< DIM, NONCYCLIC > Vec
DistanceMap(const BlockMemGridmapBase< char, 3, 2 > &cm_rough, const CostmapBBF &bbf_costmap)
Rect(const Astar::Vec &min, const Astar::Vec &max)
std::vector< Astar::Vec > pos
float & operator[](const Astar::Vec &pos)
const float operator[](const Astar::Vec &pos) const
const BlockMemGridmapBase< char, 3, 2 > & cm_rough_
reservable_priority_queue< Astar::PriorityVec > pq_erase_
Astar::Gridmap< float > g_
const Astar::Vec & size() const
const Astar::Gridmap< float > & gridmap() const
const CostmapBBF & bbf_costmap_
void setParams(const CostCoeff &cc, const int num_cost_estim_task)
reservable_priority_queue< Astar::PriorityVec > pq_open_
std::vector< SearchDiffs > search_diffs_
void fillCostmap(reservable_priority_queue< Astar::PriorityVec > &open, const Astar::Vec &s_rough)
void create(const Astar::Vec &s, const Astar::Vec &e)
const DebugData & getDebugData() const
std::unordered_map< Astar::Vec, bool, Astar::Vec > edges_
void update(const Astar::Vec &s, const Astar::Vec &e, const Rect &rect)