The comparison between the statistical heuristic search and \(A^*\) (Q2640290)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The comparison between the statistical heuristic search and \(A^*\)
scientific article

    Statements

    The comparison between the statistical heuristic search and \(A^*\) (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    Assuming G is a uniform m-ary tree, where m is its branching factor, the heuristic statistical search algorithm (SA) consists of the statistical inference method SPRT (Wald sequential probability ratio test) and BF (best-first) heuristic search. Then the procedure of SA search is divided into two steps: First, it quickly identifies the most promising subtree using a subtree evaluation function a(n) (global statistic or subtree statistic). Based on SPRT, from nodes \(n_{11},n_{12},...,n_{1m}\) in the first level, the m search directions, i.e., the subtrees \(T(n_{11}),...,T(n_{1m})\) rooted at nodes \(n_{11},...,n_{1m}\), are selected and rejected, taking the expanded nodes in each subtree as observed samples. The subtrees which contain the goal with lower probability are rejected. The most promising one is selected. Then, it expands nodes within that subtree using a node evaluation function b(n) (local statistic or node statistic).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    BF search
    0 references
    best-first heuristic search
    0 references
    uniform m-ary tree
    0 references
    heuristic statistical search algorithm
    0 references
    SPRT
    0 references
    Wald sequential probability ratio test
    0 references
    subtree evaluation function
    0 references
    subtree statistic
    0 references
    local statistic
    0 references
    node statistic
    0 references
    0 references
    0 references