vss2sn / path_planning Goto Github PK

under what License is this library?

add header to lib/utils/include/utils/utils.hpp
for line 243:
else if (ele == std::numeric_limits::max());

Hey, I saw your code it is an excellent implementation. I have a question on what kind of graph/grid you applied. is it visibility graph,Sukharev grid?
Thank you

Hey, this is kidist ,
I want to run the algorithms on the large grid size and the obstacle probability is 1/n .So, does it mean the number of obstacles will decrease as we increase the grid size n ?
Thank you !

你的代码看起来写得很好，可是却有非常严重的问题。在栅格尺寸10x10情况下运行良好，可是当尺寸是20x20的时候计算严重超时，40x40更是直接中断退出。在linux服务器如此，换成windows集成开发环境也是一样，应该多看看到底哪里出了问题。