Blocks World revisited

Artificial Intelligence

Volumn 125, Issue 1-2, 2001, Pages 119-153

  Slaney, John ^a   Thiébaux, Sylvie ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DECISION THEORY; FEATURE EXTRACTION; PROBLEM SOLVING; RANDOM PROCESSES;

DOMAIN-SPECIFIC PLANNING ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 0342420590     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00079-5     Document Type: Article

References (33)

1. Bacchus F., Kabanza F. Using temporal logic to control search in a forward chaining planner. Proc. EWSP-95, Assisi, Italy. 1995;157-169.
2. Bacchus F., Kabanza F. Using temporal logic to express search control knowledge for planning. Artificial Intelligence. 116:(1-2):2000;123-191.
3. Bäckström C. Five years of tractable planning. Proc. EWSP-95, Assisi, Italy. 1995;19-33.
4. + planning. Computational Intelligence. 11:(4):1995.
5. Bylander T. The computational complexity of propositional STRIPS planning. Artificial Intelligence. 69:1994;165-204.
6. Chenoweth S.V. On the NP-hardness of Blocks World. Proc. AAAI-91, Anaheim, CA. 1991;623-628.
7. Doherty P., Kvarnström J. TALplanner: An empirical investigation of a temporal logic-based forward chaining planner. Proc. 6th International Workshop on Temporal Representation and Reasoning (TIME-99). 1999.
8. Ernst M.D., Millstein T.D., Weld D.S. Automatic SAT-compilation of planning problems. Proc. IJCAI-99, Stockholm, Sweden. 1999;1169-1176.
9. Estlin T.A., Mooney R.J. Hybrid learning of search control rules for plan-space planners. Proc. EWSP-95, Assisi, Italy. 1995;145-156.
10. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco, CA.
11. Gerevini A., Schubert L. Inferring state constraints for domain-independent planning. Proc. AAAI-98, Madison, WI. 1998;905-912.
12. Giunchiglia E., Massarotto A., Sebastiani R. Act, and the rest will follow: Exploiting determinism in planning as satisfiability. Proc. AAAI-98, Madison, WI. 1998;948-953.
13. Gupta N., Nau D.S. Complexity results for Blocks World planning. Proc. AAAI-91, Anaheim, CA. 1991;629-633.
14. Gupta N., Nau D.S. On the complexity of Blocks World planning. Artificial Intelligence. 56:1992;223-254.
15. Kambhampati S., Srivastava B. Universal classical planner: An algorithm for unifying state-space and plan-space planning. Proc. EWSP-95, Assisi, Italy. 1995;81-94.
16. Kautz H., Selman B. Planning as satisfiability. Proc. ECAI-92, Vienna, Austria. 1992;359-363.
17. Kautz H., Selman B. Pushing the envelope: Planning, propositional logic, and stochastic search. Proc. AAAI-96, Portland, OR. 1996;1194-1201.
18. Kautz H., Selman B. The role of domain-specific knowledge in the planning as satisfiability framework. Proc. AIPS-98. 1998;181-189.
19. Kvarnström J., Doherty P., Haslum P. Extending TALplanner with concurrency and resources. Proc. ECAI-2000. 2000;501-505.
20. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. The Traveling Salesman Problem. 1992;Wiley, Chichester.
21. Lebedev N.N. Special Functions and Their Applications. 1972;Dover Publications, New York.
22. Minton S. Learning effective search control knowledge: An explanation-based approach. 1988;Ph.D. Thesis, Carnegie-Mellon University, Pittsburgh, PA.
23. Qu Y., Kambhampati S. Learning search control rules for plan-space planners: Factors affecting the performance. Proc. EWSP-95, Assisi, Italy. 1995;133-144.
24. Rizzoli A.E., Gambardella L.M., Zaffalon M., Mastrolilli M. Simulation for the evaluation of optimised operations policies in a container terminal. Proc. HMS99, Maritime and Industrial Logistics Modelling and Simulation, Genoa, Italy. 1999.
25. Schoppers M.J. Estimating reaction plan size. Proc. AAAI-94, Seattle, WA. 1994;1238-1244.
26. Selman B. Near-optimal plans, tractability, and reactivity. Proc. Internat. Conference on the Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany. 1994;521-529.
27. Slaney J. Generating random states of blocks world. 1995;Technical Report TR-ARP-18-95, Automated Reasoning Project, Australian National University, Canberra.
28. Slaney J., Thiébaux S. Adventures in blocks world. 1994;Technical Report TR-ARP-7-94, Australian National University, Canberra.
29. Slaney J., Thiébaux S. Blocks World tamed: Ten thousand blocks in under a second. 1995;Technical Report TR-ARP-17-95, Automated Reasoning Project, Australian National University, Canberra.
30. Slaney J., Thiébaux S. How best to put things on top of other things. 1996;Technical Report TR-ARP-6-96, Automated Reasoning Project, Australian National University, Canberra.
31. Slaney J., Thiébaux S. Linear time near-optimal planning in the Blocks World. Proc. AAAI-96, Portland, OR. 1996;1208-1214.
32. Slaney J., Thiébaux S. On the hardness of decision and optimisation problems. Proc. ECAI-98, Brighton, England. 1998;244-248.
33. Slavin T. Virtual port of call. New Scientist. June 1996;40-43.