ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Pathology in heuristic search algorithms

Mitja Luštrek (2007) Pathology in heuristic search algorithms. PhD thesis.

[img] PDF (Disertacija)
Download (1468Kb)


    The thesis deals with minimax and single-agent search. Practice shows that in both cases deeper search results in better decisions. Mathematical analyses by previous researchers, however, have shown that the opposite is true: that minimaxing amplifies the error of the heuristic evaluations and hence deeper search gives worse decisions. This phenomenon has been termed search pathology. In the thesis we use a minimax model with real numbers as both true and heuristic position values to show that proper modeling of the heuristic error is enough to prevent the pathology. We proceed to examine how branching factor, dependence between nearby positions and the number of possible position values affect the pathology. We also show why minimax search is actually beneficial. The pathology in single-agent search is explained on synthetic search trees and path-finding on maps from computer games. We finally explain why single-agent search is beneficial.

    Item Type: Thesis (PhD thesis)
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    prof. dr. Ivan Bratko77Mentor
    prof. dr. Matjaž GamsComentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=50070&select=(ID=6127444)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 705
    Date Deposited: 08 Dec 2008 18:41
    Last Modified: 13 Aug 2011 00:34
    URI: http://eprints.fri.uni-lj.si/id/eprint/705

    Actions (login required)

    View Item