This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IPSS: A Hybrid Approach to Planning and Scheduling Integration
December 2006 (vol. 18 no. 12)
pp. 1681-1695
Recently, the areas of planning and scheduling in Artificial Intelligence (AI) have witnessed a big push toward their integration in order to solve complex problems. These problems require both reasoning on which actions are to be performed as well as their precedence constraints (planning) and the reasoning with respect to temporal constraints (e.g., duration, precedence, and deadline); those actions should satisfy the resources they use (scheduling). This paper describes ipss (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI planner that synthesizes courses of actions with constraint-based techniques that reason based upon time and resources. ipss is able to manage not only simple precedence constraints, but also more complex temporal requirements (as the Allen primitives) and multicapacity resource usage/consumption. The solver is evaluated against a set of problems characterized by the use of multiple agents (or multiple resources) that have to perform tasks with some temporal restrictions in the order of the tasks or some constraints in the availability of the resources. Experiments show how the integrated reasoning approach improves plan parallelism and gains better makespans than some state-of-the-art planners where multiple agents are represented as additional fluents in the problem operators. It also shows that ipss is suitable for solving real domains (i.e., workflow problems) because it is able to impose temporal windows on the goals or set a maximum makespan, features that most of the planners do not yet incorporate.

[1] R. Aler and D. Borrajo, Learning Single-Criteria Control Knowledge for Multi-Criteria Planning, pp. 35-40, 2002.
[2] F. Bacchus and F. Kabanza, “Using Temporal Logics to Express Search Control Knowledge for Planning,” Artificial Intelligence, vol. 16, pp. 123-191, 2000.
[3] C. Bäckström, “Computational Aspects of Reordering Plans,” J.Artificial Intelligence Research, vol. 9, pp. 99-137, 1998.
[4] A. Blum and M. Furst, “Fast Planning through Planning Graph Analysis,” Artificial Intelligence, vol. 90, pp. 281-300, 1997.
[5] B. Bonet and H. Geffner, “Planning as Heuristic Search,” Artificial Intelligence, vol. 129, nos. 1-2, pp. 5-33, 2001.
[6] D. Borrajo, S. Vegas, and M. Veloso, “Quality-Based Learning for Planning,” Working Notes of the IJCAI'01 Workshop on Planning with Resources, 2001.
[7] R. Cervoni, A. Cesta, and A. Oddi, “Managing Dynamic Temporal Constraint Networks,” Proc. Second Int'l Conf. Artificial Intelligence Planning Systems (AIPS '94), 1994.
[8] A. Cesta and A. Oddi, “Gaining Efficiency and Flexibility in the Simple Temporal Problem,” Proc. Third Int'l Conf. Temporal Representation and Reasoning (TIME '96), 1996.
[9] A. Cesta, A. Oddi, and S.F. Smith, “Profile Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems,” Proc. Fourth Int'l Conf. Artificial Intelligence Planning Systems (AIPS '98), 1998.
[10] A. Cesta, A. Oddi, and S.F. Smith, “A Constrained-Based Method for Project Scheduling with Time Windows,” J. Heuristics, vol. 8, pp. 109-136, 2002.
[11] A. Cesta and F. Pecora, “The RoboCare Project: Multi-Agent Systems for the Care of the Elderly,” European Research Consortium for Informatics and Math. (ERCIM) News No. 53, 2003.
[12] A. Cesta, F. Pecora, and R. Rasconi, “Biasing the Structure of Scheduling Problems through Classical Planners,” Proc. Workshop Integrating Planning into Scheduling, 2004.
[13] R. Dechter, I. Meiri, and J. Pearl, “Temporal Constraint Networks,” Artificial Intelligence, vol. 49, pp. 61-95, 1991.
[14] M.B. Do and S. Kambhampati, J. Artificial Intelligence Research, vol. 20, pp. 155-194, 2003.
[15] S. Edelkamp and M. Helmert, “On the Implementation of MIPS,” Proc. AIPS Workshop Model-Theoretic Approaches to Planning, 2000.
[16] R. Fikes and N. Nilsson, “strips: A New Approach to the Application of Theorem Proving to Problem Solving,” Artificial Intelligence, vol. 2, pp. 189-208, 1971.
[17] E. Fink and J. Blythe, “Prodigy Bidirectional Planning,” J.Experimental & Theoretical Artificial Intelligence, vol. 17, no. 3, pp. 161-200, Sept. 2005.
[18] A. Garrido, E. Onaindía, and F. Barber, “Time-Optimal Planning in Temporal Problems,” Proc. European Conf. Planning (ECP '01), pp. 397-402, 2001.
[19] A. Gerevini and D. Long, “Plan Constraints and Preferences in PDDL3. The Language of the Fifth International Planning Competition,” technical report, Dept. of Electronics for Automation, Univ. of Brescia, Italy, 2005.
[20] A. Gerevini, A. Saetti, and I. Serina, “Planning through Stochastic Local Search and Temporal Action Graphs,” J. Artificial Intelligence Research, vol. 20, pp. 239-290, 2003.
[21] M. Ghallab and H. Laruelle, “Representation and Control in IxTeT, a Temporal Planner,” Proc. Second Int'l Conf. AI Planning Systems (AIPS '94), 1994.
[22] K. Halsey, D. Long, and M. Fox, “crikey—A Temporal Planner Looking at the Integration of Scheduling and Planning,” Proc. Workshop Integrating Planning into Scheduling, 2004.
[23] J. Hoffmann, ”Where Ignoring Delete Lists Works: Local Search Topology in Planning Benchmarks,” Technical Report No. 185, Institut für Informatik, 2003.
[24] P. Laborie and M. Ghallab, “Planning with Sharable Resource Constraints,” Proc. Int'l Joint Conf. Artificial Intelligence (IJCAI '95), 1995.
[25] M. Magnusson, Domain Knowledge in TALplanner. PhD thesis, LiTH-IDA-Ex-02/104, 2003.
[26] U. Montanari, “Networks of Constraints: Fundamental Properties and Applications to Picture Processing,” Information Sciences, vol. 7, pp. 95-132, 1974.
[27] N. Muscettola, S.F. Smith, A. Cesta, and D. D'Aloisi, “Coordinating Space Telescope Operations in an Integrated Planning and Scheduling Architecture,” IEEE Control Systems, vol. 12, pp. 28-37, 1992.
[28] D. Nau, H. Muñoz-Avila, Y. Cao, A. Lotem, and S. Mitchell, “Total-Order Planning with Partially Ordered Subtasks,” Proc. Iint'l Joint Conf. Artificial Intelligence (IJCAI '01), 2001.
[29] J.S. Penberthy and D.S. Weld, “ucpop: A Sound, Complete, Partial Order Planner for adl,” Proc. Int'l Conf. Principles of Knowledge Representation and Reasoning (KR '92), pp. 103-114, 1992.
[30] M.E. Pollack, D. Joslin, and M. Paolucci, “Flaw Selection Strategies for Partial-Order Planning,” J. Artificial Intelligence Research, vol. 6, pp. 223-262, 1997.
[31] M.D. R.-Moreno, “Representing and Planning Tasks with Time and Resources,” PhD thesis, Universidad de Alcalá, 2003.
[32] M.D. R.-Moreno and P. Kearney, “Integrating AI Planning with Workflow Management System,” Int'l J. Knowledge-Based Systems. vol. 15, pp. 285-291, 2002.
[33] M.D. R.-Moreno, A. Oddi, D. Borrajo, A. Cesta, and D. Meziat, “Integrating Hybrid Reasoners for Planning and Scheduling,” Proc. 21st Workshop UK Planning and Scheduling: PLANSIG2002, 2002.
[34] M.D. R.-Moreno, A. Oddi, D. Borrajo, A. Cesta, and D. Meziat, “ipss: Integrating Hybrid Reasoners for Planning and Scheduling,” Proc. 16th European Conf. Artificial Intelligence (ECAI '04), 2004.
[35] S.F. Smith and C. Cheng, “Slack-Based Heuristics for Constraint Satisfaction Scheduling,” Proc. 11th Nat'l Conf. AI (AAAI '93), 1993.
[36] B. Srivastava, R. Kambhampati, and M.B. Do, “Planning the Project Management Way: Efficient Planning by Effective Integration of Causal and Resource Reasoning in RealPlan,” Artificial Intelligence, vol. 131, pp. 73-134, 2001.
[37] M. Veloso, J. Carbonell, A. Pérez, D. Borrajo, E. Fink, and J. Blythe, “Integrating Planning and Learning: The prodigy Architecture,” J. Experimental and Theoretical AI, vol. 7, pp. 81-120, 1995.
[38] M. Veloso, A. Pérez, and J. Carbonell, “Nonlinear Planning with Parallel Resource Allocation,” Proc. DARPA Workshop Innovative Approaches to Planning, Scheduling, and Control, pp. 207-212, 1990.
[39] H.L. Younes and R.G. Simmons, “On the Role of Ground Actions in Refinement Planning,” Proc. Sixth Int'l Conf. Artificial Intelligence Planning and Scheduling Systems, pp. 54-61, 2002.

Index Terms:
Planning, scheduling, temporal reasoning, constraint satisfaction problem.
Citation:
Mar?a Dolores Rodriguez-Moreno, Angelo Oddi, Daniel Borrajo, Amedeo Cesta, "IPSS: A Hybrid Approach to Planning and Scheduling Integration," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 12, pp. 1681-1695, Dec. 2006, doi:10.1109/TKDE.2006.191
Usage of this product signifies your acceptance of the Terms of Use.