Name
Abstract | ||
|---|---|---|
From a practical point of view, most problems cannot be optimally solved applying brute-force single-agent search algorithms. Thus, a new class of single-agent search algorithms was devised to find the optimal solution faster and/or consuming less space, heuristic single-agent search algorithms. However, designing accurate heuristic functions is still a major challenge. In this paper, a mathematical model is introduced for characterizing the accuracy of any heuristic function. This is a step ahead in the analysis of heuristic functions since this method could be used to aid other procedures to improve the original heuristic estimations. |
Year | Venue | Field |
|---|---|---|
2004 | FRONTIERS IN ARTIFICIAL INTELLIGENCE AND APPLICATIONS | Incremental heuristic search,Search algorithm,Computer science,Luus–Jaakola,Artificial intelligence,Null-move heuristic,Consistent heuristic,Heuristic,Mathematical optimization,Heuristic (computer science),Beam search,Algorithm,Machine learning |
DocType | Volume | ISSN |
Conference | 110 | 0922-6389 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlos Linares López | 1 | 93 | 15.67 |
| CL Lopez | 2 | 0 | 0.34 |