Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

Integer optimization models of AI planning problems

Published: 01 March 2000 Publication History
  • Get Citation Alerts
  • Abstract

    This paper describes ILP-PLAN, a framework for solving AI planning problems represented as integer linear programs. ILP-PLAN extends the planning as satisfiability framework to handle plans with resources, action costs, and complex objective functions. We show that challenging planning problems can be effectively solved using both traditional branch-and-bound integer programming solvers and efficient new integer local search algorithms. ILP-PLAN can find better quality solutions for a set of hard benchmark logistics planning problems than had been found by any earlier system.

    References

    [1]
    Anderson, C, Smith, D and Weld, D, 1998. "Conditional effects in Graphplan" Proceedings Fourth International Conference on AI Planning Systems (AIPS-98) Pittsburgh, PA.
    [2]
    Blum, A and Furst, M, 1995. "Fast planning through graph analysis" Proceedings Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95) Montreal, Canada.
    [3]
    Bockmayr, A and Dimopoulos, D, 1998. "Mixed integer programming models for planning problems" Working Notes of the CP-98 Constraint Problem Reformulation Workshop Pisa, Italy.
    [4]
    Bonet, B, Loerincs, G and Geffner, H, 1997. "A robust and fast action selection mechanism for planning" Proceedings Fourteenth National Conference on Artificial Intelligence (AAAI-97) Providence, RI, 714-719.
    [5]
    Bylander, T, 1991. "Complexity results for planning" Proceedings Twelfth International Joint Conference on Artificial Intelligence (IJCAI-91) Sydney, Australia, 274-279.
    [6]
    El-Kholy, A and Richards, B, 1996. "Temporal and resource reasoning in planning: the parcPLAN approach" Proceedings Third International Conference on AI Planning Systems (AIPS-96) Edinburgh.
    [7]
    Ernst, M, Millstein, T and Weld, D, 1997. "Automatic SAT-compilation of planning problems" Proceedings Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-95) Nagoya, Japan.
    [8]
    Fikes, R and Nilsson, N, 1971. "Strips: A new approach to the application of theorem proving to problem solving" Artificial Intelligence 2(3/4).
    [9]
    Fourer, R and Gay, DM, 1994. "Large scale optimization: State of the art" in Hager, W, Hearn, D and Pardalos, P (eds.), Experience with a Primal Presolve Algorithm Kluwer, 135-154.
    [10]
    Fourer, R, Gay, DM and Kernighan, BW, 1993. AMPL, A Modeling Language for Mathematical Programming Boyd & Fraser.
    [11]
    Gazen, B and Knoblock, C, 1994. "Combining the expressivity of UCPOP with the effciency of Graphplan" in Steel S (ed.), Proceedings Fourth European Conference on Planning Springer-Verlag, LNAI, 1248.
    [12]
    Giunchiglia, E, Massarotto, A and Sebastiani, R, 1998, "Act, and the rest will follow: Exploiting determinism in planning as satisfiability" Proceedings Fifteenth National Conference on Artificial Intelligence (AAAI-98).
    [13]
    Green, C, 1969. "Application of theorem proving to problem solving" in Bajcsy, R (ed.), Proceedings International Joint Conference on Artificial Intelligence (IJCAI-69) Washington, DC.
    [14]
    Hass, A, 1987. "The case for domain-specific frame axioms" in Brown, F and Lawrence, K (eds.), The Frame Problem in Artificial Intelligence, Proceedings of the 1987 Workshop Morgan Kaufmann, Los Altos, CA.
    [15]
    Hooker, J and Osorio, M, 1999. "Mixed logical/linear programming" Discrete Applied Mathematics 96-97 395-442.
    [16]
    Hooker, J, 1988. "A quantitative approach to logical inference" Decision Support Systems 4 45-69.
    [17]
    Kambhampati, S, Lambrecht, E and Parker, E, 1997. "Understanding and extending Graphplan" in Steel, S (ed.), Proceedings Fourth European Conference on Planning Springer-Verlag, 1248.
    [18]
    Kautz, H and Selman, B, 1992. "Planning as satisfiability" Proceedings Tenth European Conference on Artificial Intelligence (ECAI'92) Vienna, Austria.
    [19]
    Kautz, H and Selman, B, 1996. "Pushing the envelope: Planning, propositional logic, and stochastic search" Proceedings Thirteenth National Conference on Artificial Intelligence (AAAI-96) Portland, OR, 1194-1201.
    [20]
    Kautz, H and Selman, B, 1998. "The role of domain-specific knowledge in the planning as satisfiability framework" Proceedings Fourth International Conference on AI Planning Systems (AIPS-98) Pittsburgh, PA.
    [21]
    Kautz, H, McAllester, D and Selman, B, 1996. "Encoding plans in propositional logic" Principles of Knowledge Representation and Reasoning: Proceedings of the Fifth International Conference (KR'96) Cambridge, MA.
    [22]
    Koehler, J, Nebel, B, Hoffmann, J and Dimopoulos, Y, 1997. "Extending planning graphs to an ADL subset" in Steel, S (ed.), Proceedings Fourth European Conference on Planning Springer-Verlag, LNAI, 1248.
    [23]
    Koehler, J. 1998. "Planning under resource constraints" Proceedings Thirteen European Conference on Artificial Intelligence (ECAI-98) Brighton, England.
    [24]
    Laborie, P and Ghallab, M, 1995. "Planning with sharable resource constraints" Proceedings Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95) Montreal, Canada.
    [25]
    Mali, A and Kambhampati, S, 1998. "Encoding htn planning in propositional logic" Proceedings Fourth International Conference on AI Planning Systems (AIPS-98) Pittsburg, PA.
    [26]
    Muscettola, N, Nayak, PR, Pell, B and Williams, BC, 1988. "Remote agent: To boldly go where no AI system has gone before" Artificial Intelligence 103 (1/2).
    [27]
    Pednault, E, 1989. "ADL: Exploring the middle ground between strips and the situation calculus" Proceedings First International Conference on Principles of Knowledge Representation and Reasoning (KR'89) Toronto, Canada, 324-332.
    [28]
    Penberthy, J and Weld, D, 1992. "UCPOP: A sound, complete partial order planner for ADL" Proceedings of the Third International Conference on Knowledge Representation and Reasoning (KR'92) Boston, MA, 108- 114.
    [29]
    Penberthy, J and Weld, D, 1994. "Temporal planning with continuous change" Proceedings Twelfth National Conference on Artificial Intelligence (AAAI-94) Seattle, WA, 1010-1015.
    [30]
    Schubert, L, 1989. "Monotonic solution of the frame problem in the situation calculus: an efficient method for worlds with fully specified actions" in Kyburg, H, Loui, R and Carlson, G (eds.), Knowledge Representation and Defeasible Reasoning Kluwer, Boston.
    [31]
    Selman, B and Kautz, H, 1993. "Domain-independent extensions to GSAT: Solving large structured satisfiability problems" Proceedings Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93) Chambery, France.
    [32]
    Selman, B, Kautz, H and Cohen, B, 1994. "Noise strategies for improving local search" Proceedings Twelfth National Conference on Artificial Intelligence (AAAI-94) Seattle, WA, 337-343.
    [33]
    Tate, A, 1996. "Representing plans as a set of constraints - the I-N-OVA model" Proceedings Third International Conference on AI Planning Systems (AIPS-96) Edinburgh.
    [34]
    Veloso, M, 1992. "Learning by analogical reasoning in general problem solving" PhD Dissertation, CMU.
    [35]
    Vossen, T, Ball, M, Lotem, A and Nau, D, 1999. "On the use of integer programming models in AI planning" Proceedings Sixteenth National Conference on Artificial Intelligence (AAAI-99) Orlando, FL.
    [36]
    Walser, J, 1997. "Solving linear pseudo-boolean constraint problems with local search" Proceedings Fourteenth National Conference on Artificial Intelligence (AAAI-97) Providence, RI.
    [37]
    Walser, JP, 1999. Integer Optimization by Local Search, A Domain-Independent Approach. Springer-Verlag, Lecture Notes in Artificial Intelligence.
    [38]
    Weld, D, 1999. "Recent advances in AI planning" AI Magazine 20(2).
    [39]
    Wolfman, SA and Weld, DS, 2000. "Combining linear programming and satisfiability solving for resource planning" The Knowledge Engineering Review (this issue).

    Cited By

    View all
    • (2013)A hybrid LP-RPG heuristic for modelling numeric resource flows in planningJournal of Artificial Intelligence Research10.5555/2512538.251254846:1(343-412)Online publication date: 1-Jan-2013
    • (2012)Combining static and dynamic models for boosting forward planningProceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems10.1007/978-3-642-29828-8_21(322-338)Online publication date: 28-May-2012
    • (2010)Resource-driven mission-phasing techniques for constrained agents in stochastic environmentsJournal of Artificial Intelligence Research10.5555/1892211.189222238:1(415-473)Online publication date: 1-May-2010
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image The Knowledge Engineering Review
    The Knowledge Engineering Review  Volume 15, Issue 1
    March 2000
    115 pages

    Publisher

    Cambridge University Press

    United States

    Publication History

    Published: 01 March 2000

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0

    Other Metrics

    Citations

    Cited By

    View all
    • (2013)A hybrid LP-RPG heuristic for modelling numeric resource flows in planningJournal of Artificial Intelligence Research10.5555/2512538.251254846:1(343-412)Online publication date: 1-Jan-2013
    • (2012)Combining static and dynamic models for boosting forward planningProceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems10.1007/978-3-642-29828-8_21(322-338)Online publication date: 28-May-2012
    • (2010)Resource-driven mission-phasing techniques for constrained agents in stochastic environmentsJournal of Artificial Intelligence Research10.5555/1892211.189222238:1(415-473)Online publication date: 1-May-2010
    • (2008)A hybrid relaxed planning graph-LP heuristic for numeric planning domainsProceedings of the Eighteenth International Conference on International Conference on Automated Planning and Scheduling10.5555/3037281.3037289(52-59)Online publication date: 14-Sep-2008
    • (2008)Lessons Learned Delivering Optimized Supply‐Chain Planning to the Business WorldAI Magazine10.1609/aimag.v29i2.210729:2(51-56)Online publication date: 1-Jun-2008
    • (2007)Long-distance mutual exclusion for propositional planningProceedings of the 20th international joint conference on Artifical intelligence10.5555/1625275.1625573(1840-1845)Online publication date: 6-Jan-2007
    • (2007)Sequential resource allocation in multiagent systems with uncertaintiesProceedings of the 6th international joint conference on Autonomous agents and multiagent systems10.1145/1329125.1329265(1-8)Online publication date: 14-May-2007
    • (2006)Temporal planning using subgoal partitioning and resolution in SGPlanJournal of Artificial Intelligence Research10.5555/1622559.162256826:1(323-369)Online publication date: 1-Aug-2006
    • (2006)Constraint partitioning in penalty formulations for solving temporal planning problemsArtificial Intelligence10.5555/1141151.1644640170:3(187-231)Online publication date: 1-Mar-2006
    • (2005)Automated resource-driven mission phasing techniques for constrained agentsProceedings of the fourth international joint conference on Autonomous agents and multiagent systems10.1145/1082473.1082524(331-338)Online publication date: 25-Jul-2005
    • Show More Cited By

    View Options

    View options

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media