4 ms·
It sounds like you're looking for Any Angle pathfinding. The fastest known algorithm for 2D grids is ANYA: https://ojs.aaai.org/index.php/ICAPS/article/view/136
by Tossrock 2y ago
It sounds like you're looking for Any Angle pathfinding. The fastest known algorithm for 2D grids is ANYA: https://ojs.aaai.org/index.php/ICAPS/article/view/13609 https://ojs.aaai.org/index.php/ICAPS/article/view/13609
- gpm 2y agoAnd for non-grids (arbitrary constant cost 2d meshes) you can use polyanya.
- Farer 2y agoOh! This seems like something even AIs haven’t suggested before. The fact that it attempts paths in real-time without preprocessing is what I like the most! I definitely need to research this further! I’ll definitely take a look at it. Thank you!