Some results and experiments in programming techniques for propositional logic
Computers and Operations Research - Special issue: Applications of integer programming
A quantitative approach to logical inference
Decision Support Systems
Fast planning through planning graph analysis
Artificial Intelligence
Control strategies in HTN planning: theory versus practice
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of 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
Ten challenges in propositional reasoning and search
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
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
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
Petriplan: A New Algorithm for Plan Generation (Preliminary Report)
IBERAMIA-SBIA '00 Proceedings of the International Joint Conference, 7th Ibero-American Conference on AI: Advances in Artificial Intelligence
Temporal Planning through Mixed Integer Programming: A Preliminary Report
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
An LP-based heuristic for optimal planning
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Constraint-based agents: an architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
New methods for proving the impossibility to solve problems through reduction of problem spaces
Annals of Mathematics and Artificial Intelligence
Resource-driven mission-phasing techniques for constrained agents in stochastic environments
Journal of Artificial Intelligence Research
Integrating AI and OR: an industrial engineering perspective
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
Plan b: uncertainty/time trade-offs for linear and integer programming
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Combining static and dynamic models for boosting forward planning
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Optimal interdiction of attack plans
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
A hybrid LP-RPG heuristic for modelling numeric resource flows in planning
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Recent research has shown the promise of using propositional reasoning and search to solve AI planning problems. In this paper, we further explore this area by applying Integer Programming to solve AI planning problems. The application of Integer Programming to AI planning has a potentially significant advantage, as it allows quite naturally for the incorporation of numerical constraints and objectives into the planning domain. Moreover, the application of Integer Programming to AI planning addresses one of the challenges in propositional reasoning posed by Kautz and Selman, who conjectured that the principal technique used to solve Integer Programs--the linear programming (LP) relaxation--is not useful when applied to propositional search. We discuss various IP formulations for the class of planning problems based on STRIPS-style planning operators. Our main objective is to show that a carefully chosen IP formulation significantly improves the "strength" of the LP relaxation, and that the resultant LPs are useful in solving the IP and the associated planning problems. Our results clearly show the importance of choosing the "right" representation, and more generally the promise of using Integer Programming techniques in the AI planning domain.