Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework

The conventional wisdom in the planning community is that planners based on integer programming (IP) techniques cannot compete with satisfiability and constraint satisfaction based planners. In this paper we challenge this perception of IP techniques by presenting novel formulations that outperform the most efficient SAT-based planner that currently exists. We will present a series of IP formulations that (1) use multivalued state variables that are represented by networks, and that (2) control the encoding length by progressively generalizing the notion of parallelism. The resulting IP encodings are solved within a branch-and-cut framework and yield impressive results.

[1]  Malte Helmert,et al.  Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length , 1999, ECP.

[2]  Malte Helmert,et al.  On the Implementation of MIPS , 2000 .

[3]  Robert E. Bixby,et al.  Solving Real-World Linear Programs: A Decade and More of Progress , 2002, Oper. Res..

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

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

[6]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[7]  Martin W. P. Savelsbergh,et al.  Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition , 2000, INFORMS J. Comput..

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

[9]  Vincent Vidal,et al.  Least commitment in Graphplan , 2001, Artif. Intell..

[10]  Bernhard Nebel,et al.  Encoding Planning Problems in Nonmonotonic Logic Programs , 1997, ECP.

[11]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

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

[13]  S. Kambhampati,et al.  Optiplan: Unifying IP-based and Graph-based Planning , 2005, J. Artif. Intell. Res..

[14]  Subbarao Kambhampati,et al.  Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan , 2001, Artif. Intell..

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

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

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

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

[19]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..

[20]  Malte Helmert,et al.  The Fast Downward Planning System , 2006, J. Artif. Intell. Res..

[21]  Jussi Rintanen,et al.  A Planning Algorithm not based on Directional Search , 1998, KR.