An approach to temporal planning and scheduling in domains with predictable exogenous events

Journal of Artificial Intelligence Research

Volumn 25, Issue , 2006, Pages 187-231

  Gerevini, Alfonso ^a   Saetti, Alessandro ^a   Serina, Ivan ^a  

^a UNIVERSITY OF BRESCIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; GRAPH THEORY; PLANNING; REAL TIME SYSTEMS; SCHEDULING; STATISTICAL METHODS;

CPU; REAL-WORLD DOMAINS; TEMPORAL PLANNING;

ARTIFICIAL INTELLIGENCE;

EID: 33744465804     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1742     Document Type: Article

References (46)

1. Armando, A., Castellini, C., Giunchiglia, E., & Maratea, M. (2004). A SAT-based decision procedure for the boolean combination of difference constraints. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT-04), Berlin, Heidelberg, New York. Springer-Verlag. SAT 2004 LNCS Volume.
2. Blum, A., & Furst, M. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90, pp. 281-300.
3. Chen, Y., Hsu, C., & Wah B., W. (2004). SGPlan: Subgoal partitioning and resolution in planning. In Edelkamp, S., Hoffmann, J., Littman, M., & Younes, H. (Eds.), In Abstract Booklet of the Competing Planners of ICAPS-04, pp. 30-32.
4. Cresswell, S., & Coddington, A. (2004). Adapting LPGP to plan with deadlines. In Proceedings of the Sixteenth European Conference on Artificial Intelligence (ECAI-04), pp. 983-984, Amsterdam, The Netherlands. IOS Press.
5. Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49, pp. 61-95.
6. Do, M., B., Kambhampati, S., & Zimmerman, T. (2004). Planning - scheduling connections through exogenous events. In Proceedings of the ICAPS-04 Workshop on Integrating Planning into Scheduling, pp. 32-37.
7. Do, M., & Kambhampati, S. (2003). SAPA: A multi-objective metric temporal planner. Journal of Artificial Intelligence Research (JAIR), 20, pp. 155-194.
8. Edelkamp, S. (2004). Extended critical paths in temporal planning. In Proceedings of the ICAPS-04 Workshop on Integrating Planning into Scheduling, pp. 38-45.
9. Edelkamp, S., & Hoffmann, J. (2004). PDDL2.2: The language for the classic part of the 4th international planning competition. Technical report 195, Institut für Informatik, Freiburg, Germany.
10. Edelkamp, S., Hoffmann, J., Littman, M., & Younes, H. (2004) In Abstract Booklet of the competing planners of ICAPS-04.
11. Erschler, J., Roubellat, F., & Vernhes, J. P. (1976). Finding some essential characteristics of the feasible solutions for a scheduling problem. Operations Research (OR), 24, pp. 772-782.
12. Fox, M., & Long, D. (2003). PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research (JAIR), 20, pp. 61-124.
13. Fox, M., & Long, D. (2005). Planning in time. In Fisher, M., Gabbay, D., & Vila, L. (Eds.), Handbook of Temporal Reasoning in Artificial Intelligence, pp. 497-536. Elsevier Science Publishers, New York, NY, USA.
14. Fox, M., Long, D., & Halsey, K. (2004). An investigation into the expressive power of PDDL2.1. In Proceedings of the Sixteenth European Conference on Artificial Intelligence (ECAI-04), pp. 338-342, Amsterdam, The Netherlands. IOS Press.
15. Frederking, R., E., & Muscettola, N. (1992). Temporal planning for transportation planning and scheduling. In IEEE International Conference on Robotics and Automation (ICRA-92), pp. 1125-1230. IEEE Computer Society Press.
16. Gerevini, A., & Cristani, M. (1997). On finding a solution in temporal constraint satisfaction problems. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), Vol. 2, pp. 1460-1465, San Francisco, CA, USA. Morgan Kaufmann Publishers.
17. Gerevini, A., Saetti, A., & Serina, I. (2003). Planning through stochastic local search and temporal action graphs. Journal of Artificial Intelligence Research (JAIR), 20, pp. 239-290.
18. Gerevini, A., Saetti, A., & Serina, I. (2004). An empirical analysis of some heuristic features for local search in LPG. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS-04), pp. 171-180, Menlo Park, CA, USA. AAAI Press.
19. Gerevini, A., Saetti, A., & Serina, I. (2005a). Integrating planning and temporal reasoning for domains with durations and time windows. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), pp. 1226-1235, Menlo Park, CA, USA. International Joint Conference on Artificial Intelligence Inc.
20. Gerevini, A., Saetti, A., Serina, I., & Toninelli, P. (2005b). Fast planning in domains with derived predicates: An approach based on rule-action graphs and local search. In Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05), pp. 1157-1162, Menlo Park, CA, USA. AAAI Press.
21. Gerevini, A., & Serina, I. (1999). Fast planning through greedy action graphs. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99), pp. 503-510, Menlo Park, CA, USA. AAAI Press/MIT Press.
22. Gerevini, A., & Serina, I. (2000). Fast plan adaptation through planning graphs: Local and systematic search techniques. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS-00), pp. 112-121, Menlo Park, CA, USA. AAAI Press/MIT Press.
23. Ghallab, M., & Laruelle, H. (1994). Representation and control in IxTeT, a temporal planner. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems (AIPS-94), pp. 61-67, Menlo Park, CA, USA. AAAI press.
24. Ghallab, M., Nau, D., & Traverse, P. (2003). Automated Planning: Theory and Practice. Morgan Kaufmann Publishers, San Francisco, CA, USA.
25. Glover, F., & Laguna, M. (1997). Tabu Search. Kluwer Academic Publishers, Boston, USA.
26. Helmert, M. (2004). A planning heuristic based on causal graph analysis. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS-04), pp. 161-170, Menlo Park, CA, USA. AAAI Press.
27. Kavuluri, B. R., & U, S. (2004). Tilsapa - timed initial literals using SAPA. In Edelkamp, S., Hoffmann, J., Littman, M., & Younes, H. (Eds.), In Abstract Booklet of the Competing Planners of ICAPS-04, pp. 46-47.
28. Laborie, P., & Ghallab, M. (1995). Planning with sharable resource constraints. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), Vol. 2, pp. 1643-1651, San Francisco, CA, USA. Morgan Kaufmann Publishers.
29. Long, D., & Fox, M. (2003a). The 3rd international planning competition: Results and analysis. Journal of Artificial Intelligence Research (JAIR), 20, pp. 1-59.
30. Long, D., & Fox, M. (2003b). Exploiting a graphplan framework in temporal planning. In Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling (ICAPS-03), pp. 52-61, Menlo Park, CA, USA. AAAI Press.
31. McAllester, D., & Rosenblitt, D. (1991). Systematic nonlinear planning. In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91), pp. 634-639, Menlo Park, CA, USA. AAAI Press.
32. Muscettola, N. (1994). HSTS: Integrating planning and scheduling. In Zweben, & Fox (Eds.), Intelligent Scheduling, pp. 169-212, San Francisco, CA, USA. Morgan Kaufmann Publishers.
33. Nguyen, X., & Kambhampati, S. (2001). Reviving partial order planning. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01), Vol. 1, pp. 459-464, San Francisco, CA, USA. Morgan Kaufmann Publishers.
34. Penberthy, J., & Weld, D. (1992). UCPOP: A sound, complete, partial order planner for ADL. In Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning (KR'92), pp. 103-114, San Mateo, CA, USA. Morgan Kaufmann Publishers.
35. Penberthy, J., & Weld, D. (1994). Temporal planning with continuous change. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), pp. 1010-1015, Menlo Park, CA, USA. AAAI Press/MIT Press.
36. Penberthy, J., S. (1993). Planning with Continuous Change. Ph.D. thesis, University of Washington, Seattle, WA, USA. Available as technical report UW-CSE-93-12-01.
37. Sanchez, J., Tang, M., & Mali, A., D. (2004). P-MEP: Parallel more expressive planner. In Edelkamp, S., Hoffmann, J., Littman, M., & Younes, H. (Eds.), In Abstract Booklet of the Competing Planners of ICAPS-04, pp. 53-55.
38. Schwartz, P., J., & Pollack, M., E. (2004). Planning with disjunctive temporal constraints. In Proceedings of the ICAPS-04 Workshop on Integrating Planning into Scheduling, pp. 67-74.
39. Smith, D., & Weld, D. (1999). Temporal planning with mutual exclusive reasoning. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), pp. 326-337, San Francisco, CA, USA. Morgan Kaufmann Publishers.
40. Smith, S., & Cheng, C. (1993). Slack-based heuristics for constraint satisfaction scheduling. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), pp. 139-144, Menlo Park, CA, USA. AAAI Press/The MIT press.
41. Stergiou, K., & Koubarakis, M. (2000). Backtracking algorithms for disjunctions of temporal constraints. Artificial Intelligence, 120(1), pp. 81-117.
42. Tate, A. (1977). Generating project networks. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence (IJCAI-77), pp. 888-889, Cambridge, MA, USA. MIT, William Kaufmann.
43. Tsamardinos, I., & Pollack, M. E. (2003). Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence, 151(1-2), pp. 43-89.
44. Vere, S. A. (1983). Planning in time: Windows and durations for activities and goals. IEEE Transactions on Pattern Analysis and Machine Intelligence, 5(3), pp. 246-267.
45. Vidal, V. (2004). A lookahead strategy for heuristic search planning. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS-04), pp. 150-159, Menlo Park, CA, USA. AAAI Press.
46. Wilcoxon, F., &: Wilcox, R. A. (1964). Some Rapid Approximate Statistical Procedures. American Cyanamid Co., Pearl River, NY, USA.