Optiplan: Unifying IP-based and graph-based planning

Journal of Artificial Intelligence Research

Volumn 24, Issue , 2005, Pages 919-931

  Van Den Briel, Menkes H L ^a   Kambhampati, Subbarao ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITION; ENCODING (SYMBOLS); INTEGER PROGRAMMING; PLANNING;

ENCODINGS; GRAPH-BASED PLANNING; INTERNATIONAL PLANNING; PLANNING SYSTEM;

GRAPH THEORY;

EID: 31144450955     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1698     Document Type: Article

References (19)

1. Blum, A., & Furst, M. (1995). Fast planning through planning graph analysis. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pp. 1636-1642.
2. Bockmayr, A., & Dimopoulos, Y. (1998). Mixed integer programming models for planning problems. In Working notes of the CP-98 Constraint Problem Reformulation Workshop.
3. Bockmayr, A., & Dimopoulos, Y. (1999). Integer programs and valid inequalities for planning problems. In Proceedings of the European Conference on Planning (ECP-99), pp. 239-251. Springer-Verlag.
4. Brearley, A., Mitra, G., & Williams, H. (1975). Analysis of mathematical programming problems prior to applying the simplex algorithm. Mathematical Programming, 8, 54-83.
5. Bylander, T. (1997). A linear programming heuristic for optimal planning. In AAAI97/IAAI-97 Proceedings, pp. 694-699.
6. Chandru, V., & Hooker, J. (1999). Optimization Methods for Logical Inference. John Wiley & Sons, New York.
7. Dimopoulos, Y. (2001). Improved integer programming models and heuristic search for AI planning. In Proceedings of the European Conference on Planning (ECP-01), pp. 301-313. Springer-Verlag.
8. Dimopoulos, Y., & Gerevini, A. (2002). Temporal planning through mixed integer programming. In Proceeding of the AIPS Workshop on Planning for Temporal Domains, pp. 2-8.
9. Do, M., &: Kambhampati, S. (2001). Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP. Artificial Intelligence, 132(2), 151-182.
10. Fourer, R., Gay, D., & Kernighan, B. (1993). AMPL: A Modeling Language for Mathematical Programming. Duxbury Press, Belmont, CA.
11. ILOG Inc., Mountain View, CA (2002). ILOG CPLEX 8.0 user's manual.
12. Kambhampati, S. (1997). Challenges in bridging plan synthesis paradigms. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-97), pp. 44-49.
13. Kautz, H., & Selman, B. (1992). Planning as satisfiability. In Proceedings of the European Conference on Artificial Intelligence (ECAI).
14. Kautz, H., &: Selman, B. (1999). Blackbox: Unifying sat-based and graph-based planning. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-99), pp. 318-325.
15. Kautz, H., & Walser, J. (1999). State-space planning by integer optimization. In AAAI-99/IAAI-99 Proceedings, pp. 526-533.
16. van den Briel, M., Vossen, T., & Kambhampati, S. (2005). Reviving integer programming approaches for AI planning: a branch-and-cut framework. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS-05), pp. 310-319.
17. Vossen, T., Ball, M., Lotem, A., & Nau, D. (1999). On the use of integer programming models in AI planning. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-99), pp. 304-309.
18. Wolfman, S., & Weld, D. (1999). The LPSAT engine and its application to resource planning. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-99), pp. 310-317.
19. Wolsey, L. (1998). Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, New York.