Using collaborative diffusion rather than path finding

http://benjamin-meyer.blogspot.com/2011/11/using-collaborative-diffusion-rather.html

by philf • 15 years ago

38 4 15 years ago

benjamin-meyer.blogspot.com

alextp• 15 years ago

I think the Berkeley starcraft AI used some similar concepts to move units around.

jwatte• 15 years ago

Aren't diffusion values an implicit representation of pre-calculated closest path pathfinding? Calculating diffusion incrementally is a way to update the graph over time with a known incremental cost. But it all is just a variant of Dijksta in the end, isn't it? :-)

unoti• 15 years ago

It's highly parallel, and suggests also how multiple agents might collaborate to seek a goal (such as blocking all the possible exits that a pac man might take). See section 3.2 of the paper (http://www.cs.colorado.edu/~ralex/papers/PDF/OOPSLA06antiobj...) for an example of this. It's also an approach they've taught with some success to very young students. Seems extremely significant and need-to-know for anyone implementing game ai, even if they've already implemented other pathfinding algorithms. I'm certainly happy to see this! It's awesome and eye opening.

robobenjie• 15 years ago

The pdf he links has more examples and greater depth about implementing diffusion ai. Recommended.

http://www.cs.colorado.edu/~ralex/papers/PDF/OOPSLA06antiobj...

Using collaborative diffusion rather than path finding

Related Stories