Concurrent probabilistic temporal planning with policy-gradients

ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2007, Pages 10-17

  Aberdeen, Douglas ^a   Buffet, Olivier ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECT POLICY SEARCH; FUNCTIONS APPROXIMATIONS; GRADIENT ASCENT; LOW MEMORY; MEMORY USE; PARAMETERIZED; POLICY GRADIENT; PROBABILISTICS; TEMPORAL PLANNING; UNCERTAINTY;

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

References (21)

1. Aberdeen, D.; Thiébaux, S.; and Zhang, L. 2004. Decisiontheoretic military operations planning. In Proc. ICAPS.
2. Aberdeen, D. 2006. Policy-gradient methods for planning. In Proc. NIPS'05.
3. Barto, A.; Bradtke, S.; and Singh, S. 1995. Learning to act using real-time dynamic programming. Artificial Intelligence 72.
4. Baxter, J.; Bartlett, P.; and Weaver, L. 2001. Experiments with infinite-horizon, policy-gradient estimation. JAIR 15.
5. Bonet, B., and Givan, R. 2006. Proc. of the 5th int. planning competition (IPC-5). See http://www.ldc.usb.ve/~bonet/ipc5 for all results and proceedings.
6. Buffet, O., and Aberdeen, D. 2007. FF+FPG: Guiding a policygradient planner. In Proc. ICAPS.
7. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302.
8. Little, I., and Thiébaux, S. Probabilistic planning vs replanning. Submitted for Publication.
9. Little, I., and Thiébaux, S. 2006. Concurrent probabilistic planning in the graphplan framework. In Proc. ICAPS.
10. Little, I.; Aberdeen, D.; and Thiébaux, S. 2005. Prottle: A probabilistic temporal planner. In Proc. AAAI.
11. Mausam, and Weld, D. S. 2005. Concurrent probabilistic temporal planning. In Proc. ICAPS.
12. Mausam, and Weld, D. S. 2006. Probabilistic temporal planning with uncertains durations. In Proc. AAAI'06.
13. Peshkin, L.; Kim, K.-E.; Meuleau, N.; and Kaelbling, L. P. 2000. Learning to cooperate via policy search. In Proc. UAI.
14. Sanner, S., and Boutilier, C. 2006. Practical linear valueapproximation techniques for first-order MDPs. In Proc. UAI.
15. Sutton, R. S.; McAllester, D.; Singh, S.; and Mansour, Y. 2000. Policy gradient methods for reinforcement learning with function approximation. Proc. NIPS.
16. Tao, N.; Baxter, J.; and Weaver, L. 2001. A multi-agent, policygradient approach to network routing. In Proc. ICML.
17. Williams, R. J. 1992. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learning 8:229-256.
18. Yoon, S.; Fern, A.; and Givan, R. 2007. FF-replan, a baseline for probabilistic planning. In Proc. ICAPS'07.
19. Younes, H. L. S., and Littman, M. L. 2004. PPDDL1.0: An extension to PDDL for expressing planning domains with probabilistic effects. Technical Report CMU-CS-04-167.
20. Younes, H. L. S., and Simmons, R. G. 2004. Policy generation for continuous-time stochastic domains with concurrency. In Proc. ICAPS.
21. Younes, H. L. S. 2003. Extending PDDL to model stochastic decision processes. In Proc. ICAPS Workshop on PDDL.