Concurrent probabilistic temporal planning

ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2005, Pages 120-129

  Mausam, ^a   Weld, Daniel S ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE ALGORITHMS; AUGMENTED STATE SPACE; HYBRID ALGORITHMS; MARKOV DECISION PROCESSES; ORDERS OF MAGNITUDE; PROBABILISTIC PLANNING; QUALITY POLICY; TEMPORAL PLANNING;

ALGORITHMS; MARKOV PROCESSES; OPTIMIZATION;

PROBLEM SOLVING;

EID: 33746077967     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Aberdeen, D.; Thiebaux, S. and Zhang, L. 2004. Decision- Theoretic military operations planning. ICAPS'04.
2. Bacchus, F., and Ady, M. 2001. Planning with resources and concurrency: A forward chaining approach. UCAI'01, p417.
3. Barto, A.; Bradtke, S. and Singh, S. 1995. Learning to act using real-time dynamic programming. Artificial Intelligence 72, p81.
4. Bertsekas, D. 1995. Dynamic Programming and Optimal Control.
5. Blum, A. and Furst, M. 1995. Fast planning through planning graph analysis. IJCAl'95, pi636.
6. Bonet, B. and Geffner, H. 2000. Planning with incomplete information as heuristic search in belief space. AlPS'OO, p52.
7. Bonet, B and Geffner, H. 2003. Labeled RTDP: Improving the convergence of real-time dynamic programming. ICAPS'03, pi 2.
8. Boutilier, C.; Dean, T. and Hanks, S. 1999. Decision theoretic planning: Structural assumptions and computational leverage. JAIR 11.
9. Bresina, J.; Dearden, R.; Meuleau, N.; Smith, D. and Washington, R. 2002. Planning under continuous time and resource uncertainty : A challenge for AI. UAI'02, .
10. Dearden, R.; Meuleau, N.; Ramakrishnan, S.; Smith, D. E.; and Washington, R. 2003. Incremental Contingency Planning. ICAPS'03 Workshop on Planning under Uncertainty and Incom-plete Information.
11. Do. M. B., and Kambhampati. S. 2001. Sapa: A domain- independent heuristic metric temporal planner. ECP'01.
12. Fox, M and Long, D. 2003. PDDL2.1: An extension to PDDL for expressing temporal planning domains. JAIR 20, p61.
13. Hansen, E. and Zilberstein, S. 2001. LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence 129, p35.
14. Haslum, P. and Geffner, H. 2001. Heuristic planning with time and resources. ECP'01.
15. 2003. Special Issue on the 3rd International Planning Competition, JAIR, Volume 20.
16. Jensen, R. M. and Veloso, M. 2000. OBDD-based universal planning for synchronized agents in non-deterministic domains. JAIR 13, pI89.
17. Little, I. 2004. Probabilistic temporal planning. Honours thesis, Australian National Univesity.
18. Mausam, and Weld, D. 2004. Solving concurrent Markov decision processes. AAAI'04, p716.
19. Morris, P. H and Muscettola, N. 1999. Managing temporal uncertainty through waypoint controllability. IJCAI'99, pl253.
20. Rohanimanesh, K. and Mahadevan, S. 2001. Decision-Theoretic planning with concurrent temporally extended actions. UAl'01, p472.
21. Smith, D and Weld, D. 1999. Temporal graphplan with mutual exclusion reasoning. IJCAI'99, p326.
22. Younes, H. L. S. and Simmons, R. G. 2004. Policy generation for continuous-time stochastic domains with concurrency. ICAPS'04.