Using Infeasibility to Improve Abstraction-Based Heuristics

  • Fan Yang
  • Joseph Culberson
  • Robert Holte
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4612)

Abstract

The contribution of our research is to show that the accuracy of the heuristics generated by abstraction can be improved by checking for infeasibility. What do we mean by infeasible heuristics? For a state t, the heuristic value h is infeasible if it is proved that the cost of a solution for t cannot be h. Take the sliding puzzle for example, assuming that the manhattan heuristic for state t is md(t), if md(t) is even, any odd number is infeasible. To substantiate our approach, we begin with formal definitions and lemmas. Then empirical results show the effectiveness of the approach. For more details please refer to our longer work[5].

References

  1. 1.
    Edelkamp, S.: Planning with pattern databases. In: Proceedings of the 6th European Conference on Planning, pp. 13–34 (2001)Google Scholar
  2. 2.
    Felner, A., Korf, E., Hanan, S.: Additive pattern database heuristics. Journal of Artificial Intelligence Research 22, 279–318 (2004)MATHGoogle Scholar
  3. 3.
    Korf, E., Felner, A.: Disjoint pattern database heuristics. Artificial Intelligence 134, 9–22 (2002)MATHCrossRefGoogle Scholar
  4. 4.
    Prieditis, A.E.: Machine discovery of effective admissible heuristics. Machine Learning 12, 117–141 (1993)Google Scholar
  5. 5.
    Yang, F., Culberson, J., Holte, R.: A general additive search abstraction. Technical Report TR07-06. Department of Computing Science, University of Alberta (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Fan Yang
    • 1
  • Joseph Culberson
    • 1
  • Robert Holte
    • 1
  1. 1.Computing Science Department, University of Alberta, Edmonton, Alberta T6G 2E8Canada

Personalised recommendations