Shortest path on a grid with obstacles [closed]

核能气质少年 提交于 2019-12-13 23:12:56

问题


Please help me finding the shortest path between two points on a 2d grid with obstacles. you will be provide starting coordinates and end cordinates. Also you know where the obstacles are.


回答1:


I suggest A* Pathfinding.

It's a really neat algorithm that should do what you want.



来源:https://stackoverflow.com/questions/23716285/shortest-path-on-a-grid-with-obstacles

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!