Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Collaborative Diffusion

Searching Algorithm

Collaborative Diffusion is a pathfinding algorithm developed by Alexander Repenning of AgentSheets Inc. and the University of Colorado. Rather than having each moving agent compute its own path, the background tiles of the environment, termed antiobjects, perform the path calculations and effectively guide the agents toward a target. The best-known example is the ghost behavior in Pac-Man, and the technique is well suited to games where many agents pursue the same target, since the time needed to compute paths stays roughly constant as the number of agents grows, an advantage over per-agent search methods such as A*; it also makes it straightforward to mix cooperative and competitive behavior among the pursuing agents.

Connections

In Field

Source Wikipedia: Collaborative diffusion
Sources
Wikipedia: Collaborative diffusion
  • Lead section
    Collaborative Diffusion is a type of pathfinding algorithm which uses the concept of antiobjects, objects within a computer program that function opposite to what would be conventionally expected.
  • In Field: Algorithms and Complexity Theory, Lead
    Collaborative Diffusion is a type of pathfinding algorithm which uses the concept of antiobjects, objects within a computer program that function opposite to what would be conventionally expected.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.