Planning with durative actions in stochastic domains

Journal of Artificial Intelligence Research

Volumn 31, Issue , 2008, Pages 33-82

  Mausam, ^a   Weld, Daniel S ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION MAKING; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBLEM SOLVING;

DURATIVE ACTIONS; PROBABILISTIC PLANNING; STOCHASTIC DOMAINS;

STOCHASTIC PROGRAMMING;

EID: 44449108706     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2269     Document Type: Article

References (48)

1. Aberdeen, D., Thiebaux, S., & Zhang, L. (2004). Decision-theoretic military operations planning. In ICAPS '04.
2. Aberdeen, D., & Buffet, O. (2007). Concurrent probabilistic temporal planning with policygradients. In ICAPS'07.
3. Bacchus, F., & Ady, M. (2001). Planning with resources and concurrency: A forward chaining approach. In IJCAI'01, pp. 417-424.
4. Barto, A., Bradtke, S., & Singh, S. (1995). Learning to act using real-time dynamic programming. Artificial Intelligence, 72, 81-138.
5. Bertsekas, D. (1995). Dynamic Programming and Optimal Control. Athena Scientific.
6. Blum, A., & Furst, M. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2), 281-300.
7. Bonet, B., & Geffner, H. (2003). Labeled RTDP: Improving the convergence of real-time dynamic programming. In ICAPS'03, pp. 12-21.
8. Bonet, B., & Geffner, H. (2005). mGPT: A probabilistic planner based on heuristic search. JAIR, 24, 933.
9. Boutilier, C., Dean, T., & Hanks, S. (1999). Decision theoretic planning: Structural assumptions and computational leverage. J. Artificial Intelligence Research, 11, 1-94.
10. Boyan, J. A., & Littman, M. L. (2000). Exact solutions to time-dependent MDPs. In NIPS'00, p. 1026.
11. Bresina, J., Dearden, R., Meuleau, N., Smith, D., & Washington, R. (2002). Planning under continuous time and resource uncertainty : A challenge for AI. In UAI'02.
12. Chen, Y., Wah, B. W., & Hsu, C. (2006). Temporal planning using subgoal partitioning and resolution in sgplan. JAIR, 26, 323.
13. Cushing, W., Kambhampati, S., Mausam, & Weld, D. S. (2007). When is temporal planning really temporal?. In IJCAI'07.
14. Dearden, R., Meuleau, N., Ramakrishnan, S., Smith, D. E., & Washington, R. (2003). Incremental Contingency Planning. In ICAPS'03 Workshop on Planning under Uncertainty and Incomplete Information.
15. Do, M. B., & Kambhampati, S. (2001). Sapa: A domain-independent heuristic metric temporal planner. In ECP'01.
16. Do, M. B., & Kambhampati, S. (2003). Sapa: A scalable multi-objective metric temporal planner. JAIR, 20, 155-194.
17. Edelkamp, S. (2003). Taming numbers and duration in the model checking integrated planning system. Journal of Artificial Intelligence Research, 20, 195-238.
18. Feng, Z., Dearden, R., Meuleau, N., & Washington, R. (2004). Dynamic programming for structured continuous Markov decision processes. In UAI'04, p. 154.
19. Foss, J., & Onder, N. (2005). Generating temporally contingent plans. In IJCAI'05 Workshop on Planning and Learning in Apriori Unknown or Dynamic Domains.
20. Fox, M., & Long, D. (2003). PDDL2.1: An extension to PDDL for expressing temporal planning domains.. JAIR Special Issue on 3rd International Planning Competition, 20, 61-124.
21. Gerevini, A., & Serina, I. (2002). LPG: A planner based on local search for planning graphs with action graphs. In AIPS'02, p. 281.
22. Guestrin, C., Koller, D., & Parr, R. (2001). Max-norm projections for factored MDPs. In IJCAI'01, pp. 673-682.
23. Hansen, E., & Zilberstein, S. (2001). LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence, 129, 35-62.
24. Haslum, P., & Geffner, H. (2001). Heuristic planning with time and resources. In ECP'01.
25. Hoey, J., St-Aubin, R., Hu, A., & Boutilier, C. (1999). SPUDD: Stochastic planning using decision diagrams. In UAI'99, pp. 279-288.
26. Jensen, R. M., & Veloso, M. (2000). OBDD=based universal planning for synchronized agents in non-deterministic domains. Journal of Artificial Intelligence Research, 13, 189.
27. Kushmerick, N., Hanks, S., & Weld, D. (1995). An algorithm for probabilistic planning. Artificial Intelligence, 76(1-2), 239-286.
28. Laborie, P., & Ghallab, M. (1995). Planning with sharable resource constraints. In IJCAI'95, p. 1643.
29. Little, I., Aberdeen, D., & Thiebaux, S. (2005). Prottle: A probabilistic temporal planner. In AAAI'05.
30. Little, I., & Thiebaux, S. (2006). Concurrent probabilistic planning in the graphplan framework. In ICAPS'06.
31. Long, D., & Fox, M. (2003). The 3rd international planning competition: Results and analysis. JAIR, 20, 1-59.
32. Mausam (2007). Stochastic planning with concurrent, durative actions. Ph.d. dissertation, University of Washington.
33. Mausam, Bertoli, P., & Weld, D. (2007). A hybridized planner for stochastic domains. In IJCAI'07.
34. Mausam, & Weld, D. (2004). Solving concurrent Markov decision processes. In AAAI'04.
35. Mausam, & Weld, D. (2005). Concurrent probabilistic temporal planning. In ICAPS'05, pp. 120-129.
36. Mausam, & Weld, D. (2006a). Challenges for temporal planning with uncertain durations. In ICAPS'06.
37. Mausam, & Weld, D. (2006b). Probabilistic temporal planning with uncertain durations. In AAAI'06.
38. Meuleau, N., Hauskrecht, M., Kim, K.-E., Peshkin, L., Kaelbling, L., Dean, T., & Boutilier, C. (1998). Solving very large weakly coupled Markov Decision Processes. In AAAI'98, pp. 165-172.
39. Musliner, D., Murphy, D., & Shin, K. (1991). World modeling for the dynamic construction of real-time control plans. Artificial Intelligence, 74, 83-127.
40. Nigenda, R. S., & Kambhampati, S. (2003). Altalt-p: Online parallelization of plans with heuristic state search. Journal of Artificial Intelligence Research, 19, 631-657.
41. Penberthy, J., & Weld, D. (1994). Temporal planning with continuous change. In AAAI'94, p. 1010.
42. Rohanimanesh, K., & Mahadevan, S. (2001). Decision-Theoretic planning with concurrent temporally extended actions. In UAI'01, pp. 472-479.
43. Singh, S., & Cohn, D. (1998). How to dynamically merge markov decision processes. In NIPS'98. The MIT Press.
44. Smith, D., & Weld, D. (1999). Temporal graphplan with mutual exclusion reasoning. In IJCAI'99, pp. 326-333 Stockholm, Sweden. San Francisco, CA: Morgan Kaufmann.
45. Vidal, V., & Geffner, H. (2006). Branching and pruning: An optimal temporal pocl planner based on constraint programming. AIJ, 170(3), 298-335.
46. Younes, H. L. S., & Simmons, R. G. (2004a). Policy generation for continuous-time stochastic domains with concurrency. In ICAPS'04, p. 325.
47. Younes, H. L. S., & Simmons, R. G. (2004b). Solving generalized semi-markov decision processes using continuous phase-type distributions. In AAAI'04, p. 742.
48. Zhang, W., & Dietterich, T. G. (1995). A reinforcement learning approach to job-shop scheduling. In IJCAI'95, pp. 1114-1120.