Bridging the gap between planning and scheduling

Planning research in Artificial Intelligence (AI) has often focused on problems where there are cascading levels of action choice and complex interactions between actions. In contrast, scheduling research has focused on much larger problems where there is little action choice, but the resulting ordering problem is hard. In this paper, we give an overview of AI planning and scheduling techniques, focusing on their similarities, differences, and limitations. We also argue that many difficult practical problems lie somewhere between planning and scheduling, and that neither area has the right set of tools for solving these vexing problems.

[1]  Steve Hanks,et al.  Optimal Planning with a Goal-directed Utility Model , 1994, AIPS.

[2]  Malik Ghallab,et al.  Representation and Control in IxTeT, a Temporal Planner , 1994, AIPS.

[3]  Subbarao Kambhampati,et al.  Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial-Order Planning , 1995, Artif. Intell..

[4]  Nicola Muscettola,et al.  Planning in Interplanetary Space: Theory and Practice , 2000, AIPS.

[5]  Toby Walsh,et al.  Local Search and the Number of Solutions , 1996, CP.

[6]  James F. Allen,et al.  Planning Using a Temporal World Model , 1983, IJCAI.

[7]  Philippe Baptiste,et al.  Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems , 1999, Ann. Oper. Res..

[8]  Matthew L. Ginsberg,et al.  Approximate Planning , 1995, Artif. Intell..

[9]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[10]  Norman Sadeh,et al.  MICRO-OPPORTUNISTIC SCHEDULING THE MICRO-BOSS FACTORY SCHEDULER , 1994 .

[11]  Paolo Traverso,et al.  Hierarchical Task Network Planning , 2004 .

[12]  James A. Hendler,et al.  A Validation-Structure-Based Theory of Plan Modification and Reuse , 1992, Artif. Intell..

[13]  David A. McAllester,et al.  Systematic Nonlinear Planning , 1991, AAAI.

[14]  Rina Dechter,et al.  In Search of the Best Constraint Satisfaction Search , 1994, AAAI.

[15]  H. Van Dyke Parunak.  Book review: Intelligent Scheduling by M. Zweben and M. S. Fox (Morgan Kaufmann, 1994) , 1995 .

[16]  Michael D. Ernst,et al.  Automatic SAT-Compilation of Planning Problems , 1997, IJCAI.

[17]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[18]  Barbara M. Smith,et al.  Trying Harder to Fail First , 1998, ECAI.

[19]  Benjamin W. Wah,et al.  Discrete Lagrangian-Based Search for Solving MAX-SAT Problems , 1997, IJCAI.

[20]  Christian Bessiere,et al.  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.

[21]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[22]  Austin Tate,et al.  O Plan an Open Architecture for Command Planning and Control , 2006 .

[23]  Malik Ghallab,et al.  Planning with Sharable Resource Constraints , 1995, IJCAI.

[24]  David E. Wilkins,et al.  Can AI planners solve practical problems? , 1990, Comput. Intell..

[25]  Eugene C. Freuder,et al.  Neighborhood Inverse Consistency Preprocessing , 1996, AAAI/IAAI, Vol. 1.

[26]  Henry Kautz,et al.  Noise Strategies for Local Search , 1994, AAAI 1994.

[27]  Amedeo Cesta,et al.  Recent Advances in AI Planning , 1997, Lecture Notes in Computer Science.

[28]  P. Langley.  Systematic and nonsystematic search strategies , 1992 .

[29]  John L. Bresina,et al.  Just-In-Case Scheduling , 1994, AAAI.

[30]  Craig Boutilier,et al.  Decision-Theoretic Planning: Structural Assumptions and Computational Leverage , 1999, J. Artif. Intell. Res..

[31]  Nicholas Kushmerick,et al.  An Algorithm for Probabilistic Planning , 1995, Artif. Intell..

[32]  Michael R. Genesereth,et al.  Logical foundations of artificial intelligence , 1987 .

[33]  P. Brucker,et al.  Tabu Search Algorithms and Lower Bounds for the Resource-Constrained Project Scheduling Problem , 1999 .

[34]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[35]  David E. Smith,et al.  Conformant Graphplan , 1998, AAAI/IAAI.

[36]  Nicola Muscettola,et al.  HSTS: Integrating Planning and Scheduling , 1993 .

[37]  Peter Haddawy,et al.  Utility Models for Goal‐Directed, Decision‐Theoretic Planners , 1998, Comput. Intell..

[38]  J. Penberthy.  Planning with continuous change , 1993 .

