A new polynomial-time algorithm for linear programming
Combinatorica
A quantitative approach to logical inference
Decision Support Systems
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
State-space planning by integer optimization
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Use of Integer Programming Models in AI Planning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
The LPSAT Engine & Its Application to Resource Planning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Encoding Planning Problems in Nonmonotonic Logic Programs
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Integer Programs and Valid Inequalities for Planning Problems
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
INFORMS Journal on Computing
Solving Real-World Linear Programs: A Decade and More of Progress
Operations Research
Planning as satisfiability: parallel plans and algorithms for plan search
Artificial Intelligence
Factored planning: how, when, and when not
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Optiplan: unifying IP-based and graph-based planning
Journal of Artificial Intelligence Research
The fast downward planning system
Journal of Artificial Intelligence Research
Planning with goal utility dependencies
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
An LP-based heuristic for optimal planning
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A linear programming heuristic for optimal planning
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Experimental evaluation of pheromone models in ACOPlan
Annals of Mathematics and Artificial Intelligence
A hybrid LP-RPG heuristic for modelling numeric resource flows in planning
Journal of Artificial Intelligence Research
Planning as satisfiability with IPC simple preferences and action costs
AI Communications
Hi-index | 0.00 |
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes correspond to the state variable values and the network arcs correspond to the value transitions. The planning problem is to find a path (a sequence of actions) in each network such that, when merged, they constitute a feasible plan. In this paper we present a number of integer programming formulations that model these loosely coupled networks with varying degrees of flexibility. Since merging may introduce exponentially many ordering constraints we implement a so-called branch-and-cut algorithm, in which these constraints are dynamically generated and added to the formulation when needed. Our results are very promising, they improve upon previous planning as integer programming approaches and lay the foundation for integer programming approaches for cost optimal planning.