Forward constraint-based algorithms for anytime planning

ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2009, Pages 265-272

  Pralet, Cédric ^a   Verfaillie, Gérard ^a  

^a ONERA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANYTIME PLANNING; CHRONOLOGICAL ORDER; CONSTRAINT HANDLING; CONSTRAINT NETWORKS; CONSTRAINT PROGRAMMING; CONSTRAINT-BASED; DISCRETE EVENT DYNAMIC SYSTEMS; DOMAIN-INDEPENDENT PLANNER; DOMAIN-SPECIFIC KNOWLEDGE; EXPERIMENTAL COMPARISON; GREEDY SEARCH; HIGH QUALITY; PARAMETER SETTING; PLANNING PROBLEM; QUALITY PROFILE; TREE SEARCH;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; MACHINERY;

ALGORITHMS;

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

References (14)

1. Bacchus, F., and Kabanza, F. 2000. Using Temporal Logics to Express Search Control Knowledge for Planning. Artificial Intelligence 16:123-191. (Pubitemid 30560298)
2. Do, M., and Kambhampati, S. 2000. Solving Planning-Graph by Compiling it into CSP. In Proc. of AIPS-00, 82-91.
3. Frank, J., and Jónsson, A. 2003. Constraint-Based Attribute and Interval Planning. Constraints 8(4):339-364.
4. Ghallab, M.; Nau, D.; and Traverso, P. 2004. Automated Planning: Theory and Practice. Morgan Kaufmann.
5. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302. (Pubitemid 33738066)
6. Hsu, C., and Wah, B. 2008. The SGP1an6 Planning System in 1PC6. In Proc. of the International Planning Competition (IPC6)".
7. Kvarnström, J., and Doherty, P. 2001. TALplanner: A Temporal Logic Based Forward Chaining Planner. Annals of Mathematics and Artificial Intelligence 30:119-169. (Pubitemid 33282722)
8. Nau. D.; Au, T.; Ilghami, O.; Kuter, U.; Murdock, W.; Wu, D.; and Yaman, F. 2003. SHOP2: An HTN planning system. Journal of Artificial Intelligence Research 20:379-404.
9. Pralet, C., and Verfaillie, G. 2008. Using Constraint Networks on Timelines to Model and Solve Planning and Scheduling Problems. In Proc. of ICAPS-08, 272-279.
10. Pralet, C., and Verfaillie, G. 2009. Slice Encoding for Constraint-based Planning. In Proc. of CP-09.
11. Rossi, R.; Beek, P. V.; and Walsh, T., eds. 2006. Handbook of Constraint Programming. Elsevier.
12. van Beek, P., and Chen, X. 1999. CPlan: A Constraint Programming Approach to Planning. In Proc. of AAAI-99, 585-590.
13. Verfaillie, G.; Pralet, C.; and Lemaître, M. 2008. Constraint-based Modeling of Discrete Event Dynamic Systems. Journal of Intelligent Manufacturing, Special Issue on "Planning, Scheduling, and Constraint Satisfaction". Published online.
14. Zilberstein, S. 1996. Using Anytime Algorithms in Intelligent Systems. AI Magazine 17(3):73-83. (Pubitemid 126669856)