[39]  Ross D. Shachter,et al.  Decision-theoretic planning , 1998 .

[40]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[41]  Robert P. Goldman,et al.  Conditional Linear Planning , 1994, AIPS.

[42]  Matthew L. Ginsberg,et al.  Essentials of Artificial Intelligence , 2012 .

[43]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[44]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

[45]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[46]  Bernhard Nebel,et al.  Extending Planning Graphs to an ADL Subset , 1997, ECP.

[47]  Bart Selman,et al.  Encoding Plans in Propositional Logic , 1996, KR.

[48]  S. Hanks,et al.  A value-directed approach to planning , 1996 .

[49]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[50]  Mark S. Fox,et al.  Intelligent Scheduling , 1998 .

[51]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[52]  John L. Bresina,et al.  Heuristic-Biased Stochastic Sampling , 1996, AAAI/IAAI, Vol. 1.

[53]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[54]  Martha E. Pollack,et al.  Is "Early Commitment" in Plan Generation Ever a Good Idea? , 1996, AAAI/IAAI, Vol. 2.

[55]  Mark A. Peot,et al.  Conditional nonlinear planning , 1992 .

[56]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[57]  Yee Whye Teh,et al.  Making Forward Chaining Relevant , 1998, AIPS.

[58]  Rina Dechter,et al.  Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems , 1994, Artif. Intell..

[59]  James M. Crawford,et al.  Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems , 1994, AAAI.

[60]  W. D. Harvey,et al.  Nonsystematic backtracking search , 1995 .

[61]  Keith Golden,et al.  Leap Before You Look: Information Gathering in the PUCCINI Planner , 1998, AIPS.

[62]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[63]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[64]  Leslie Pack Kaelbling,et al.  Planning under Time Constraints in Stochastic Domains , 1993, Artif. Intell..

[65]  Daniel P. Miranker,et al.  A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem , 1996, AAAI/IAAI, Vol. 1.

[66]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[67]  Oren Etzioni,et al.  An Approach to Planning with Incomplete Information , 1992, KR.

[68]  Bernard A. Nadel,et al.  Constraint satisfaction algorithms 1 , 1989, Comput. Intell..

[69]  Matthew L. Ginsberg,et al.  Procedural Reasoning in Constraint Satisfaction , 1998, KR.

[70]  Steven A. Vere,et al.  Planning in Time: Windows and Durations for Activities and Goals , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[71]  Keith Golden,et al.  Representing Sensing Actions: The Middle Ground Revisited , 1996, KR.

[72]  Nicola Muscettola,et al.  Next Generation Remote Agent Planner , 1999 .

[73]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[74]  Kutluhan Erol,et al.  Hierarchical task network planning: formalization, analysis, and implementation , 1996 .

[75]  Jeremy Frank,et al.  Weighting for Godot: Learning Heuristics for GSAT , 1996, AAAI/IAAI, Vol. 1.

[76]  David E. Smith,et al.  Temporal Planning with Mutual Exclusion Reasoning , 1999, IJCAI.

[77]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[78]  Austin Tate,et al.  The Use of Optimistic and Pessimistic Resource Profiles to Inform Search in an Activity Based Planner , 1994, AIPS.

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

[80]  Martha E. Pollack,et al.  Passive and active decision postponement in plan generation , 1996 .

[81]  Brian Drabble,et al.  EXCALIBUR: A Program for Planning and Reasoning with Processes , 1993, Artif. Intell..

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

[83]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[84]  Toby Walsh,et al.  An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem , 1996, CP.

[85]  P. Pandurang Nayak,et al.  Remote Agent: To Boldly Go Where No AI System Has Gone Before , 1998, Artif. Intell..

[86]  Fahiem Bacchus,et al.  Dynamic Variable Ordering in CSPs , 1995, CP.

[87]  V. S. Subrahmanian,et al.  Complexity, Decidability and Undecidability Results for Domain-Independent Planning , 1995, Artif. Intell..

[88]  Qiang Yang,et al.  Formalizing planning knowledge for hierarchical planning , 1990, Comput. Intell..

[89]  Dana S. Nau,et al.  Semantics for hierarchical task-network planning , 1994 .

[90]  Blai Bonet.  Functional Strips: a More General Language for Planning and Problem Solving (preliminary Version) , 1999 .

[91]  Mark A. Peot,et al.  Threat-Removal Strategies for Partial-Order Planning , 1993, AAAI.

[92]  Daniel S. Weld,et al.  Combining linear programming and satisfiability solving for resource planning , 2001, The Knowledge Engineering Review.

