This is just a bit odd~ My seekers are not getting the shortest paths?? Im using a navemesh with a funnel mod… And this is going on 
So after some testing … It is finding the “Best path”, but this is before any funneling takes place, this is seeming to cause it to prioritize small grid spaces VS large ones… Any way to fix this??
The only easy fix I can think of is making very large triangles/vertices have a penalty when searched~
Feels foolish now Well… I guess it was just having LARGE nodes next to SMALL nodes, Is there some way to make Large nodes have a larger penalty then smaller ones?
Hi
That is an unfortunate limitation of pathfinding on navigation meshes, having large nodes next to small nodes can cause suboptimal paths to be found. That is why most navmesh generators try to make the navmesh fulfil the delaunay criteria as much as possible (see wikipedia). There are algorithms extending A* which can handle it better (any-angle pathfinding), but those are not currently implemented, I want to do that in the future though.
You can make a custom graph update object which adjusts the penalties on the triangles (see docs on Updating Graphs During Runtime, at the bottom), I have found that it does not work well in all cases, so I haven’t added it to the system.
Sounds Good! I found that a Grid graph seems to work best for my current project anyway~ Seeing as its a lot faster to update, Thanks for the feed back though!! I have been having a great time using A* 