Temporal planning using subgoal partitioning and resolution in SGPlan

Journal of Artificial Intelligence Research

Volumn 26, Issue , 2006, Pages 323-369

  Chen, Yixin ^a   Wah, Benjamin W ^b   Hsu, Chih Wei ^b  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

^b United States of America   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BENCHMARKING; CONSTRAINT THEORY; FUNCTION EVALUATION; OPTIMIZATION;

GLOBAL CONSTRAINTS; OBJECTIVE FUNCTION; PLANNING PROBLEM; TEMPORAL PLANNING PROBLEMS;

PROBLEM SOLVING;

EID: 33749015487     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1918     Document Type: Article

References (42)

1. Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90, 281-300.
2. Bonet, B., & Geffner, H. (2001). Planning as heuristic search. Artificial Intelligence, Special issue on Heuristic Search, 129(1).
3. Chen, Y., & Wah, B. W. (2003). Automated planning and scheduling using calculus of variations in discrete space. In Proc. Int'l Conf. on Automated Planning and Scheduling, pp. 2-11.
4. Chien, S., Rabideau, G., Knight, R., Sherwood, R., Engelhardt, B., Mutz, D., Estlin, T., Smith, B., Fisher, F., Barrett, T., Stebbins, G., & Tran, D. (2000). ASPEN - Automating space mission operations using automated planning and scheduling. In Proc. Space Ops. Space Operations Organization.
5. Doherty, P., & Kvarnstrm, J. (1999). Talplanner: An empirical investigation of a temporal logic-based forward chaining planner.. In Proc. Sixth Int'l Workshop on Temopral Logic-based Forword Chaining Planner, pp. 47-54. AIPS.
6. Edelkamp, S. (2002). Mixed propositional and numerical planning in the model checking integrated planning system. In Proc. Workshop on Planning for Temporal Domains. AIPS.
7. Edelkamp, S. (2003). Pddl2.2 planning in the model checking integrated environment. In UK Planning and Scheduling Special Interest Group (PlanSig). Glasgow.
8. Edelkamp, S., & Hoffmann, J. (2004). Classical part, 4th international planning competition. http://ls5-www.cs.uni-dortmund.de/~edelkamp/ipc-4/.
9. Foulser, D. E., Li, M., & Yang, Q. (1992). Theory and algorithms for plan merging.. Artificial Intelligence, 57(2-3), 143-181.
10. Fourman, M. P. (2000). Propositional planning. In Proc. Workshop on Model Theoretic Approaches to Planning. AIPS.
11. Garrido, A., Fox, M., & Long, D. (2002). A temporal planning system for durative actions of pddl2.1. In Proc. of European Conf. on Artificial Intelligence, pp. 586-590.
12. Gerevini, A., & Serina, I. (2002). LPG: a planner based on local search for planning graphs with action costs. In Proc. of the Sixth Int. Conf. on AI Planning and Scheduling, pp. 12-22. Morgan Kaufman.
13. Hanks, S., & Weld, D. S. (1995). A domain-independent algorithm for plan adaptation.. J. of Artificial Intelligence Research, 2, 319-360.
14. Helmert, M., & Richter, S. (2004). Fast downward - making use of causal dependencies in the problem representation. In Proc. IPC4, ICAPS, pp. 41-43.
15. Hoffmann, J. (2003). The metric-ff planning system: Translating ignoring delete lists to numeric state variables. Journal of Artificial Intelligence Research, 20, 291-341.
16. Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. J. of Artificial Intelligence Research, 14, 253-302.
17. Jonsson, A. K., Morris, P. H., Muscettola, N., & Rajan, K. (2000). Planning in interplanetary space: Theory and practice. In Proc. 2nd Int'l NASA Workshop on Planning and Scheduling for Space. NASA.
18. Kambhampati, S., & Hendler, J. A. (1992). A validation-structure-based theory of plan modification and reuse.. Artificial Intelligence, 55(2), 193-258.
19. Kautz, H., & Selman, B. (1996). Pushing the envelope: planning, propositional logic, and stochastic search. In Proc. 13th National Conference on Artificial Intelligence, pp. 1194-1201. AAAI.
20. Kautz, H., & Selman, B. (1999). Unifying SAT-based and graph-based planning. In Proc. Int'l Joint Conf. on Artificial Intelligence. IJCAI.
21. Kautz, H., & Walser, J. P. (2000). Integer optimization models of AI planning problems. The Knowledge Engineering Review, 15(1), 101-117.
22. Koehler, J., & Hoffmann, J. (2000). On reasonable and forced goal ordering and their use in an agenda-driven planning algorithm. J. of AI Research, 12, 339-386.
23. Lin, F. (2001). A planner called R. AI Magazine, 73-76.
24. Long, D., & Fox, M. (1998). Efficient implementation of the plan graph in STAN. J. of AI Research.
25. Nan, D., Muoz-Avila, H., Cao, Y., Lotem, A., & Mitchell, S. (2001). Total-order planning with partially ordered subtasks. In Proc. Int'l Joint Conf. on Artificial Intelligence, pp. 425-430. IJCAI.
26. Nebel, B., Dimopoulos, Y., & Koehler, J. (1997). Ignoring irrelevant facts and operators in plan generation. In Proc. European Conf. on Planning, pp. 338-350.
27. Nebel, B., & Koehler, J. (1995). Plan reuse versus plan generation: A theoretical and empirical analysis.. Artificial Intelligence, 76(1-2), 427-454.
28. Nigenda, R. S., Nguyen, X., & Kambhampati, S. (2000). AltAlt: Combining the advantages of Graphplan and heuristic state search. Tech. rep., Arizona State University.
29. Penberethy, J., & Weld, D. (1992). UCPOP: A sound, complete, partial order planner for ADL. In Proc. 3rd Int'l Conf. on Principles of Knowledge Representation and Reasoning, pp. 103-114. KR Inc.
30. Penberethy, J., & Weld, D. (1994). Temporal planning with continuous change. In Proc. 12th National Conf. on AI, pp. 1010-1015. AAAI.
31. Porteous, J., Sebastia, L., & Hoffmann, J. (2001). On the extraction, ordering, and usage of landmarks in planning. In Proc. European Conf. on Planning, pp. 37-48.
32. Refanidis, I., & Vlahavas, I. (2001). The CRT planner. AI Magazine, 63-66.
33. Refanidis, I., & Vlahavas, I. (2002). The MO-GRT system: Heuristic planning with multiple criteria. In Proc. Workshop on Planning and Scheduling with Multiple Criteria. AIPS.
34. Subbarao, M. B. D., & Kambhampati, S. (2002). Sapa: A domain-independent heuristic metric temporal planner. Tech. rep., Arizona State University.
35. Tate, A., Drabble, B., & Kirby, R. (1994). O-Plan2: an open architecture for command, planning and control. Intelligent Scheduling, 213-239.
36. Tsamardinos, I., Pollack, M. E., & Horty, J. F. (2000). Merging plans with quantitative temporal constraints, temporally extended actions, and conditional branches.. In Proc. Int'l Conf. on AI Planning and Scheduling (AIPS), pp. 264-272.
37. Wah, B., & Chen, Y. (2006). Constraint partitioning in penalty formulations for solving temporal planning problems. Artificial Intelligence, 170(3), 187-231.
38. Wah, B. W., & Chen, Y. (2003). Partitioning of temporal planning problems in mixed space using the theory of extended saddle points. In Proc. IEEE Int'l Conf. on Tools with Artificial Intelligence, pp. 266-273.
39. Wah, B. W., & Chen, Y. (2004). Subgoal partitioning and global search for solving temporal planning problems in mixed space. Int'l J. of Artificial Intelligence Tools, 13(4), 767-790.
40. Wilkins, D. (1990). Can AI planners solve practical problems?. Computational Intelligence, 232-246.
41. Wolfman, S., & Weld, D. (2000). Combining linear programming and satisfiability solving for resource planning. The Knowledge Engineering Review, 15(1).
42. Yang, Q. (1997). Intelligent planning: a decomposition and abstraction based approach. Springer-Verlag, London, UK.