Jump to content

Good pathfinding examples


Recommended Posts

The guy in the video said that each unit uses its own unique pathfinding. They don't do group paths if I understand it correctly.

His previous pathfinding algorithm was "From point A to point B."... doesn't pyrogenesis have long and short pathfinders?

Some commenters said that it's fake... claiming that the video was only the sped up version of the original. Only you guys can say something about that... but the arrows did seem too fast for real-life.

Link to comment
Share on other sites

  • 3 weeks later...
  • 2 weeks later...

mhm. From this video nothing is evident. Even if not using group pathfinding it could still cache the found path of one unit and reuse it (at least for the long pathfinder that is how it looks like). (No information about grid resolution is given either.)

Also the enemy units are fully static. (Apart from that it's a pure murder video without much value.) With many moving obstacles this'd get interesting. Unfortunately the only moving entities in the video are the attackers while the enemy is clustered at static positions (every officer of course would be very happy with such soldiers dying with so much discipline, moving not even one inch ;-)).

Sad no dynamic obstacles are placed either. (in contrast to the video of @jeffnz, such debugging info would be helpful in the video of the giant storming of the static defender castle)

Actually a good example of a pathfinder is already within pyrogenesis (despite maybe some bottlenecks at certain circumstances).
Drunk on Nectar has a versatile pathfinding for flying units but even that one may require up to 3s (timeout) per unit per tic (of course a tic is way shorter, it's just a time out). Making that work with pyrogenesis' supported amount of moving entities is hardcore. (Yet the dynamic collision avoidance is fascinating and has many applications in the real world open source projects (where often there is just < two bot per computer whereas pyrogenesis' pathfinder deals with the thousands of entities within one part of one thread's time)!)

 

 

Edited by Radagast.
  • Like 3
Link to comment
Share on other sites

  • 1 month later...
On 22.05.2017 at 3:58 AM, jonbaer said:

While researching IDA* I came across this small project ... https://qiao.github.io/PathFinding.js/visual/

If I'm not mistaken, it has wrong the breadth-first search implementation, it should be mostly equal to Dijkstra. Also Dijkstra is useless for this kind of graphs.

About topic video, it could use some types of "formation fluid", when an algorithm doesn't control each unit, but all together, like sticky substance.

Edited by vladislavbelov
  • Like 1
Link to comment
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Reply to this topic...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

 Share

×
×
  • Create New...