Engineering and compiling planning domain models to promote validity and efficiency

Artificial Intelligence

Volumn 95, Issue 1, 1997, Pages 1-65

  McCluskey, T L ^a   Porteous, J M ^a  

^a UNIVERSITY OF HUDDERSFIELD   (United Kingdom)

Author keywords

Domain modelling; Knowledge compilation; Planning

Indexed keywords

ALGORITHMS; KNOWLEDGE ACQUISITION; KNOWLEDGE BASED SYSTEMS; KNOWLEDGE REPRESENTATION; MATHEMATICAL MODELS;

DOMAIN MODEL; KNOWLEDGE COMPILATION;

MOTION PLANNING;

EID: 0031200240     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(97)00034-9     Document Type: Article

References (59)

1. J.S. Aitken and N. Shadbolt, Knowledge level planning, in: C. Bäckström and E. Sandewall, eds., Current Trends in AI Planning (IOS Press, Amsterdam, 1994).
2. R. Banerji, GPS and the psychology of the Rubik cubist, in: A. Elithorn and R. Banerji, eds., Artificial and Human Intelligence (North-Holland, Amsterdam, 1983).
3. A. Barrett and D.S. Weld, Partial-order planning: evaluating possible efficiency gains, Artificial Intelligence 67 (1994).
4. A. Barrett and D.S. Weld, Task-decomposition via plan parsing, in: Proceedings AAAI-94, Seattle, WA (1994).
5. S. Biundo and W. Stephan, Modeling planning domains systematically, in: Proceedings 12th European Conference on Artificial Intelligence (ECAI-96) (1996).
6. H. Boley, P. Hanschke, K. Hinkelmann and M. Meyer, COLAB: a hybrid knowledge representation and compilation laboratory, Tech. Rept. RR-93-08, The German Research Centre for Artificial Intelligence (1993).
7. T. Bylander, Complexity results for planning, in: Proceedings IJCAI-91, Sydney, Australia (1991).
8. T. Bylander, Complexity results for extended planning, in: Artificial Intelligence Planning Systems: Proceedings 1st International Conference (1992).
9. J.G. Carbonell, C.A. Knoblock and S. Minton, PRODIGY: an integrated architecture for planning and learning, in: K, Van Lehn, ed., Architectures for Intelligence (Morgan Kaufman, Los Altos, CA, 1991).
10. A. Cesta and A. Oddi, DDL. 1: a formal description of a constraint representation language for physical domains, in: M. Ghallab and A. Milani, eds., New Directions in AI Planning (IOS Press, Amsterdam, 1996) 341-352.
11. A. Chang, P. Kannan and B. Wong, Design of an object-oriented system for manufacturing planning and control, in: Proceedings Rensselaer's 2nd International Conference on Computer Integrated Manufacturing, Troy, NY (1991).
12. D. Chapman, Planning for conjunctive goats, Artificial Intelligence 32 (1987) 333-377.
13. J. Cheng and K.B. Irani, Ordering problem subgoals, in: Proceedings IJCAI-89, Detroit, MI (1989).
14. S.A. Chien, Towards an intelligent planning knowledge base development environment, in: Planning and Learning: On to Real Applications. Papers from the 1994 AAAI Fall Symposium, No. FS-94-01 (AAAI Press, 1995).
15. S.A. Chien, Static and completion analysis for planning knowledge base development and verification, in: Proceedings Artificial Intelligence Planning Systems (AAAI Press, 1996).
16. G. Collins and L. Pryor, On the misuse of filter conditions: a critical analysis, in: C. Bäckström and E. Sandewall, eds., Current Trends in AI Planning (IOS Press, Amsterdam, 1993) 105-116.
17. K. Currie and A. Tate, O-Plan: the open planning architecture, Artificial Intelligence 52 (1991) 49-86.
18. C. Dawson and L. Siklóssy, The role of preprocessing in problem solving systems, in: Proceedings IJCAI-77, Cambridge, MA (1977).
19. M. Des Jardins, Knowledge development methods for planning systems, in: Planning and Learning: On to Real Applications, Papers from the 1994 AAAI Fall Symposium, No. FS-94-01 (AAAI Press, 1995).
20. E. Diaz-Infante and C. Zozaya-Gorostiza, PLANRIK: a hierarchical nonlinear planner based on object states, in: Proceedings FLAIRS The Florida AI Research Symposium (1996).
21. M. Drummond and K. Currie, Goal ordering in partially ordered plans, in: Proceedings IJCAI-89, Detroit, MI (1989).
22. K. Erol, J. Hendler and D.S. Nau, UMCP: a sound and complete procedure for hierarchical task network planning, in: Proceedings Artificial Intelligence Planning Systems (Morgan Kaufman, Los Altos, CA, 1994).
23. K. Erol, D.S. Nau and V.S. Subrahmanian, On the complexity of domain-independent planning, in: Proceedings AAAI-92, San Jose, CA (1992).
24. O. Etzioni, Why PRODIGY/EBL works, in: Proceedings AAAI-90, Boston, MA (1990).
25. O. Etzioni, K. Golden and D.S. Weld, Tractable closed world reasoning with updates, in: Proceedings Fourth International Conference on Principles of Knowledge Representation and Reasoning, Bonn (1994).
26. Y. Gil, M. Veloso, S.A. Chien, D. McDermott and D. Nau, Symposium Preface, in: Planning and Learning: On to Real Applications. Papers from the 1994 AAAI Fall Symposium, No. FS-94-01 (AAAI Press, 1995).
27. M. Ginsberg, Universal planning: an (almost) universally bad idea, AI Mag. 10 (4) (1989) 40-44.
28. D.G. Green and M. Todd, Object-oriented approach to robotic motion, in: IEEE SOUTHEASTCON (1993).
29. J. Hertzberg, On building a planning tool box, in: M. Ghallab and A. Milani, eds., New Directions in AI Planning (IOS Press, Amsterdam, 1996) 3-18.
30. P. Jonsson and C. Bäckström, Incremental planning, in: M. Ghallab and A. Milani, eds., New Directions in AI Planning (IOS Press, Amsterdam, 1996) 79-90.
31. S. Kambhampati, C.A. Knoblock and Q. Yang, Planning as refinement search: a unified framework for evaluating design tradeoffs in partial order planning, Artificial Intelligence 76 (1995) 167-238.
32. S. Kambhampati and B. Srivastava, Universal classical planner: an algorithm for unifying state-space and plan-space, in: M. Ghallab and A. Milani, eds., New Directions in AI Planning (IOS Press, Amsterdam, 1996) 61-75.
33. Z. Kazi, Integrating human-computer interaction with reactive planning for a telerobotic system, Ph.D. Proposal, Department of Computer and Information Sciences, University of Delaware, Newark, DE (1994).
34. D.E. Kitchin, Use of an object-centred approach for the creation and validation of a warehouse planning domain model, Tech. Rept. (in preparation), School of Computing and Mathematics, The University of Huddersfield (1997).
35. C.A. Knoblock, Learning abstraction hierarchies for problem solving, in: Proceedings AAAI-90, Boston, MA (1990).
36. C.A, Knoblock, Automatically generating abstractions for problem solving, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (1991).
37. R.E. Korf, Macro-operators: a weak method for learning, Artificial Intelligence 26 (1985) 35-77.
38. V. Lifschitz, On the semantics of STRIPS, in: Proceedings 1986 Workshop: Reasoning about Actions and Plans (1986).
39. [391 D. McAllester and D. Rosenblitt, Systematic nonlinear planning, in: Proceedings AAAI-91, Anaheim, CA (1991).
40. T.L. McCluskey and J.M. Porteous, Two complementary techniques in knowledge compilation for planning, in: Proceedings 3rd International Workshop on Knowledge Compilation and Speedup Learning (1993).
41. T.L. McCluskey, J.M. Porteous, Y. Naik, C.N. Taylor and S. Jones, A requirements capture method and its use in an air traffic control application, Software - Practice and Experience 25 (1995).
42. D. McDermott and J. Hendler, Planning: What it is, What it could be, An introduction to the Special Issue on Planning and Scheduling, Artificial Intelligence 76 (1995) 1-16.
43. S. Minton, Quantitative results concerning the utility of explanation-based learning, in: Proceedings AAAI-88, St. Paul, MN (1988) 564-569.
44. S. Minton, J. Bresina and M. Drummond, Commitment strategies in planning: a comparative analysis, in: Proceedings IJCAI-91, Sydney, Australia (1991).
45. T.M. Mitchell and R. Keller and S.T. Kedar-Cabelli, Explanation-based learning: a unifying view, Machine Learning 1 (1986).
46. E.P.D. Pednault, Generalising nonlinear planning to handle complex goals and actions with context-dependent effects, in: Proceedings IJCAI-91, Sydney, Australia (1991).
47. M.A. Perez and O. Ezioni, DYNAMIC: a new role for training problems in EBL, Tech. Rept. CMUCS-92-124, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (1992).
48. J.M. Porteous, Compilation-based performance improvement for generative planners, Ph.D. Thesis, Department of Computer Science, The City University (1993).
49. The PRODIGY Research Group, PRODIGY 4.0: The Manual and Tutorial, Tech. Rept. CMU-CS-92-150, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (1992).
50. S. Russell, Efficient memory-bounded search algorithms, in: Proceedings ECAI-92, Vienna, Austria (1992).
51. E.D. Sacerdoti, Planning in a hierarchy of abstraction spaces, Artificial Intelligence 5 (1974) 115-135.
52. E.D. Sacerdoti, The nonlinear nature of plans, in: Proceedings IJCAI-75, Tblisi, Georgia (1975).
53. L.T. Semmens, R.B. France and T.W.G. Docker, Integrating structured analysis and formal specification techniques, Comput. J. 36 (1992).
54. D.E. Smith and M.A. Poet, Postponing threats in partial order planning, in: Proceedings AAAI-93, Washington, DC (1993).
55. P. Stone, M. Veloso and J. Blythe, The need for different domain independent heuristics, in: Proceedings 2nd International Conference on Artificial Intelligence Planning Systems (Morgan Kaufman, Los Altos, CA, 1994).
56. J.G. Turner and T.L. McCluskey, The Construction of ormal Specifications: An Introduction to the Model-Based and Algebraic Approaches, McGraw-Hill Software Engineering Series (McGraw-Hill, New York, 1994).
57. M. Veloso and J. Blythe, Linkability: examining causal link commitments in partial order planning, in: Proceedings Artificial Intelligence Planning Systems (Morgan Kaufman, Los Altos, CA, 1994).
58. D.H.D. Warren, WARPLAN: a system for generating plans, Tech. Rept., Memo 76, Department of Computational Logic, University of Edinburgh (1977).
59. D.S. Weld, An introduction to least commitment planning, AI Mag, (1994).