Exploiting the structure of hierarchical plans in temporal constraint propagation

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2005, Pages 1223-1228

  Yorke Smith, Neil ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; HIERARCHICAL SYSTEMS; INFORMATION TECHNOLOGY; MATHEMATICAL MODELS; PLANNING;

HIERARCHICAL PLANS; PLANNING DOMAINS; TEMPORAL CONSTRAINT PROPAGATION; TEMPORAL REASONING;

CONSTRAINT THEORY;

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

References (16)

1. Bessière, C. 1996. A simple way to improve path consistency in interval algebra networks. In Proc. of AAAI-96, 375-380.
2. Cesta, A., and Oddi, A. 1996. Gaining efficiency and flexibility in the simple temporal problem. In Proc. of TIME-96, 45-50.
3. Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal constraint networks. Artificial Intelligence 49(1-3):61-95.
4. Dechter, R. 2003. Constraint Processing. San Francisco, CA: Morgan Kaufmann.
5. Erol, K.; Hendler, J.; and Nau, D. 1994. Semantics for hierarchical task-network planning. Technical Report CS-TR-3239, Computer Science Department, University of Maryland.
6. Frank, J., and Jónsson, A. 2004. Constraint-based attribute and interval planning. Constraints 8(4):339-364.
7. Jónsson, A. K.; Morris, P. H.; Muscettola, N.; Rajan, K.; and Smith, B. 2000. Planning in interplanetary space: Theory and practice. In Proc. of AIPS'00, 177-186.
8. Laborie, P., and Ghallab, M. 1995. Planning with sharable resource constraints. In Proc. of IJCAI'95, 1643-1649.
9. Laborie, P. 2003. Algorithms for propagating resource constraints in ai planning and scheduling: existing approaches and new results. Artificial Intelligence 143(2):151-188.
10. Myers, K. L.; Tyson, W. M.; Wolverton, M. J.; Jarvis, P. A.; Lee, T. J.; and desJardins, M. 2002. PASSAT: A user-centric planning framework. In Proc. of the Third Intl. NASA Workshop on Planning and Scheduling for Space.
11. Nau, D.; Au, T.-C.; Ilghami, O.; Kuter, U.; Murdock, W.; Wu, D.; and Yaman, F. 2003. SHOP2: An HTN planning system. J. Artificial Intelligence Research 20:379-404.
12. Smith, D.; Frank, J.; and Jónsson, A. 2000. Bridging the gap between planning and scheduling. Knowledge Eng. Review 15(1).
13. Tate, A.; Drabble, B.; and Kirby, R. 1994. O-Plan2: An architecture for command, planning and control. In Fox, M., and Zweben, M., eds., Intelligent Scheduling. Morgan Kaufmann.
14. Tsamardinos, I.; Muscettola, N.; and Morris, P. H. 1998. Fast transformation of temporal plans for efficient execution. In Proc. of AAAI-98, 254-261.
15. Wilkins, D. E. 1999. Using the SIPE-2 Planning System. Artificial Intelligence Center, SRI International, Menlo Park, CA.
16. Xu, L., and Choueiry, B. Y. 2003. A new efficient algorithm for solving the simple temporal problem. In TIME'03, 212-222.