Skip to main content
Springer Nature Link
Log in

Inconsistency versus Accuracy of Heuristics

  • Conference paper
Advances in Artificial Intelligence (Canadian AI 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8436))

Included in the following conference series:

  • 2694 Accesses

Abstract

Many studies in heuristic search suggest that the accuracy of the heuristic used has a positive impact on improving the performance of the search. In another direction, historical research perceives that the performance of heuristic search algorithms, such as A* and IDA*, can be improved by requiring the heuristics to be consistent – a property satisfied by any perfect heuristic. However, a few recent studies show that inconsistent heuristics can also be used to achieve a large improvement in these heuristic search algorithms. These results raise a natural question: which property of heuristics, accuracy or consistency/inconsistency, should we focus on when building heuristics?

In this article, we investigate the relationship between the inconsistency and the accuracy of heuristics with A* search. Our analytical result reveals a correlation between these two properties. We then run experiments on the domain for the Knapsack problem with a family of practical heuristics. Our empirical results show that in many cases, the more accurate heuristics also have higher level of inconsistency and result in fewer node expansions by A*.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Dinh, H., Russell, A., Su, Y.: On the value of good advice: The complexity of A* with accurate heuristics. In: Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI 2007), pp. 1140–1145 (2007)

    Google Scholar 

  2. Dinh, H., Dinh, H., Michel, L., Russell, A.: The time complexity of A* with approximate heuristics on multiple-solution search spaces. Journal of Artificial Intelligence Research 45, 685–729 (2012)

    MATH  MathSciNet  Google Scholar 

  3. Felner, A., Zahavi, U., Schaeffer, J., Holte, R.C.: Dual lookups in pattern databases. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, IJCAI 2005, pp. 103–108. Morgan Kaufmann Publishers Inc., San Francisco (2005)

    Google Scholar 

  4. Felner, A., Zahavi, U., Holte, R., Schaeffer, J., Sturtevant, N., Zhang, Z.: Inconsistent heuristics in theory and practice. Artificial Intelligence 175(9-10), 1570–1603 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gaschnig, J.: Performance measurement and analysis of certain search algorithms. PhD thesis, Carnegie-Mellon University, Pittsburgh, PA (1979)

    Google Scholar 

  6. Hart, P., Nilson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SCC-4(2), 100–107 (1968)

    Article  Google Scholar 

  7. Helmert, M., Röger, G.: How good is almost perfect? In: Proceedings of AAAI 2008 (2008)

    Google Scholar 

  8. Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM 22(4), 463–468 (1975) ISSN 0004-5411

    Google Scholar 

  9. Korf, R., Reid, M.: Complexity analysis of admissible heuristic search. In: Proceedings of the National Conference on Artificial Intelligence (AAAI 1998), pp. 305–310 (1998)

    Google Scholar 

  10. Korf, R., Reid, M., Edelkamp, S.: Time complexity of iterative-deepening-A*. Artificial Intelligence 129(1-2), 199–218 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Korf, R.E.: Iterative-deepening-a: an optimal admissible tree search. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence, IJCAI 1985, vol. 2, pp. 1034–1036. Morgan Kaufmann Publishers Inc., San Francisco (1985)

    Google Scholar 

  12. Korf, R.E.: Recent progress in the design and analysis of admissible heuristic functions. In: Proceedings of the 17th National Conference on Artificial Intelligence (AAAI 2000), pp. 1165–1170. AAAI Press / The MIT Press (2000) ISBN 0-262-51112-6

    Google Scholar 

  13. Huyn, J.P.N., Dechter, R.: Probabilistic analysis of the complexity of A*. Artificial Intelligence 15, 241–254 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  14. Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, MA (1984)

    Google Scholar 

  15. Pisinger, D.: Where are the hard knapsack problems? Computers and Operations Research 32, 2271–2284 (2005) ISSN 0305-0548

    Google Scholar 

  16. Pohl, I.: Practical and theoretical considerations in heuristic search algorithms. In: Elcock, W., Michie, D. (eds.) Machine Intelligence, vol. 8, pp. 55–72. Ellis Horwood, Chichester (1977)

    Google Scholar 

  17. Sen, A.K., Bagchi, A., Zhang, W.: Average-case analysis of best-first search in two representative directed acyclic graphs. Artif. Intell. 155(1-2), 183–206 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  18. Vazirani, V.: Approximation Algorithms. Springer (2001)

    Google Scholar 

  19. Zahavi, U., Felner, A., Schaeffer, J., Sturtevant, N.: Inconsistent heuristics. In: Proceedings of AAAI 2007, pp. 1211–1216 (2007)

    Google Scholar 

  20. Zahavi, U., Felner, A., Burch, N., Holte, R.C.: Predicting the performance of IDA* using conditional distributions. J. Artif. Int. Res. 37(1), 41–84 (2010), http://dl.acm.org/citation.cfm?id=1861751.1861753 ISSN 1076-9757

  21. Zhang, Z., Sturtevant, N.R., Holte, R., Schaeffer, J., Felner, A.: A* search with inconsistent heuristics. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009, pp. 634–639. Morgan Kaufmann Publishers Inc., San Francisco (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer & Information Sciences, Indiana University South Bend, USA

    Hang Dinh

Authors
  1. Hang Dinh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Medicine and School of Electrical Engineering and Computer Science, Department of Epidemiology & Community Medicine, University of Ottawa, 451 Smyth Road, Room 3105, K1H 8M5, Ottawa, ON, Canada

    Marina Sokolova

  2. Cheriton School of Computer Science, University of Waterloo, 200 University Avenue West, N2L 3G1, Waterloo, ON, Canada

    Peter van Beek

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Dinh, H. (2014). Inconsistency versus Accuracy of Heuristics. In: Sokolova, M., van Beek, P. (eds) Advances in Artificial Intelligence. Canadian AI 2014. Lecture Notes in Computer Science(), vol 8436. Springer, Cham. https://doi.org/10.1007/978-3-319-06483-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-06483-3_7

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-06482-6

  • Online ISBN: 978-3-319-06483-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics