Skip to main content

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

  • 1550 Accesses

Abstract

In this article, behavior of a heuristic search with a heuristic function divided into two parts is discussed based on a geometric analysis, and a method for improving the heuristic function is proposed. One part of the divided heuristic function is called short-term forecast. Another part is called long-term forecast. Based on the discussion, it is suggested there exists a possibility that the difference of accuracy of both forecasts leads the search to an incorrect path. Since there exists a possibility that the search becomes efficient and that the search does not select an incorrect path by improving accuracy of a long-term forecast, a method to update the value of a long-term forecast is proposed. It is shown that the proposed method is effective under the tree structure which cost of the edge observed at deep location is greater or equal than that observed at shallow location.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Nilsson, N.J.: Problem-Solving Methods in Artificial Intelligence. McGraw-Hill Pub. Co., New York (1971)

    Google Scholar 

  2. Korf, R.E.: Real-time heuristic search. Artificial Intelligence 42(2-3), 189–211 (1990)

    Article  MATH  Google Scholar 

  3. Vanderbrug, G.J.: A geometric analysis of heuristic search. In: Proc. AFIPS 1976, pp. 979–986 (1976)

    Google Scholar 

  4. Russel, S., Norvig, P.: Artificial Intelligence a Modern Approach, 2nd edn. Prentice Hall, Englewood Cliffs (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ashida, M., Taki, H. (2010). Geometric Considerations of Search Behavior. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2010. Lecture Notes in Computer Science(), vol 6277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15390-7_63

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15390-7_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15389-1

  • Online ISBN: 978-3-642-15390-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics