search

jinnaiyuu / Hash-Distributed-Astar

Hash Distributed A*
https://sites.google.com/site/yuujinnaishomepage/home/parallel-search
MIT License
3 stars 1 forks source link

Workload 11/07 #21

Closed jinnaiyuu closed 10 years ago

jinnaiyuu commented 10 years ago
  1. Solve 1000 randomly created instances
  2. Sort instances according to its size. Then make some packages for experiments. maybe like this. Easy: 10 to 120 seconds Medium: 120 to 1200 seconds Difficult: More than 1200 seconds
  3. Evaluate everything using the instance.
  4. Plot scatter plot matrix with R.
  5. Find next thing to analyze.
jinnaiyuu commented 10 years ago

1.2. Done. Generated easy easy instances: 5 seconds (in serial astar) easy instances: 5 to 50 seconds difficult instances: 50 to 3000 seconds

jinnaiyuu commented 10 years ago

3.4. Done.

  1. -Plot search overhead rather than straight up expanded node. -Branching factor?

jinnaiyuu commented 10 years ago

Iteration for 11/07 has done. See other TODOs for information