Jump to content

  • Log In with Google      Sign In   
  • Create Account


Optimal Navigation of a Navmesh


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
1 reply to this topic

#1 M_Johnson   Members   -  Reputation: 129

Like
1Likes
Like

Posted 12 March 2013 - 04:05 PM

So an agent needs to navigate a navigation mesh, he wants to get from Source to Dest

 

Navmesh1.jpg

 

A pathfinding algorithm is run which finds a list of navigation polygons the agent must visit

 

Navmesh2.jpg

 

In this case A, B, C, D, G, and then finally H. In the above example the agent naively navigates to the center of the "entry" edge of each polygon, i.e. when the agent wants to navigate from A to B the entrance edge would the two vertices the polygons share summed and then divided by two to give the entry point A->B which the agent will seek to. What I want to do is smooth it so it looks like this:

 

Navmesh3.jpg

 

So that it picks the best point at which to seek each entry point on the path. Now I know that probably isn't the best example because the mesh could be simplified, but it illustrates the point; I need a better way to choose how to navigate between polygon nodes. The "picking the middle" option also wouldn't work very well if two polygons share a large edge. I was wondering what elegant ways there were to achieve this?

 

Any help would be appreciated.

 

Cheers.


Edited by M_Johnson, 12 March 2013 - 04:07 PM.


Sponsor:

#2 ApochPiQ   Moderators   -  Reputation: 14891

Like
2Likes
Like

Posted 12 March 2013 - 04:39 PM

This article is a good starting point.




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