Hi,

I want to implement a pathfindung solution for a big crwod of dynamically moving entites. Every entity should avoid contact with each other entity while finding a path through a moving crowd of entities over a unevan surface.

I just want to ask, if someone does know a good starting point? Does there exist a specific algorithm, that suits best for this excercise? What do you recommend?

Thanks.


Version: A8 free
OS: Windows 10