I’ve posted in the past about work done by Autodesk Research – in particular by Rhys Goldstein – to implement a more natural-seeming (but still direct and efficient) pathfinding algorithm. This is the algorithm at the heart of our Space Analysis package, and you can find details on how it works in these previous posts:
- A paper on our space analysis algorithm in the Journal of Artificial Intelligence Research
- Explaining how path counting helps simulate natural navigation
- Visibility in space analysis: an explainer
The above posts reference these articles/papers that have been published elsewhere:
- Path Counting for Grid-Based Navigation
- A short and direct walk with Pascal’s Triangle
- A quick and clear look at grid-based visibility
While these are great (even if I do say so myself), Rhys really wanted to put something out there that helps people try this mechanism for themselves, and potentially evolve it and contribute to this area of research.
We’ve been working together to…