Plan-refinement strategies and search-space size

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1348 LNAI, Issue , 1997, Pages 414-426

  Tsuneto, Reiko ^a   Nau, Dana ^a   Hendler, James ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Commitment strategies; Planning and search; Refinement strategies

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AND/OR GRAPHS; COMMITMENT STRATEGY; CONSTANT TIME; EQUIVALENT STATE; PLANNING PROCESS; REFINEMENT STRATEGY; SEARCH SPACE SIZE; SEARCH SPACES;

OPTIMIZATION;

EID: 79960294701     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63912-8_103     Document Type: Conference Paper

References (21)

1. 1994, Anthony Barret and Daniel Weld. Partial-order planning: Evaluating possible efficiency gains. Artificial Intelligence 67(1), pp. 71-112.
2. 1975, James Bitner and Edward Reingold. Backtrack Programming Techniques. CACM 18(11), pp. 651-656.
3. 1981, W. Clocksin and C. Mellish. Programming in PROLOG. Springer-Verlag.
4. 1991, Ken Currie and Austin Tate. O-plan: the open planning architecture. Artificial Intelligence 52, pp. 49-86.
5. 1995, Kutluhan Erol. HTN planning: Formalization, analysis, and implementation. Ph.D. dissertation, Computer Science Dept., U. of Maryland.
6. 1992, Naresh Gupta and Dana Nau. On the complexity of blocksworld planning. Artificial Intelligence 56:2-3, pp. 223-254.
7. 1996, Alfonso Gerevini and Lenhart Schubert. Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and Pruning. Journal of Artificial Intelligence Research 5, pp. 95-137.
8. 1994, David Joslin and Martha Pollack. Least-cost flaw repair: A plan refinement strategy for partial-order planning. In Proceedings of the Twelfth National Conference on Artificial Intelligence, pp. 1004-1009.
9. 1996, David Joslin and Martha Pollack. Is "early commitment" in plan generation ever a good idea? In Proc. Thirteenth National Conference on Artificial Intelligence, pp. 1188-1193.
10. 1995, Subbarao Kambhampati, Craig Knoblock, and Qiang Yang. Planning as refinement search: A unified framework for evaluating design tradeoffs in partial-order planning. Artificial Intelligence 76, pp. 167-238.
11. 1992, Vipin Kumar. Algorithms for constraint-satisfaction problems: A survey. AI Magazine, pp. 32-44.
12. 1997, Sean Luke. A Fast Probabilistic Tree Generation Algorithm. Unpublished manuscript.
13. 1992, J. S. Penberthy and Daniel Weld. UCPOP: A sound, complete, partial order planner for ADL. Proc. KR-92.
14. 1983, Paul W. Purdom. Search Rearrangement Backtracking and Polynomial Average Time. Artificial Intelligence 21, pp. 117-133.
15. 1983, Paul W. Purdom and Cynthia A. Brown. An Analysis of Backtracking with Search Rearragement. SIAM J. Computing 12(4), pp.717-733.
16. 1977, Earl Sacerdoti. A Structure for Plans and Behavior. American Elsevier Publishing Company.
17. 1981, Mark Stefik. Planning with constraints (MOLGEN: part 1). Artificial Intelligence 16, pp. 111-140.
18. 1996, S. J. J. Smith, D. S. Nau, and T. A. Throop. Total-order multiagent task-network planning for control bridge. AAAI-96, pp. 108-113.
19. 1979, G. Stockman. A minimax algorithm better than alpha-beta? Artificial Intelligence 12(2), pp. 179-96.
20. 1996, Reiko Tsuneto, Kufluhan Erol, James Hendler, and Dana Nau. Commitment strategies in hierarchical task network planning. In Proc. Thirteenth National Conference on Artificial Intelligence, pp. 536-542.
21. 1995, Manuela Veloso and Peter Stone. FLECS: Planning with a flexible commitment strategy. JAIR 3, pp. 25-52.