[glob2-devel] a->b->c (pathfinding with zwischenstop)

[Leo Wandersleb]

hi guys

i see a problem in pathfinding that i don't see any solution 
to within the capabilities of gradient maps. if a glob wants 
to put corn into some swarm it runs to the closest corn and 
then to the swarm rather than to the corn that minimizes the 
way start-corn-swarm.
Who has a conceptual approach to this problem? I'll keep 
thinking it over and ll let u know if i have a good idea on it.

Greetings, Leo Wandersleb

P.S.: Little Example:
Even wors when the [G]lob has to do the job many times and 
does it bad again and again like in this situation:
[C]orn, [H]ospital, [I]nn

C
C
CHHG
CHH
CII
CII
Cx
C

G runs around H again and again rather than sitting at x and 
handing in the C.