Optiplan: A Planning System that Unifies Integer Programming with Planning Graph

The Optiplan planning system is the first integer programming-based planner that successfully participated in the international planning competition. This engineering note describes the architecture of Optiplan and provides the integer programming formulation that enabled it to perform reasonably well in the competition. We also touch upon some recent developments that make integer programming encodings significantly more competitive.

[1]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[2]  Subbarao Kambhampati,et al.  Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework , 2005, ICAPS.

[3]  Henry Kautz,et al.  Blackbox: Unifying sat-based and graph-based planning , 1999, International Joint Conference on Artificial Intelligence.

[4]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[5]  V. Chandru,et al.  Optimization Methods for Logical Inference , 1999 .

[6]  Gautam Mitra,et al.  Analysis of mathematical programming problems prior to applying the simplex algorithm , 1975, Math. Program..

[7]  Alexander Bockmayr,et al.  Mixed Integer Programming Models for Planning Problems , 1998 .

[8]  Tom Bylander A Linear Programming Heuristic for Optimal Planning , 1997, AAAI/IAAI.

[9]  Alexander Bockmayr,et al.  Integer Programs and Valid Inequalities for Planning Problems , 1999, ECP.

[10]  Henry A. Kautz,et al.  State-space Planning by Integer Optimization , 1999, AAAI/IAAI.

[11]  Daniel S. Weld,et al.  The LPSAT Engine & Its Application to Resource Planning , 1999, IJCAI.

[12]  Dana S. Nau,et al.  On the Use of Integer Programming Models in AI Planning , 1999, IJCAI.

[13]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[14]  Alfonso Gerevini,et al.  Temporal Planning through Mixed Integer Programming , 2002, AIPS Workshop on Planning for Temporal Domains.

[15]  Daniel S. Weld,et al.  The LPSAT System and its Application to Resource Planning , 1999, International Joint Conference on Artificial Intelligence.

[16]  Subbarao Kambhampati,et al.  Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP , 2001, Artif. Intell..

[17]  H. P. Williams THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .