Loosely coupled formulations for automated planning: An integer programming perspective

Journal of Artificial Intelligence Research

Volumn 31, Issue , 2008, Pages 217-257

  Van Den Briel, Menkes H L ^a   Vossen, Thomas ^b   Kambhampati, Subbarao ^a  

^a Arizona State University   (United States)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; COUPLED CIRCUITS; INTEGER PROGRAMMING; NETWORK ARCHITECTURE; STATE SPACE METHODS;

AUTOMATED PLANNING; COUPLED NETWORKS; FLOW PROBLEMS; STATE VARIABLES;

AUTOMATIC PROGRAMMING;

EID: 44449168150     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2443     Document Type: Article

References (40)

1. Amir, E., & Engelhardt, B. (2003). Factored planning. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-2003), pp. 929-935.
2. + planning. Computational Intelligence, 11(4), 625-655.
3. Benton, J., van den Briel, M., & Kambhampati, S. (2007). A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS-2007), pp. 34-41.
4. Bixby, R. E. (2002). Solving real-world linear programs: a decade and more of progress. Operations Research, 50(1), 3-15.
5. Blum, A., & Fürst, M. (1995). Fast planning through planning graph analysis. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-1995), pp. 1636-1642.
6. Bockmayr, A., & Dimopoulos, Y. (1998). Mixed integer programming models for planning problems. In Working notes of the CP-98 Constraint Problem Reformulation Workshop.
7. Bockmayr, A., & Dimopoulos, Y. (1999). Integer programs and valid inequalities for planning problems. In Proceedings of the European Conference on Planning (ECP-1999), pp. 239-251.
8. Brafman, R., & Domshlak, C. (2006). Factored planning: How, when, and when not. In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI-2006), pp. 809-814.
9. Bylander, T. (1997). A linear programming heuristic for optimal planning. In Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-1997), pp. 694-699.
10. Caprara, A., & Fischetti, M. (1997). Annotated Bibliographies in Combinatorial Optimization, chap. Branch and Cut Algorithms, pp. 45-63. John Wiley and Sons.
11. Cayrol, M., Régnier, P., & Vidal, V. (2001). Least commitment in graphplan. Artificial Intelligence, 130(1), 85-118.
12. Desaulniers, G., Desrosiers, J., & Solomon, M. (Eds.). (2005). Column Generation. Springer.
13. Dimopoulos, Y. (2001). Improved integer programming models and heuristic search for AI planning. In Proceedings of the European Conference on Planning (ECP-2001), pp. 301-313.
14. Dimopoulos, Y., & Gerevini, A. (2002). Temporal planning through mixed integer programming. In Proceedings of the Workshop on Planning for Temporal Domains (AIPS-2002), pp. 2-8.
15. Dimopoulos, Y., Nebel, B., & Koehler, J. (1997). Encoding planning problems in non-monotic logic programs. In Proceedings of the 4th European Conference on Planning (ECP-1997), pp. 167-181.
16. Do, M., Benton, J., van den Briel, M., & Kambhampati, S. (2007). Planning with goal utility dependencies. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-2007), pp. 1872-1878.
17. Edelkamp, S., & Helmert, M. (1999). Exhibiting knowledge in planning problems to minimize state encoding length. In Proceedings of the European Conference on Planning (ECP-1999), pp. 135-147.
18. Garey, M., & Johnson, D. (1979). Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman and Company, N.Y.
19. Grötschel, M., Jünger, M., & Reinelt, G. (1984). A cutting plane algorithm for the linear ordering problem. Operations Research, 32, 1195-1220.
20. Helmert, M. (2006). The Fast Downward planning system. Journal of Artifical Intelligence Research, 26, 191-246.
21. Hooker, J. (1988). A quantitative approach to logical inference. Decision Support Systems, 4, 45-69.
22. ILOG Inc., Mountain View, CA (2002). ILOG CPLEX 8.0 user's manual.
23. Johnson, E., Nemhauser, G., & Savelsbergh, M. (2000). Progress in linear programming based branch-and-bound algorithms: An exposition. INFORMS Journal on Computing, 12, 2-23.
24. Kambhampati, S., & commentary from other planning researchers (2006). On the suboptimality of optimal planning track at ipc 2006. http://raosruminations.blogspot.com/2006/07/on-suboptimality-of-optimal- planning.html.
25. Karmarkar, N. (1984). A new polynomial time algorithm for linear programming. Combinatorica, 4(4), 373-395.
26. Kautz, H. (2004). SATPLAN04: Planning as satisfiability. In Working Notes on the Fourth International Planning Competition (IPC-2004), pp. 44-45.
27. Kautz, H., & Selman, B. (1992). Planning as satisfiability. In Proceedings of the European Conference on Artificial Intelligence (ECAI-1992).
28. Kautz, H., & Selman, B. (2006). SATPLAN04: Planning as satisfiability. In Working Notes on the Fifth International Planning Competition (IPC-2006), pp. 45-46.
29. Kautz, H., & Walser, J. (1999). State-space planning by integer optimization. In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-1999), pp. 526-533.
30. Martin, K. (1991). Using separation algorithms to generate mixed integer model reformulations. Operations Research Letters, 10, 119-128.
31. Padberg, M., & Rinaldi, G. (1991). A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review, 33, 60-100.
32. Rintanen, J. (1998). A planning algorithm not based on directional search. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-1998), pp. 617-624.
33. Rintanen, J., Heljanko, K., & Niemelä, I. (2006). Planning as satisfiability: parallel plans and algorithms for plan search. Artificial Intelligence, 170(12), 1031-1080.
34. Srivastava, B., Kambhampati, S., & Do, M. (2001). Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in realplan. Artificial Intelligence, 131(1-2), 73-134.
35. van den Briel, M., Benton, J., Kambhampati, S., & Vossen, T. (2007). An LP-based heuristic for optimal planning. In Proceedings of the International Conference of Principles and Practice of Constraint Programming (CP-2007), pp. 651-665.
36. van den Briel, M., & Kambhampati, S. (2005). Optiplan: Unifying IP-based and graph-based planning. Journal of Artificial Intelligence Research, 24, 623-635.
37. van den Briel, M., Kambhampati, S., & Vossen, T. (2007). Fluent merging: A general technique to improve reachability heuristics and factored planning. In Proceedings of the Workshop Heuristics for Domain-Independent Planning: Progress, Ideas, Limitations, Challenges (ICAPS-2007).
38. 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-1999), pp. 304-309.
39. 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-1999), pp. 310-317.
40. Wolsey, L. (1998). Integer Programming. John Wiley and Sons.