193 lines
7.0 KiB
C++
Executable File
193 lines
7.0 KiB
C++
Executable File
/*
|
||
* Copyright 2018 The Cartographer Authors
|
||
*
|
||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||
* you may not use this file except in compliance with the License.
|
||
* You may obtain a copy of the License at
|
||
*
|
||
* http://www.apache.org/licenses/LICENSE-2.0
|
||
*
|
||
* Unless required by applicable law or agreed to in writing, software
|
||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||
* See the License for the specific language governing permissions and
|
||
* limitations under the License.
|
||
*/
|
||
|
||
#ifndef CARTOGRAPHER_MAPPING_2D_GRID_2D_H_
|
||
#define CARTOGRAPHER_MAPPING_2D_GRID_2D_H_
|
||
|
||
#include <vector>
|
||
#include <set>
|
||
|
||
#include "cartographer/mapping/2d/map_limits.h"
|
||
#include "cartographer/mapping/grid_interface.h"
|
||
#include "cartographer/mapping/probability_values.h"
|
||
#include "cartographer/mapping/proto/grid_2d.pb.h"
|
||
#include "cartographer/mapping/proto/submap_visualization.pb.h"
|
||
#include "cartographer/mapping/proto/submaps_options_2d.pb.h"
|
||
#include "cartographer/mapping/value_conversion_tables.h"
|
||
|
||
namespace cartographer {
|
||
namespace mapping {
|
||
|
||
proto::GridOptions2D CreateGridOptions2D(
|
||
common::LuaParameterDictionary* const parameter_dictionary);
|
||
|
||
enum class GridType { PROBABILITY_GRID, TSDF };
|
||
|
||
class Grid2D : public GridInterface {
|
||
public:
|
||
Grid2D(const MapLimits& limits, float min_correspondence_cost,
|
||
float max_correspondence_cost,
|
||
ValueConversionTables* conversion_tables);
|
||
explicit Grid2D(const proto::Grid2D& proto,
|
||
ValueConversionTables* conversion_tables);
|
||
|
||
// Returns the limits of this Grid2D.
|
||
const MapLimits& limits() const { return limits_; }
|
||
|
||
// Finishes the update sequence.
|
||
void FinishUpdate();
|
||
|
||
// Returns the correspondence cost of the cell with 'cell_index'.
|
||
float GetCorrespondenceCost(const Eigen::Array2i& cell_index) const {
|
||
if (!limits().Contains(cell_index)) return max_correspondence_cost_;
|
||
return (*value_to_correspondence_cost_table_)
|
||
[correspondence_cost_cells()[ToFlatIndex(cell_index)]];
|
||
}
|
||
|
||
virtual GridType GetGridType() const = 0;
|
||
|
||
// Returns the minimum possible correspondence cost.
|
||
float GetMinCorrespondenceCost() const { return min_correspondence_cost_; }
|
||
|
||
// Returns the maximum possible correspondence cost.
|
||
float GetMaxCorrespondenceCost() const { return max_correspondence_cost_; }
|
||
|
||
// Returns true if the probability at the specified index is known.
|
||
// 指定的栅格是否被更新过
|
||
bool IsKnown(const Eigen::Array2i& cell_index) const {
|
||
return limits_.Contains(cell_index) &&
|
||
correspondence_cost_cells_[ToFlatIndex(cell_index)] !=
|
||
kUnknownCorrespondenceValue;
|
||
}
|
||
|
||
// Fills in 'offset' and 'limits' to define a subregion of that contains all
|
||
// known cells.
|
||
void ComputeCroppedLimits(Eigen::Array2i* const offset,
|
||
CellLimits* const limits) const;
|
||
|
||
// Grows the map as necessary to include 'point'. This changes the meaning of
|
||
// these coordinates going forward. This method must be called immediately
|
||
// after 'FinishUpdate', before any calls to 'ApplyLookupTable'.
|
||
virtual void GrowLimits(const Eigen::Vector2f& point);
|
||
|
||
virtual std::unique_ptr<Grid2D> ComputeCroppedGrid() const = 0;
|
||
|
||
virtual proto::Grid2D ToProto() const;
|
||
|
||
virtual bool DrawToSubmapTexture(
|
||
proto::SubmapQuery::Response::SubmapTexture* const texture,
|
||
transform::Rigid3d local_pose) const = 0;
|
||
// jzq 新增
|
||
std::vector<uint16>* mutable_semantics_observer() {
|
||
return &(semantics_observer_);
|
||
}
|
||
const std::vector<uint16>& semantics_observer() const {
|
||
return semantics_observer_;
|
||
}
|
||
const std::vector<std::vector<uint16>>& semantics_counter() const {
|
||
return semantics_counter_;
|
||
}
|
||
std::vector<uint16>* mutable_scanSemantics_observer() {
|
||
return &(scanSemantics_observer_);
|
||
}
|
||
std::vector<uint16>* mutable_semantics_update_indices() {
|
||
return &(semantics_update_indices_);
|
||
}
|
||
|
||
std::set<uint16> smallObjects = {115, 116, 117, 121, 150, 153, 154, 200, 201, 209};
|
||
// Converts a 'cell_index' into an index into 'cells_'.
|
||
// 二维像素坐标转为一维索引坐标
|
||
int ToFlatIndex(const Eigen::Array2i& cell_index) const {
|
||
CHECK(limits_.Contains(cell_index)) << cell_index;
|
||
return limits_.cell_limits().num_x_cells * cell_index.y() + cell_index.x();
|
||
}
|
||
|
||
protected:
|
||
void GrowLimits(const Eigen::Vector2f& point,
|
||
const std::vector<std::vector<uint16>*>& grids,
|
||
const std::vector<uint16>& grids_unknown_cell_values);
|
||
|
||
// 返回不可以修改的栅格地图数组的引用
|
||
const std::vector<uint16>& correspondence_cost_cells() const {
|
||
//。。。return correspondence_cost_cells_;
|
||
return correspondence_cost_cells_;
|
||
}
|
||
// 。。。返回不可以修改的栅格地图强度数组的引用
|
||
const std::vector<std::vector<float>>& correspondence_cost_cells2() const {
|
||
//。。。return correspondence_cost_cells_;
|
||
return intensities;
|
||
}
|
||
const std::vector<int>& update_indices() const { return update_indices_;}
|
||
const Eigen::AlignedBox2i& known_cells_box() const {
|
||
return known_cells_box_;
|
||
}
|
||
|
||
// 返回可以修改的栅格地图数组的指针
|
||
std::vector<uint16>* mutable_correspondence_cost_cells() {
|
||
return &(correspondence_cost_cells_);
|
||
}
|
||
std::vector<std::vector<float>>* mutable_correspondence_cost_cells2() {
|
||
return &(intensities);
|
||
}
|
||
|
||
// jzq新增，返回可修改的语义计数器
|
||
std::vector<std::vector<uint16>>* mutable_semantics_counter() {
|
||
return &(semantics_counter_);
|
||
}
|
||
std::vector<uint16>* mutable_semantics() {
|
||
return &(semantics_);
|
||
}
|
||
const std::vector<uint16>& semantics() const {
|
||
return semantics_;
|
||
}
|
||
const std::vector<uint16>& scanSemantics() const {
|
||
return scanSemantics_observer_;
|
||
}
|
||
|
||
std::vector<int>* mutable_update_indices() { return &update_indices_; }
|
||
Eigen::AlignedBox2i* mutable_known_cells_box() { return &known_cells_box_; }
|
||
|
||
private:
|
||
MapLimits limits_; // 地图大小边界, 包括x和y最大值, 分辨率, x和y方向栅格数
|
||
|
||
// 地图栅格值, 存储的是free的概率转成uint16后的[0, 32767]范围内的值, 0代表未知
|
||
std::vector<uint16> correspondence_cost_cells_;
|
||
std::vector<std::vector<float>> intensities;
|
||
|
||
// jzq新增，语义计数器
|
||
std::vector<std::vector<uint16>> semantics_counter_;
|
||
std::vector<uint16> semantics_;
|
||
std::vector<uint16> semantics_observer_;
|
||
std::vector<uint16> scanSemantics_observer_;
|
||
std::vector<uint16> semantics_update_indices_;
|
||
|
||
float min_correspondence_cost_;
|
||
float max_correspondence_cost_;
|
||
std::vector<int> update_indices_; // 记录已经更新过的索引
|
||
|
||
// Bounding box of known cells to efficiently compute cropping limits.
|
||
Eigen::AlignedBox2i known_cells_box_; // 栅格的bounding box, 存的是像素坐标
|
||
// 将[0, 1~32767] 映射到 [0.9, 0.1~0.9] 的转换表
|
||
const std::vector<float>* value_to_correspondence_cost_table_;
|
||
};
|
||
|
||
} // namespace mapping
|
||
} // namespace cartographer
|
||
|
||
#endif // CARTOGRAPHER_MAPPING_2D_GRID_2D_H_
|
||
|
||
|