The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces.
Hang DinhHieu T. DinhLaurent MichelAlexander RussellPublished in: J. Artif. Intell. Res. (2012)
Keyphrases
- search space
- exact solution
- solution space
- worst case
- search strategy
- search algorithm
- linear equations
- optimal solution
- computational cost
- closed form
- branch and bound
- decision problems
- solution quality
- combining multiple
- computational complexity
- approximate solutions
- greedy heuristic
- heuristic solution
- greedy heuristics