Pathfinding with crowds ~ by Vincent VD

Single-agent pathfinding is done with A* on a grid or navmesh. But while this is suitable for a small amount of actors, when you want to simulate crowds, you'll find it doesn't that well anymore.

In this project I'll be implementing flow fields, a technique which assigns a direction to each space in a grid, and every actor inside will follow that direction.

There are 3 main components in this project: a navmesh, a flock and a grid.

This is the only part I didn't write myself, I reused code from a prior project.

The flock contains an array of agents that is iterated every frame on the CellSpace (the grid).

I tried implementing using Dijkstra. This algorithm only needs to be executed once. After the algorithm is finished, using a technique called vector kernel convolution, I would then determine the final direction of the grid cell.

When the middle mouse button is pressed, it recalculates the grid and creates a new 'sink'.