Firstly , For those of your who dont know - Anytime Algorithm is an algorithm that get as input the amount of time it can run and it should give the best solution it can on that time.

Weighted A\* is the same as A\* with one diffrence in the f function :

(where g is the path cost upto node , and h is the heuristic to the end of path until reaching a goal)

```
Original = f(node) = g(node) + h(node)

Weighted = f(node) = (1-w)g(node) +h(node)

```

My anytime algorithm runs Weighted A\* with decaring weight from 1 to 0.5 until it reaches the time limit.

My problem is that most of the time , it takes alot time until this it reaches a solution , and if given somthing like 10 seconds it usaully doesnt find solution while other algorithms like anytime beam finds one in 0.0001 seconds.

Any ideas what to do?