Complexity, decidability and undecidability results for domain-independent planning

Artificial Intelligence - Tập 76 - Trang 75-88 - 1995
Kutluhan Erol1, Dana S. Nau1, V.S. Subrahmanian1
1Department of Computer Science, Institute for Systems Research, and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA

Tài liệu tham khảo

Aho, 1976 Bäckström, 1991, Planning in polynomial time: the sas-pubs class, Comput. Intell., 7, 10.1111/j.1467-8640.1991.tb00393.x Bylander, 1991, Complexity results for planning Bylander, 1992, Complexity results for extended planning Chapman, 1987, Planning for conjunctive goals, Artif. Intell., 32, 333, 10.1016/0004-3702(87)90092-0 Charniak, 1985 Chenoweth, 1991, On the NP-hardness of blocks world, 623 Dean, 1988, Reasoning about partially ordered events, Artif. Intell., 36, 375, 10.1016/0004-3702(88)90087-2 K. Erol, J.A. Hendler and D.S. Nau, Complexity results for hierarchical task-network planning (Submitted). Erol, 1991, Complexity, decidability and undecidability results for domain-independent planning Erol, 1992, When is planning decidable?, 222 Erol, 1993, Toward a general framework for hierarchical task-network planning Fikes, 1971, STRIPS: a new approach to the application of theorem proving to problem solving, Artif. Intell., 2, 189, 10.1016/0004-3702(71)90010-5 Garey, 1979 Graham, 1989 Gupta, 1991, Complexity results for blocks-world planning Gupta, 1992, On the complexity of blocks-world planning, Artif. Intell., 56, 223, 10.1016/0004-3702(92)90028-V Korf, 1987, Planning as search: a quantitative approach, Artif. Intell., 33, 65, 10.1016/0004-3702(87)90051-8 Lifschitz, 1990, On the semantics of STRIPS, 523 McAllester, 1991, Systematic nonlinear planning, 634 McDermott, 1991, Regression planning, Int. J. Intell. Syst., 6, 357, 10.1002/int.4550060404 Minton, 1991, Commitment strategies in planning Nau, 1993, On the complexity of possible truth Nilsson, 1980 Pednault, 1988, Synthesizing plans that contain actions with context-dependent effects, Comput. Intell., 4, 356, 10.1111/j.1467-8640.1988.tb00285.x Peot, 1992, Conditional nonlinear planning, 189 Sacerdoti, 1974, Planning in a hierarchy of abstraction spaces, Artif. Intell., 5, 115, 10.1016/0004-3702(74)90026-5 Sacerdoti, 1990, The nonlinear nature of plans, 162 Sacerdoti, 1975, 206 Shoenfield, 1967 Subrahmanian, 1993, Database updates and AI planning domains Tate, 1990, A review of AI planning techniques, 26 Tate, 1977, Generating project networks Wilkins, 1990, Domain-independent planning: representation and plan generation, 319 Wilkins, 1984, Artif. Intell., 22, 269, 10.1016/0004-3702(84)90053-5 Yang, 1990, Optimization of multiple-goal plans with limited interaction Yang, 1992, Merging separately generated plans with restricted interactions, Comput. Intell., 8, 648, 10.1111/j.1467-8640.1992.tb00383.x