Skip to main content
SpringerLink
Log in

To Block or Not to Block?

  • Conference paper
Advances in Artificial Intelligence – IBERAMIA 2004 (IBERAMIA 2004)

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

Included in the following conference series:

Abstract

The present work deals with the blocks world domain. While studying and analysing the theory about blocks world (BW) problems (BWP) an effective algorithm to solve instances was “discovered”. This algorithm solves optimally many instances of blocks world problems and involves no search. The algorithm is backed up by ideas stated in Gupta and Nau (1991,1992) [5,6] and in Slaney and Thiebaux (1996,2001) [9,10]; the algorithm is suitable for programming and could serve to build an optimal block solver without forward search. The ideas behind this algorithm may constitute a basis for investigating other problems of more practical interest like the container loading problem and the bin packing problem.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Bylander, T.: The computational complexity of strips planning. Artificial Intelligence 69, 165–204 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Charniak, E., And McDermott, D.: Introduction to Artificial Intelligence. Addison-Wesley, Reading (1985)

    MATH  Google Scholar 

  3. Erol, K.D.N., Subrahmanian, V.: When is planning decidable? In: Proc. First International Conference AI Planning Systems (1992)

    Google Scholar 

  4. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: a Foundation for Computer Science. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  5. Gupta, N., Nau, D.S.: Complexity results for Blocks World planning. In: Proc. AAAI 1991, Anaheim, CA, pp. 629–633 (1991)

    Google Scholar 

  6. Gupta, N., Nau, D.S.: On the complexity of Blocks World planning. Artificial Intelligence 56, 223–254 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  7. Nilson, N.J.: Principles of Artificial Intelligence. Tioga, Palo Alto, To Block or Not to Block? 143 (1980)

    Google Scholar 

  8. Rizzoli, A.E., Gambardella, L.M., Zaffalon, M., Mastrolilli, M.: Simulation for the evaluation of optimised operations policies in a container terminal. In: Proc. HMS 1999, Maritime and Industrial Logistics Modelling and Simulation, Genoa, Italy (1999)

    Google Scholar 

  9. Slaney, J., Thiébaux, S.: Linear time near-optimal planning in the Blocks World. In: Proc. AAAI 1996, Portland, OR, pp. 1208–1214 (1996)

    Google Scholar 

  10. Slaney, J., Thiébaux, S.: Blocks World revisited. Artificial Intelligence 125, 119–153 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Slavin, T.: Virtual port of call. In: New Scientist, June 1996, pp. 40–43 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, C/Jordi Girona Salgado, 1-3, Mòdul C6, 08034, Barcelona, Spain

    Alejandro González Romero & René Alquézar

Authors
  1. Alejandro González Romero
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. René Alquézar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratorio Nacional de Informatica Avanzada, A.C. Lania, Rebsamen 80, Col. Centro, 91000, Xalapa, Veracruz, Mexico

    Christian Lemaître

  2. Department of Computer Science, National Institute of Astrophysics, Optics and Electronics (INAOE), Luis E. Erro 1, 72840, Sta. Maria Tonantzintla, Puebla, Mexico

    Carlos A. Reyes

  3. Computer Science Department, National Institute of Astrophysics, Optics and Electronics, Luis Enrique Erro 1, 72840, Tonantzintla, México

    Jesús A. González

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Romero, A.G., Alquézar, R. (2004). To Block or Not to Block?. In: Lemaître, C., Reyes, C.A., González, J.A. (eds) Advances in Artificial Intelligence – IBERAMIA 2004. IBERAMIA 2004. Lecture Notes in Computer Science(), vol 3315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30498-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30498-2_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23806-5

  • Online ISBN: 978-3-540-30498-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation