Pathfinding Algorithms for Mutating Graphs

1
Pathfinding Algorithms for Mutating Graphs

• Haitao Mao
• Computer Systems Lab 2007-2008

2
The Pathfinding Problem

• Given a graph, its mutation history, a start
  vertex, and a destination vertex, find the best
  vertex to move to next.

3
Sample Input

• 5 7 0 4 5 (vertices, edges, start vertex, end
  vertex, history length)?
• 0 1 1 (first vertex, second vertex, edge
  state)?
• 1 (history at a timestep for this
  edge)?
• 4 more history points
• Data for the other 6 edges of the graph
• Random Input Generator

4
Preliminary Algorithms

• Random walk
• Greedy

5
Intermediate Results

• Randomized distance
• BFS
• History class

6
Advanced Algorithms

• Heuristics
• Genetic programming

7
Comparisons

• Incorporating everything is best
• More advanced is not necessarily better

8
(No Transcript)