Jump to content

  • Log In with Google      Sign In   
  • Create Account

How to deal with hetergeneous agent size in pathfinding


Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.

  • You cannot reply to this topic
2 replies to this topic

#1 lucky6969b   Members   -  Reputation: 624

Like
0Likes
Like

Posted 15 July 2013 - 03:39 PM

The author of recast informs me that their library doesn't support this feature.

Any better ideas for me?

Thanks

Jack



Sponsor:

#2 Álvaro   Crossbones+   -  Reputation: 13311

Like
0Likes
Like

Posted 15 July 2013 - 03:45 PM

Each link in the graph contains a maximum size for a unit that can traverse it. Then apply your favorite algorithm as usual.



#3 jack_1313   Members   -  Reputation: 536

Like
0Likes
Like

Posted 18 July 2013 - 06:04 AM

Hi Jack,

Alvaro's solution won't well work for a robust navigation mesh system.

Please see my response in this thread. In it, I discuss the problems introduced by accounting for agents of different sizes as well as how to resolve them.






Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.



PARTNERS