Abstract
This paper explores the performance of three planners, viz. parcPLAN, IPP and Blackbox, on a variant of the standard blocks-world problem. The variant problem has a restricted number of table positions, and the number of arms can vary (from 1 upwards). This type of problem is typical of many real world planning problems, where resources form a significant component. The empirical studies reveal that least commitment planning, as implemented in parcPLAN, is far more effective than the strategies in IPP and Blackbox. But the studies also reveal a serious limitation on the scaleability of parcPLAN’s algorithm.
This work was supported in part by a grant from the Engineering and Physical Sciences Research Council, Grant No. GR/L71919
This is a preview of subscription content, log in via an institution to check access.
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
Allen, J.F., Koomen, J.A.: Planning Using a Temporal World Model. In: Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI 1983, Karlsruhe, Germany, pp. 741–747 (1983)
Blum, A.L., Furst, M.L.: Fast Planning Through Planning Graph Analysis. Artificial Intelligence 90, 281–300 (1997)
ECRC. ECLiPSe User Manual. European Computer Industry Research Centre, Munich, 4.1 edn. (1998)
El-Kholy, A., Richards, B.: Temporal and Resource Reasoning in Planning: the parcPLAN approach. In: Proceedings of the 12th European Conference on Artificial Intelligence (ECAI 1996), Budapest, Hungary, pp. 614–618. John Wiley and Sons, Ltd., Chichester (1996)
El-Kholy, A.: Resource Feasibility in Planning. PhD thesis, Imperial College, University of London (1996)
Gupta, N., Nau, D.S.: On the Complexity of Blocks-World Planning. Artificial Intelligence 56, 223–254 (1992)
Joslin, D., Pollack, M.E.: Is early “commitment” in plan generation ever a goodidea? In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI 1996), Portland, Oregon, pp. 1188–1193 (1996)
Kautz, H., Selman, B.: Blackbox: A New Approach to the Application of Theorem Proving to Problem Solving. In: AIPS 1998 Workshop on Planning as Combinatorial Search, pp. 58–60 (June 1998), Available from http://www.research.att.com/~kautz/blackbox/
Koehler, J., Nebel, B., Hoffmann, J., Dimopoulos, Y.: Extending Planning Graphs to an adl Subset. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348, pp. 273–285. Springer, Heidelberg (1997), Available from http://www.informatik.uni-freiburg.de/~koehler/ipp.html
Lever, J.M., Richards, B.: ParcPLAN: a Planning Architecture with Parallel Actions, Resources and Constraints. In: Proceedings of the 9th International Symposium on Methodologies for Intelligent Systems, pp. 213–222 (1994)
Liatsos, V., Richards, B.: Planning benchmarks on a blocks world variant, Available from http://www.icparc.ic.ac.uk/parcPlan/ecp99/
McDermott, D., et al.: PDDL-The Planning Domain Definition Language, version 1.2. Technical Report CVC TR-98-003, Yale Center for Computational Vision and Control, Yale University (October 1998), Available from http://www.cs.yale.edu/HTML/YALE/CS/HyPlans/mcdermott.html
El Sakkout, H., Richards, T., Wallace, M.: Minimal Perturbation in Dynamic Scheduling. In: Prade, H. (ed.) 13th European Conference on Artificial Intelligence. ECAI 1998. John Wiley & Sons, Chichester (1998)
El Sakkout, H., Wallace, M.: Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling, To appear in Constraints journal (1999)
Srivastava, B., Kambhampati, S.: Scaling up Planning by teasing out Resource Scheduling. Technical Report ASU CSE TR 99-005, Department of Computer Science and Engineering, Arizona State University, Tempe, AZ 85287-5406 (1999), Available from http://rakaposhi.eas.asu.edu/yochan.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liatsos, V., Richards, B. (2000). Scaleability in Planning. In: Biundo, S., Fox, M. (eds) Recent Advances in AI Planning. ECP 1999. Lecture Notes in Computer Science(), vol 1809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10720246_4
Download citation
DOI: https://doi.org/10.1007/10720246_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67866-3
Online ISBN: 978-3-540-44657-6
eBook Packages: Springer Book Archive