Jump to content

View more

Image of the Day

雑魚は多めにして、爽快感重視にしつつ・・・(´・ω・`)
早いとこ、ベースを作って、完成にもっていかないとね。
タイトルもまだ迷ってるだよなぁ。 
#indiedev  #indiegame #screenshotsaturday https://t.co/IwVbswGrhe
IOTD | Top Screenshots

The latest, straight to your Inbox.

Subscribe to GameDev.net Direct to receive the latest updates and exclusive content.


Sign up now

How to deal with hetergeneous agent size in pathfinding

4: Adsense

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   

1282
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



#2 Álvaro   Members   

20913
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   

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.