Branching and pruning: An optimal temporal POCL planner based on constraint programming

Artificial Intelligence

Volumn 170, Issue 3, 2006, Pages 298-335

  Vidal, Vincent ^a   Geffner, Héctor ^b  

^a UNIVERSITÉ D'ARTOIS   (France)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

Constraint programming; Planning; Temporal reasoning

Indexed keywords

BENCHMARKING; CONSTRAINT THEORY; OPTIMAL CONTROL SYSTEMS;

CONSTRAINT PROGRAMMING; PARTIAL ORDER CAUSAL LINK (POCL); POCL BRANCHING SCHEME; TEMPORAL REASONING;

MATHEMATICAL PROGRAMMING;

EID: 31144445319     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2005.08.004     Document Type: Article

References (48)

1. F. Bacchus The 2000 AI planning systems competition Artificial Intelligence Magazine 22 3 2001 47 56
2. P. Baptiste, C. Le Pape, and W. Nuijten Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems 2001 Kluwer Dordrecht
3. A. Blum, and M. Furst Fast planning through planning graph analysis Proceedings of IJCAI-95, Montreal, Quebec 1995 Morgan Kaufmann San Mateo, CA 1636 1642
4. B. Bonet, and H. Geffner Planning as heuristic search Artificial Intelligence 129 1-2 2001 5 33
5. B. Bonet, G. Loerincs, and H. Geffner A robust and fast action selection mechanism for planning Proceedings of AAAI-97, Providence, RI 1997 MIT Press Cambridge, MA 714 719
6. J. Carlier, and E. Pinson An algorithm for solving the job shop scheduling problem Management Science 35 2 1989 164 176
7. Y. Caseau, F.X. Josset, F. Laburthe, CLAIRE: Combining sets, search and rules to better express algorithms, in: Proceedings of ICLP-99, 1999, pp. 245-259
8. Y. Caseau, and F. Laburthe Improved CLP scheduling with task intervals Proceedings of ICLP-94 1994 MIT Press Cambridge, MA 369 383
9. R. Dechter, I. Meiri, and J. Pearl Temporal constraint networks Artificial Intelligence 49 1991 61 95
10. M.B. Do, S. Kambhampati, Solving planning-graph by compiling it into CSP, in: Proceedings of AIPS-00, 2000, pp. 82-91
11. S. Edelkamp, and J. Hoffmann The 4th international planning competition at http://ipc04.icaps-conference.org 2004
12. F. Focacci, A. Lodi, and M. Milano Solving TSPs with time windows with constraints Proceedings of ICLP-99 1999 MIT Press Cambridge, MA 515 529
13. F. Focacci, M. Milano, Connections and integrations of dynamic programming and constraint programming, in: Proceedings of CP-AI-OR'01, 2001
14. M. Fox, and D. Long PDDL2.1: An extension to PDDL for expressing temporal planning domains J. Artificial Intelligence Res. 2003 61 124
15. H. Geffner Planning as branch and bound and its relation to constraint-based approaches Technical report, Universidad Simón Bolívar, 2001, at www.tecn.upf.es/~hgeffner
16. P. Haslum, H. Geffner, Admissible heuristics for optimal planning, in: Proceedings of the Fifth International Conference on AI Planning Systems (AIPS-2000), 2000, pp. 70-82
17. P. Haslum, H. Geffner, Heuristic planning with time and resources, in: Proceedings of European Conference of Planning (ECP-01), 2001, pp. 121-132
18. A. Jonsson, P. Morris, N. Muscettola, K. Rajan, Planning in interplanetary space: Theory and practice, in: Proceedings of AIPS-2000, 2000, pp. 177-186
19. D. Joslin, M.E. Pollack, Is "early commitment" in plan generation ever a good idea?, in: Proceedings of AAAI-96, Portland, OR, 1996, pp. 1188-1193
20. S. Kambhampati, C. Knoblock, and Q. Yang Planning as refinement search: A unified framework for evaluating design tradeoffs in partial-order planning Artificial Intelligence 76 1-2 1995 167 238
21. S. Kambhampati, and B. Srivastava Universal classical planner: An algorithm for unifying state-space and plan-space planning M. Ghallab A. Milani New Directions in AI Planning 1996 IOS Press Amsterdam 61 78
22. H. Kautz, D. McAllester, B. Selman, Encoding plans in propositional logic, in: Proceedings of KR-96, 1996, pp. 374-384
23. H. Kautz, and B. Selman Unifying SAT-based and Graph-based planning T. Dean Proceedings of IJCAI-99, Stockholm, Sweden 1999 Morgan Kaufmann San Mateo, CA 318 327
24. J. Koehler, B. Nebel, J. Hoffman, and Y. Dimopoulos Extending planning graphs to an ADL subset S. Steel R. Alami Recent Advances in AI Planning. Proceedings of 4th European Conf. on Planning (ECP-97) Lecture Notes in Artificial Intelligence vol. 1348 1997 Springer Berlin 273 285
25. J. Koehler, K. Schuster, Elevator control as a planning problem, in: Proceedings of AIPS-00, 2000, pp. 331-338
26. P. Laborie Algorithms for propagating resource constraints in AI planning and scheduling Artificial Intelligence 143 2003 151 188
27. P. Laborie, and M. Ghallab Planning with sharable resources constraints C. Mellish Proceedings of IJCAI-95, Montreal, Quebec 1995 Morgan Kaufmann San Mateo, CA 1643 1649
28. F. Laburthe CHOCO: implementing a CP kernel Proceedings of CP-00 Lecture Notes in Comput. Sci. vol. 1894 2000 Springer Berlin
29. O. Lhomme Consistency techniques for numeric CSPs Proceedings of IJCAI-93, Chambéry, France 1993 Morgan Kaufmann San Mateo, CA 232 238
30. D. Long, and M. Fox The 3rd international planning competition: Results and analysis J. Artificial Intelligence Res. 20 2003 1 59
31. A. Mali, A. Kambhampati, On the utility of plan-space (causal) encodings, in: Proceedings of AAAI-99, Orlando, FL, 1999, pp. 557-563
32. D. McAllester, and D. Rosenblitt Systematic nonlinear planning Proceedings of AAAI-91, Anaheim, CA 1991 AAAI Press Menlo Park, CA 634 639
33. D. McDermott, A heuristic estimator for means-ends analysis in planning, in: Proceedings of AIPS-96, 1996, pp. 142-149
34. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, S. Malik, Chaff: Engineering an efficient SAT solver, in: Proceedings of DAC-01, 2001, pp. 530-535
35. X.L. Nguyen, S. Kambhampati, Reviving partial order planning, in: Proceedings of IJCAI-01, Seattle, WA, 2001, pp. 459-466
36. H. Palacios, H. Geffner, Planning as branch and bound: A constraint programming implementation, in: Proceedings of XXVIII Conf. Latinoamericana de Informática, 2002, pp. 239-251
37. J.S. Penberthy, D.S. Weld, Temporal planning with continuous change, in: Proceedings of AAAI-94, Seattle, WA, 1994, pp. 1010-1015
38. J. Porteous, L. Sebastia, J. Hoffmann, On the extraction, ordering, and usage of landmarks in planning, in: Proceedings of ECP-01, 2001, pp. 37-48
39. D. Smith, J. Frank, and A. Jonsson Bridging the gap between planning and scheduling Knowledge Engrg. Rev. 15 1 2000 61 94
40. D. Smith, and D.S. Weld Temporal planning with mutual exclusion reasoning Proceedings of IJCAI-99, Stockholm, Sweden 1999 Morgan Kaufmann San Mateo, CA 326 337
41. S. Smith, C. Cheng, Slack-based heuristics for the constraint satisfaction scheduling, in: Proceedings of AAAI-93, Washington, DC, 1993, pp. 139-144
42. P. Van Beek, X. Chen, CPlan: a constraint programming approach to planning, in: Proceedings AAAI-99, Orlando, FL, 1999, pp. 585-590
43. P. Van Hentenryck The OPL Optimization Programming Language 1999 MIT Press Cambridge, MA
44. P. Van Hentenryck, H. Simonis, and M. Dincbas Constraint satisfaction using constraint logic programming Artificial Intelligence 58 1-3 1992 113 159
45. V. Vidal, H. Geffner, Branching and pruning: An optimal temporal POCL planner based on constraint programming, in: Proceedings of AAAI-2004, San Jose, CA, 2004, pp. 570-577
46. D.S. Weld An introduction to least commitment planning AI Magazine 15 4 1994 27 61
47. H.L.S. Younes, and R.G. Simmons VHPOP: Versatile heuristic partial order planner J. Artificial Intelligence Res. 20 2003 405 430
48. Y. Zhang, R. Yap, Arc consistency on n-ary monotonic and linear constraints, in: Proceedings of CP 2000, 2000, pp. 470-483