Skip to main content

Granular State Space Search

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

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

Included in the following conference series:

Abstract

Hierarchical problem solving, in terms of abstraction hierarchies or granular state spaces, is an effective way to structure state space for speeding up a search process. However, the problem of constructing and interpreting an abstraction hierarchy is still not fully addressed. In this paper, we propose a framework for constructing granular state spaces by applying results from granular computing and rough set theory. The framework is based on an addition of an information table to the original state space graph so that all the states grouped into the same abstract state are graphically and semantically close to each other.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bacchus, F., Yang, Q.: Downward refinement and the efficiency of hierarchical problem solving. Artificial Intelligence 71, 43–100 (1994)

    Article  MATH  Google Scholar 

  2. Holte, R.C., Mkadmi, T., Zimmer, R.M., MacDonald, A.J.: Speeding up problem solving by abstraction: a graph oriented approach. Artificial Intelligence 85, 321–361 (1996)

    Article  Google Scholar 

  3. Knoblock, C.A.: Generating Abstraction Hierarchies: An Automated Approach to Reducing Search in Planning. Kluwer Academic Publishers, Boston (1993)

    Book  MATH  Google Scholar 

  4. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasonging about Data. Kluwer Academic Publishers, Boston (1991)

    Book  MATH  Google Scholar 

  5. Sacerdoti, E.D.: Planning in a hierarchy of abstraction spaces. Artificial Intelligence 5, 115–135 (1974)

    Article  MATH  Google Scholar 

  6. Shell, P., Carbonell, J.: Towards a general framework for composing disjunctive and iterative macro-operators. In: Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 596–602 (1989)

    Google Scholar 

  7. Yang, Q., Tenenberg, J.D.: Abtweak: Abstracting a nonlinear, least commitment planner. In: Proceedings of the Eighth National Conference on Artificial Intelligence, pp. 204–209 (1990)

    Google Scholar 

  8. Yao, Y.Y.: Artificial intelligence perspectives on granular computing. In: Pedrycz, W., Chen, S.H. (eds.) Granular Computing and Intelligent Systems. Springer, Berlin (2011)

    Google Scholar 

  9. Yao, Y.Y.: A unified framework of granular computing. In: Pedrycz, W., Skowron, A., Kreinovich, V. (eds.) Handbook of Granular Computing, pp. 401–410. Wiley, New York (2008)

    Chapter  Google Scholar 

  10. Yao, Y.Y.: Granular computing: past, present and future. In: 2008 IEEE International Conference on Granular Computing, pp. 80–85 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Luo, J., Yao, Y. (2011). Granular State Space Search. In: Butz, C., Lingras, P. (eds) Advances in Artificial Intelligence. Canadian AI 2011. Lecture Notes in Computer Science(), vol 6657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21043-3_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21043-3_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21042-6

  • Online ISBN: 978-3-642-21043-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics