SHOP: Simple hierarchical ordered planner

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2, Issue , 1999, Pages 968-973

  Nau, Dana ^a   Cao, Yue ^a   Lotem, Amnon ^a   Muftoz Avila, Hector ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN REPRESENTATIONS; HTN PLANNING; NUMERIC COMPUTATION; ORDERS OF MAGNITUDE; PLANNING ALGORITHMS; PLANNING PROBLEM; PLANNING PROCESS; SIMPLE HIERARCHICAL ORDERED PLANNERS;

ARTIFICIAL INTELLIGENCE;

PLANNING;

EID: 84880665976     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. F. Bacchus and K. Kabanza. Using temporal logic to control search in a forward chaining planner. In M. Ghallab and A. Milani (Eds.), New Directions in Planning, IOS Press, 141-153, 1996.
2. F. Bacchus and K. Kabanza. Using temporal logic to express search control knowledge for planning. 〈ftp.logos.uwaterloo.ca/pub/bacchus/BKTlplan. ps〉. Submitted to Artificial Intelligence, 1998.
3. K. Currie and A. Tate. O-Plan: The open planning architecture. Artificial Intelligence, 52:49-86, 1991.
4. K. Erol, K, J. Hendler, and D. Nau. UMCP: A sound and complete procedure for Hierarchical Task-Network planning. Proc. 2nd Int'l Conf. AI Planning Systems (AlPS-94), 249-254, 1994.
5. E. Fink and M. Veloso. Formalizing the Prodigy planning algorithm. In Proc. European Workshop in AI Planning (EWSP-95), 1995.
6. N. Gupta and D. Nau. On the complexity of blocks-world planning. Artificial Intelligence 56(2-3), 223-254, 1992.
7. H. Kautz and B. Selman. Blackbox: A SAT-technology planning system. 〈hup://www.research.att.com/-kautz/blackbox〉, 1998.
8. J. Koehlar, B. Nebel, J. Hoffmann, and Y. Dimopoulos. Extending planning graphs to an ADL subset. In ECP-97, 273-285, 1997.
9. R. Korf. Planning as search: A quantitative approach. Artificial Intelligence 33:65-88, 1987.
10. D. MeAllester and D. Rosenblitt. Systematic nonlinear planning. In Proc. AAAI-9I, 1991.
11. D. McDermott. AIPS-98 Planning Competition Results, 〈http://ftp.cs. yale.edu/pub/mcdermott/aipscomp-results.html〉, 1998.
12. D. Nau, S. J. Smith, and K. Erol. Control Strategies in HTN Planning: Theory versus Practice. AAM-9&/IAAI-98, 1127-1133, 1998.
13. H. Munoz-Avila, D. Aha, J. Ballas, L. Breslow, and D. Nau. Using guidelines to constrain interactive case-based HTN planning. Tech. Report AIC-99-004, Naval Center for Applied Research on AI, Naval Research Lab., Washington, DC, 1999.
14. J. S. Penberthy and D. Weld, D. 1992. UCPOP: A sound, complete, partial order planner for ADL. In Proc. KR-92, 1992.
15. E. Sacerdoti. A Structure for Plans and Behavior. American Elsevier, 1977.
16. S. J. Smith, K. Hebbar, D. Nau, and I. Minis. Integrating electrical and mechanical design and process planning. In Martti Mantyla, Susan Finger and Tetsuo Tomiyama (ed.), Knowledge Intensive CAD, Volume 2, pp. 269-288, 1997.
17. S. J. Smith, D. Nau, and T. Throop. Computer bridge: a big win for AI planning. AI Magazine 19(2), 93-105, 1998.
18. A. Tate. Generating project networks. In Proc. UCAI-77, 888-893, 1977.
19. M. Veloso and J. Blythe. Linkability: Examining causal link commitments in partial-order planning. In Proc. AIPS-94, 1994.
20. D. Wilkins. Can AI planners solve practical problems?. Computational Intelligence 6 (4):232-246, 1990.
21. Q. Yang, D. Nau, and J. Hendler. Merging separately generated plans with restricted interactions. Computational Intelligence 8(2):648-676, February 1992.