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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bylander, T.: The computational complexity of strips planning. Artificial Intelligence 69, 165–204 (1994)
Charniak, E., And McDermott, D.: Introduction to Artificial Intelligence. Addison-Wesley, Reading (1985)
Erol, K.D.N., Subrahmanian, V.: When is planning decidable? In: Proc. First International Conference AI Planning Systems (1992)
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: a Foundation for Computer Science. Addison-Wesley, Reading (1989)
Gupta, N., Nau, D.S.: Complexity results for Blocks World planning. In: Proc. AAAI 1991, Anaheim, CA, pp. 629–633 (1991)
Gupta, N., Nau, D.S.: On the complexity of Blocks World planning. Artificial Intelligence 56, 223–254 (1992)
Nilson, N.J.: Principles of Artificial Intelligence. Tioga, Palo Alto, To Block or Not to Block? 143 (1980)
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)
Slaney, J., Thiébaux, S.: Linear time near-optimal planning in the Blocks World. In: Proc. AAAI 1996, Portland, OR, pp. 1208–1214 (1996)
Slaney, J., Thiébaux, S.: Blocks World revisited. Artificial Intelligence 125, 119–153 (2001)
Slavin, T.: Virtual port of call. In: New Scientist, June 1996, pp. 40–43 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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