Average-Case Analysis of Heuristic Search in Tree-Like Networks

  • A. Bagchi
  • Anup K. Sen
Part of the Symbolic Computation book series (SYMBOLIC)


A search graph has the form of an m-ary tree with bi-directional arcs of unit cost. There is a goal node at a distance N from the root, and there may be other goal nodes at distances ≥ N from the root. It is assumed that the heuristic estimates of nongoal nodes, after being appropriately normalized, are independent and identically distributed random variables. The heuristic is not required to be admissible. Under what conditions is the expected number of node expansions E(Z) polynomial in N? Earlier efforts by Pearl and others at answering this question have considered search trees with only one goal node. An attempt is made here to develop a general and unified method of analysis applicable to situations with more than one goal node. It is shown that, for most probability distributions on the heuristic estimates, E(Z) is exponential in N; the one major exception being the case when the number of goal nodes is polynomial in N and the normalizing function for the error is logarithmic. Pearl’s contention that the average-case analysis of weighted heuristic search is not too attractive is also verified. It is hoped that the general approach described here will encourage similar studies on search graphs other than trees.


Goal Node Heuristic Search Search Tree Solution Path Search Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Bagchi and A. Mahanti, Three Approaches to Heuristic Search in Networks, JACM, vol. 32, no. 1, Jan. 1985, pp. 1–27.MathSciNetMATHCrossRefGoogle Scholar
  2. [2]
    A. Bagchi and A. Mahanti, Search Algorithms under Different Kinds of Heuristics—a Comparative Study, JACM, vol. 30, no. 1, Jan. 1983, pp. 1–21.MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    A. Bagchi and Anup K. Sen, Heuristic Search in General Tree Structures: an Average Case Analysis, Proceedings of the 14th Annual ACM Computer Science Conference, Feb. 1986, pp. 309–318.Google Scholar
  4. [4]
    A. Bagchi and P. K. Srimani, Weighted Heuristic Search in Networks, J. Algorithms, vol. 6, no. 4, Dec. 1985, pp. 550–576.MathSciNetMATHCrossRefGoogle Scholar
  5. [5]
    J. G. Gaschnig, Performance Measurement and Analysis of Certain Search Algorithms, Ph.D. thesis, Computer Science Department, Carnegie Mellon University, 1979.Google Scholar
  6. [6]
    N. Huyn, R. Dechter and J. Pearl, Probabilistic Analysis of the complexity of A*, Artificial Intelligence, vol. 15, 1980, pp. 241–254.MathSciNetMATHCrossRefGoogle Scholar
  7. [7]
    A. Martelli, On the Complexity of Admissible Search Algorithms, Artificial Intelligence, vol. 8, 1977, pp. 1–13.MathSciNetMATHCrossRefGoogle Scholar
  8. [8]
    N. J. Nilsson, Principles of Artificial Intelligence, Tioga Springer Verlag, 1980.Google Scholar
  9. [9]
    J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, 1984.Google Scholar
  10. [10]
    J. Pearl, Some Recent Results in Heuristic Search Theory, IEEE Transactions PAMI, vol. PAMI-6, no. 1, Jan. 1984, pp. 1–13.CrossRefGoogle Scholar
  11. [11]
    J. Pearl, Knowledge Versus Search: A Quantitative Analysis Using A*, Artificial Intelligence, vol. 20, 1983, pp. 1–13.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag New York Inc. 1988

Authors and Affiliations

  • A. Bagchi
    • 1
  • Anup K. Sen
    • 1
  1. 1.Indian Institute of Management CalcuttaCalcuttaIndia

Personalised recommendations