[93]  Craig A. Knoblock,et al.  Combining the Expressivity of UCPOP with the Efficiency of Graphplan , 1997, ECP.

[94]  David E. Smith,et al.  Extending Graphplan to handle uncertainty and sensing actions , 1998, AAAI 1998.

[95]  Eugene C. Freuder.  Complexity of K-Tree Structured Constraint Satisfaction Problems , 1990, AAAI.

[96]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[97]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[98]  Jeremy Frank,et al.  Satellite Tele-Communications Scheduling as Dynamic Constraint Satisfaction , 1999 .

[99]  Byungki Cha,et al.  Performance Test of Local Search Algorithms Using New Types of Random CNF Formulas , 1995, IJCAI.

[100]  J. Christopher Beck,et al.  This Is a Publication of the American Association for Artificial Intelligence Constraint-directed Search the Constraint-satisfaction Problem a Generic Framework for Constraint-directed Search and Scheduling Why Constraints? , 2022 .

[101]  Subbarao Kambhampati,et al.  Planning and Scheduling , 1997, The Computer Science and Engineering Handbook.

[102]  Jeremy Frank,et al.  When Gravity Fails: Local Search Topology , 1997, J. Artif. Intell. Res..

[103]  David E. Smith,et al.  Conditional Effects in Graphplan , 1998, AIPS.

[104]  L. R. Ford,et al.  NETWORK FLOW THEORY , 1956 .

[105]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[106]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[107]  James F. Allen.  Towards a General Theory of Action and Time , 1984, Artif. Intell..

[108]  James A. Hendler,et al.  Planning: What it is, What it could be, An Introduction to the Special Issue on Planning and Scheduling , 1995, Artif. Intell..

[109]  James A. Hendler,et al.  Readings in Planning , 1994 .

[110]  David E. Smith,et al.  Extending Graphplan to Handle Uncertainty & Sensing Actions , 1998, AAAI/IAAI.

[111]  Daniel S. Weld,et al.  Probabilistic Planning with Information Gathering and Contingent Execution , 1994, AIPS.

[112]  Austin Tate,et al.  O-Plan2: an Open Architecture for Command, Planning and Control , 2006 .

[113]  Chu Min Li,et al.  Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.

[114]  Drew McDermott,et al.  The 1998 AI Planning Systems Competition , 2000, AI Mag..

[115]  Hector Muñoz-Avila,et al.  SHOP: Simple Hierarchical Ordered Planner , 1999, IJCAI.

[116]  James F. Allen,et al.  TRAINS-95: Towards a Mixed-Initiative Planning Assistant , 1996, AIPS.

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

[118]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[119]  Matthew L. Ginsberg,et al.  Combining satisfiability techniques from AI and OR , 2000, The Knowledge Engineering Review.

[120]  Gregg Collins,et al.  Planning for Contingencies: A Decision-based Approach , 1996, J. Artif. Intell. Res..

[121]  J. Christopher Beck,et al.  Texture-Based Heuristics for Scheduling Revisited , 1997, AAAI/IAAI.

[122]  Austin Tate,et al.  Generating Project Networks , 1977, IJCAI.

[123]  Stephen F. Smith,et al.  Slack-Based Heuristics for Constraint Satisfaction Scheduling , 1993, AAAI.

[124]  Toby Walsh,et al.  Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.

[125]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[126]  Satyandra K. Gupta,et al.  AI Planning Versus Manufacturing-Operation Planning: A Case Study , 1995, IJCAI.

[127]  Eugene C. Freuder,et al.  Understanding and Improving the MAC Algorithm , 1997, CP.

[128]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[129]  Blai Bonet,et al.  Planning as Heuristic Search: New Results , 1999, ECP.

[130]  Craig Boutilier,et al.  Abstraction and Approximate Decision-Theoretic Planning , 1997, Artif. Intell..

[131]  Jim Blythe,et al.  Decision-Theoretic Planning , 1999, AI Mag..

[132]  John Langford,et al.  Probabilistic Planning in the Graphplan Framework , 1999, ECP.

[133]  Daniel S. Weld,et al.  Temporal Planning with Continuous Change , 1994, AAAI.

[134]  Daniel S. Weld.  An Introduction to Least Commitment Planning , 1994, AI Mag..

[135]  JRmes M. Crawford.  An Approach to Resource Constrained Project Scheduling , 1996 .

[136]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[137]  Jana Koehler,et al.  Planning under Resource Constraints , 1998, ECAI.