There are two frequent artifacts in crowd simulation caused by navigation mesh design. The first appears when all agents attempt to traverse the navigation mesh and share the same way points through portals, thus increasing the probability of collisions with other agents or queues forming around portals. The second is caused by way points being assigned at locations where clearance is not guaranteed, which causes the agents to either walk too close to the static geometry, slide along walls or get stuck. To overcome this we use the full length of the portal and propose a novel method for dynamically calculating way points based on current trajectory, destination, and clearance, therefore guaranteeing that agents in a crowd will have different way points assigned.To achieve collision free paths we propose two novel techniques: the first provides the computation of paths with clearance for cells of any shape (even with concavities) and the second presents a new method for calculating portals with clearance, so that the dynamically assigned way points will always guarantee collision free paths relative to the static geometry. In this paper, we extend our previous work by describing a new version of the algorithm that is suitable for a larger number of navigation meshes, while further improving performance. Our results show how the combination of portals with exact clearance and dynamic way points improve local movement by reducing the number of collision between agents and the static geometry. We evaluate our algorithm with a variety of scenarios and compare our results with traditional way points to show that our technique also offers better use of the space by the agents.

Peer Reviewed