#include <grid_search.h>
|
static std::string | CalcIndex (const double x, const double y, const double xy_resolution, const std::vector< double > &XYbounds) |
|
◆ Node2d() [1/2]
apollo::planning::Node2d::Node2d |
( |
const double |
x, |
|
|
const double |
y, |
|
|
const double |
xy_resolution, |
|
|
const std::vector< double > & |
XYbounds |
|
) |
| |
|
inline |
在文件 grid_search.h 第 44 行定义.
45 {
46
47 grid_x_ = static_cast<int>((x - XYbounds[0]) / xy_resolution);
48 grid_y_ = static_cast<int>((y - XYbounds[2]) / xy_resolution);
49 index_ = ComputeStringIndex(grid_x_, grid_y_);
50 }
◆ Node2d() [2/2]
apollo::planning::Node2d::Node2d |
( |
const int |
grid_x, |
|
|
const int |
grid_y, |
|
|
const std::vector< double > & |
XYbounds |
|
) |
| |
|
inline |
在文件 grid_search.h 第 51 行定义.
52 {
53 grid_x_ = grid_x;
54 grid_y_ = grid_y;
55 index_ = ComputeStringIndex(grid_x_, grid_y_);
56 }
◆ CalcIndex()
static std::string apollo::planning::Node2d::CalcIndex |
( |
const double |
x, |
|
|
const double |
y, |
|
|
const double |
xy_resolution, |
|
|
const std::vector< double > & |
XYbounds |
|
) |
| |
|
inlinestatic |
在文件 grid_search.h 第 80 行定义.
82 {
83
84 int grid_x = static_cast<int>((x - XYbounds[0]) / xy_resolution);
85 int grid_y = static_cast<int>((y - XYbounds[2]) / xy_resolution);
86 return ComputeStringIndex(grid_x, grid_y);
87 }
◆ GetCost()
double apollo::planning::Node2d::GetCost |
( |
| ) |
const |
|
inline |
◆ GetDistanceToObstacle()
double apollo::planning::Node2d::GetDistanceToObstacle |
( |
| ) |
const |
|
inline |
◆ GetGridX()
double apollo::planning::Node2d::GetGridX |
( |
| ) |
const |
|
inline |
◆ GetGridY()
double apollo::planning::Node2d::GetGridY |
( |
| ) |
const |
|
inline |
◆ GetHeuCost()
double apollo::planning::Node2d::GetHeuCost |
( |
| ) |
const |
|
inline |
◆ GetIndex()
const std::string & apollo::planning::Node2d::GetIndex |
( |
| ) |
const |
|
inline |
◆ GetPathCost()
double apollo::planning::Node2d::GetPathCost |
( |
| ) |
const |
|
inline |
◆ GetPreNode()
std::shared_ptr< Node2d > apollo::planning::Node2d::GetPreNode |
( |
| ) |
const |
|
inline |
◆ operator==()
bool apollo::planning::Node2d::operator== |
( |
const Node2d & |
right | ) |
const |
|
inline |
在文件 grid_search.h 第 88 行定义.
88 {
89 return right.GetIndex() == index_;
90 }
◆ SetCost()
void apollo::planning::Node2d::SetCost |
( |
const double |
cost | ) |
|
|
inline |
◆ SetDistanceToObstacle()
void apollo::planning::Node2d::SetDistanceToObstacle |
( |
const double |
dist | ) |
|
|
inline |
◆ SetHeuristic()
void apollo::planning::Node2d::SetHeuristic |
( |
const double |
heuristic | ) |
|
|
inline |
在文件 grid_search.h 第 61 行定义.
61 {
62 heuristic_ = heuristic;
63 cost_ = path_cost_ + heuristic_;
64 }
◆ SetPathCost()
void apollo::planning::Node2d::SetPathCost |
( |
const double |
path_cost | ) |
|
|
inline |
在文件 grid_search.h 第 57 行定义.
57 {
58 path_cost_ = path_cost;
59 cost_ = path_cost_ + heuristic_;
60 }
◆ SetPreNode()
void apollo::planning::Node2d::SetPreNode |
( |
std::shared_ptr< Node2d > |
pre_node | ) |
|
|
inline |
该类的文档由以下文件生成:
- modules/planning/planning_open_space/coarse_trajectory_generator/grid_search.h