CHH3213 / chhRobotics_CPP

自动驾驶规划控制常用算法c++代码实现
657 stars 211 forks source link

A星代码疑惑 #7

Closed IamXulin closed 4 months ago

IamXulin commented 7 months ago

double Astar::calIndex(Astar::Node node) { //cout<x<<","<y<<endl; return (node->y-min_y)x_width+(node->x-min_x);

} node的x,y好像是栅格中的x,y索引,而min_x,min_y是实际坐标最小值,这两好像不能相减,我感觉应该是 return (node->y)*x_width+(node->x);

IamXulin commented 7 months ago

好像两种都可以,索引只是编号,node的实际x,y不会变