Reviving integer programming approaches for AI planning: A branch-and-cut framework

ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2005, Pages 310-319

  Van Den Briel, Menkes ^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

AI PLANNING; BRANCH-AND-CUT; CONSTRAINT SATISFACTION; ENCODINGS; MULTI-VALUED; PLANNING COMMUNITY; SATISFIABILITY; STATE VARIABLES;

COMBINATORIAL OPTIMIZATION; ENCODING (SYMBOLS); PLANNING;

INTEGER PROGRAMMING;

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

References (23)

1. Backstrom, C. and Nebel, B. 1995. Complexity results for SAS+ planning. Computational Intelligence 11(4):625-655.
2. Bixby, R. 2002. Solving real-world linear programs: A decade and more of progress. Operations Research 50(1):3-15.
3. Blum, A., and Furst, M. 1995. Fast planning through planning graph analysis. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), 1636-1642.
4. Bockmayr, A. and Dimopoulos, Y. 1998. Mixed integer programming models for planning problems. In Working notes of the CP-98 Constraint Problem Reformulation Workshop.
5. Bockmayr, A. and Dimopoulos, Y. 1999. Integer programs and valid inequalities for planning problems. In Proceedings of the European Conference on Planning (ECP-99), 239-251. Springer-Verlag.
6. Bylander, T. 1997. A linear programming heuristic for optimal planning. In AAAI-97/IAAI-97 Proceedings, 694-699.
7. Caprara, A. and Fischetti, M. 1997. Annotated Bibliographies in Combinatorial Optimization. John Wiley and Sons, chapter Branch and Cut Algorithms, 45-63.
8. Cayrol, M.; Regnier, R. and Vidal, V. 2001. Least commitment in graphplan. Artificial Intelligence 130(1):85-118.
9. Dimopoulos, Y. and Gerevini, A. 2002. Temporal planning through mixed integer programming. In Proceeding of the AIPS Workshop on Plannmg for Temporal Domains, 2-8.
10. Dimopoulos, Y.; Nebel, B. and Koehler, J. 1997. Encoding planning problems in nonmonotic logic pro-grams. In Proceedings of the 4th European Conference on Planning (ECP-97), 167-181.
11. Dimopoulos, Y. 2001. Improved integer programming models and heuristic search for ai planning. In Proceedings of the European Conference on Planning (ECP-01), 301-313.
12. Springer-Verlag. Edelkamp, S. and Helmert, M. 1999. Exhibiting knowledge in planning problems to minimize state encoding length. In Proceedings of the European Conference on Planning (ECP-99), 135-147. Springer- Verlag.
13. Edelkamp, S. and Helmert, M. 2000. On the implementation of MIPS. In Proceedings of the ICAPS Workshop on Model-Theoretic Approaches to Planning.
14. Helmert, M. 2005. The Fast Downward planning system. Technical Report 217, Albert-Ludwigs- Universitat Freiburg, Institut fiir Informatik. (Submitted to J AIR).ILOG Inc., Mountain View, CA. 2002. ILOG CPLEX 8.0 user's manual.
15. Johnson, E.; Nemhauser, G. and Savelsbergh, M. 2000. Progress in linear programming based branch- And-bound algorithms: An exposition. INFORMS Journal on Computing 12:2-23.
16. Kautz, H. and Walser, J. 1999. State-space planning by integer optimization. In AAAI-99/IAAI-99 Proceedings, 526-533.
17. Kautz, H. 2004. SATPLAN04: Planning as satisfiability. In Working Notes on the International Planning Competition (IPC-2004), 44-45.
18. Padberg, M. and Rinaldi, G. 1991. A branch- And-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review 33:60-100.
19. 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-98), 617-624.
20. Srivastava, B.; Kambhampati, S.; and 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.
21. Van den Briel, M., and Kambhampati, S. 2004. Opti- plan: Unifying IP-based and graph-based planning. In Working Notes on the International Planning Competition (IPC-2004), 18-20.
22. Vossen, T.; Ball, M.; Lotem, A. and 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), 304-309.
23. Wolfman, S., and Weld, D. 1999. The lpsat engine and its applicationto resource planning. In Proceedings of the 18th, International Joint Conference on Artificial Intelligence (IJCAI-99), 310-317.