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

TODO: Trace h value #17

Closed jinnaiyuu closed 10 years ago

jinnaiyuu commented 10 years ago

Search overhead occurs after reaching the goal f value. Trace the transition of h value in the specific f value.

Hypothesis Obviously, all nodes belong to a single thread in serial A*. Then always the node with best h value would be expanded. If there are multiple threads, new born nodes wouldn't immediately expanded. Rather, it needs to be send to its assigned thread and then opened. It generally would not search the best node at that time.

jinnaiyuu commented 10 years ago

Implemented. Actually, it is hard to trace something useful from here. Need to find a way to visualize this more clearly.

-> Going to parse only the R= nodes for h trace.

jinnaiyuu commented 10 years ago

Horribly unreadable with naive implementation. Might need to find the other way around.