Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan

In most real-world reasoning problems, planning and scheduling phases are loosely coupled. For example, in project planning, the user comes up with a task list and schedules it with a scheduling tool like Microsoft Project. One can view automated planning in a similar way in which there is an action selection phase where actions are selected and ordered to reach the desired goals, and a resource allocation phase where enough resources are assigned to ensure the successful execution of the chosen actions. On the other hand, most existing automated planners studied in Artificial Intelligence do not exploit this loose-coupling and perform both action selection and resource assignment employing the same algorithm. The current work shows that the above strategy severely curtails the scale-up potential of existing state of the art planners which can be overcome by leveraging the loose coupling. Specifically, a novel planning framework called RealPlan is developed in which resource allocation is de-coupled from planning and is handled in a separate scheduling phase. The scheduling problem with discrete resources is represented as a Constraint Satisfaction Problem (CSP) problem, and the planner and scheduler interact either in a master-slave manner or in a peer-peer relationship. In the former, the scheduler simply tries to assign resources to the abstract causal plan passed to it by the planner and returns success. In the latter, a more sophisticated i°multi-module dependency directed backtrackingi± approach is used where the failure explanation in the scheduler is translated back to the planner and serves as a nogood to direct planner search. RealPlan not only preserves both the correctness as well as the quality (measured in length) of the plan but also improves efficiency. Moreover, the failure-driven learning of constraints can serve as an elegant and effective approach for integrating planning and scheduling systems. Beyond the context of planner efficiency, the current work can be viewed as an important step towards merging planning with real-world problem solving where plan failure during execution can be resolved by undertaking only necessary resource re-allocation and not complete re-planning.

[1]  Craig A. Knoblock Generating Parallel Execution Plans with a Partial-order Planner , 1994, AIPS.

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

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

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

[5]  Daniel S. Weld,et al.  The LPSAT System and its Application to Resource Planning , 1999, International Joint Conference on Artificial Intelligence.

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

[7]  Eugene Fink,et al.  Formalizing Plan Justifications , 1992 .

[8]  Joseph J. Moder,et al.  Project Management with CPM and PERT , 1964 .

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

[10]  A. El-Kholy,et al.  Temporal and Resource Reasoning in Planning: the parcPLAN approach , 1996, ECAI.

[11]  David E. Wilkins,et al.  Practical planning - extending the classical AI planning paradigm , 1989, Morgan Kaufmann series in representation and reasoning.

[12]  Subbarao Kambhampati,et al.  Efficient planning by effective resource reasoning , 2000 .

[13]  Maria Fox,et al.  The Automatic Inference of State Invariants in TIM , 1998, J. Artif. Intell. Res..

[14]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[15]  Nicola Muscettola,et al.  Toward Real-World Science Mission Planning , 1994 .

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

[17]  Rina Dechter,et al.  Dead-End Driven Learning , 1994, AAAI.

[18]  Peter J. Stuckey,et al.  Solving linear arithmetic constraints for user interface applications , 1997, UIST '97.

[19]  Patrick Prosser,et al.  Domain Filtering can Degrade Intelligent Backtracking Search , 1993, IJCAI.

[20]  Qiang Yang Formalizing Plan Justiications , 1992 .

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

[22]  Austin Tate,et al.  O-Plan: The open Planning Architecture , 1991, Artif. Intell..

[23]  Norman Sadeh,et al.  A Blackboard Architecture for Integrating Process Planning and Production Scheduling , 1998 .

[24]  Subbarao Kambhampati,et al.  Scaling up Planning by Teasing out Resource Scheduling , 1999, ECP.

[25]  Subbarao Kambhampati,et al.  Integrating general purpose planners and specialized reasoners: case study of a hybrid planning architecture , 1993, IEEE Trans. Syst. Man Cybern..

[26]  Craig A. Knoblock Automatically Generating Abstractions for Planning , 1994, Artif. Intell..

[27]  Makoto Yokoo,et al.  Distributed constraint satisfaction algorithm for complex local problems , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

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

[29]  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 .

[30]  Biplav Srivastava,et al.  RealPlan: Decoupling Causal and Resource Reasoning in Planning , 2000, AAAI/IAAI.

[31]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[32]  Christer Bäckström Computational Aspects of Reordering Plans , 1998, J. Artif. Intell. Res..

[33]  Brian Falkenhainer,et al.  Dynamic Constraint Satisfaction Problems , 1990, AAAI.

[34]  Amedeo Cesta,et al.  A Time and Resource Problem for Planning Architectures , 1997, ECP.

[35]  Subbarao Kambhampati,et al.  Solving Planning-Graph by Compiling It into CSP , 2000, AIPS.

[36]  Barry Richards,et al.  Scaleability in Planning , 1999, ECP.

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

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

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

[40]  Subbarao Kambhampati,et al.  Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan , 2000, J. Artif. Intell. Res..

[41]  Subbarao Kambhampati,et al.  Hybrid Planning for Partially Hierarchical Domains , 1998, AAAI/IAAI.

[42]  Peter van Beek,et al.  CPlan: A Constraint Programming Approach to Planning , 1999, AAAI/IAAI.

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

[44]  Subbarao Kambhampati,et al.  On the Relations Between Intelligent Backtracking and Failure-Driven Explanation-Based Learning in Constraint Satisfaction and Planning , 1998, Artif. Intell..

[45]  Subbarao Kambhampati,et al.  Understanding and Extending Graphplan , 1997, ECP.

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

[47]  Bernhard Nebel,et al.  Ignoring Irrelevant Facts and Operators in Plan Generation , 1997, ECP.

[48]  Henry A. Kautz,et al.  BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving , 1998 .

[49]  Edmund H. Durfee,et al.  Development of Iterative Real-time Scheduler to Planner Feedback , 1997, IJCAI.

[50]  Maria Fox,et al.  The Detection and Exploitation of Symmetry in Planning Problems , 1999, IJCAI.

[51]  S. Kambhampati,et al.  Universal classical planner: an algorithm for unifying state-space and plan-space planning , 1996 .