New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains

Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems, AIPS 2000

Volumn , Issue , 2000, Pages 206-215

  Lotem, Amnon ^a   Nau, Dana S ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

'CURRENT; BLACK BOXES; HIERARCHICAL TASK NETWORKS; NETWORK DOMAINS; NETWORK PLANNING PROBLEM; PLANNING PROBLEM; PROPERTY; SEARCH PROCESS; SUB-PROBLEMS; TRANSLOG;

DECOMPOSITION;

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

References (18)

1. Andrews, S.; Kettler, B,; Erol, K.; and Hendler, J. 1995. Um Translog: A Planning Domain for the Development and Benchmarking of Planning Systems. Technical Report Department of Computer Science, University of Maryland College Park CS-TR-3487.
2. Blum, A. and Furst, M. 1997. Fast planning through planning graph analysis. J. Artificial Intelligence, 90(1–2):281–300.
3. Currie, K. and Tate, A. 1985. O-Plan - control in the open planning architecture. BSC Expert Systems Conference, Cambridge University Press.
4. DesJardins, M. and Wolverton, M. 1998. Coordinating Planning Activity and Information Flow in a Distributed Planning System, AAAI Fall Symposium on Distributed, Continual Planning (AAAI Technical Report FS-98), AAAI Press, 1998.
5. Erol, K.; Hendler, J.; and Nau, D. 1994a. UMCP: a sound and complete procedure for Hierarchical Task-Network planning, In Proc. AIPS-94, 249-254.
6. Erol, K.; Nau, D.; Hendler, J. 1994b. HTN planning: complexity and expressivity. Proc. AAAI-94.
7. Kautz, H. and Selman, B. 1998. Blackbox: A new approach to the application of theorem proving to problem solving. Working notes of the Workshop on Planning as Combinatorial Search held in conjunction with AIPS-98, Pittsburgh, PA, 1998, 58-60.
8. Korf, R. 1987. Planning as Search: A Quantitative Approach. Artificial Intelligence (33), 1987, 65-88.
9. Koehler, J.; Nebel, B.; Hoffman, J; and Dimopoulos Y. 1997. Extending planning graphs to an ADL subset. In Proc. ECP-97, Toulouse, France, 1997.
10. Lotem, A., Nau., D., and Hendler J. 1999. Using Planning Graphs for Solving HTN Planning Problems. In Proc. AAAI-99
11. Mali, A.; and Kambhampati, S. 1998. Encoding HTN planning in propositional logic. In Proc. AIPS-98, 190-198.
12. Mali, A. 1999. Hierarchical Task Network Planning as Satisfiability. In Proc. ECP-99.
13. Nebel, B.; Dimopoulos, J.; and Koehler, J 1997. In Proc. ECP-97, 338-350.
14. Nau, D.; Smith, S. J.; and Erol, K. 1998. Control Strategies in HTN Planning: Theory versus Practice. AAAI-98/IAAI-98, 1127–1133.
15. Sacerdoti, E. 1975. The nonlinear nature of plans. In Proc. IJCAI-75, 206-214.
16. Tsuneto R.; Hendler, J.; and Nau, D. 1998. Analyzing External Conditions to Improve the Efficiency of HTN Planning. In Proc. AAAI-98.
17. Veloso, M. 1992. Learning by Analogical Reasoning in General Problem Solving. PhD thesis, School of Computer Science, Carnegie Mellon University. Technical report CMU-CS-92-174.
18. Yang, Q.; Nau, D.; and Hendler, J. 1992. Merging Separately Generated Plans with Restricted Interactions. Computational Intelligence Journal. Vol. 8, No. 4, pp. 648-676. 1992.