A hybridized planner for stochastic domains

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 1972-1978

  Mausam, ^a   Bertoli, Piergiorgio ^b   S Weld, Daniel ^a  

^a University of Washington   (United States)

^b ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH SCALABILITIES; LARGE PROBLEMS; MARKOV DECISION PROCESSES; MODEL OF UNCERTAINTY; OPTIMAL SOLUTIONS; OPTIMALITY; PLANNING UNDER UNCERTAINTY; STOCHASTIC DOMAINS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; MARKOV PROCESSES;

SCALABILITY;

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

References (22)

1. A. Barto, S. Bradtke, and S. Singh. Learning to act using real-time dynamic programming. Artificial Intelligence, 72:81-138, 1995.
2. P. Bertoli, A. Cimatti, M. Pistore, M. Roveri, and P. Traverso. MBP: a Model Based Planner. In ICAI-2001 workshop on Planning under Uncertainty and Incomplete Information, pages 93-97, 2001.
3. Piergiorgio Bertoli, Alessandro Cimatti, Marco Roveri, and Paolo Traverso. Strong planning under partial observability. Artificial Intelligence, 170:337-384, 2006.
4. D. Bertsekas. Dynamic Programming and Optimal Control. Athena Scientific, 1995.
5. B. Bonet and H. Geffner. Labeled RTDP: Improving the convergence of real-time dynamic programming. In ICAPS'03, pages 12-21, 2003.
6. B. Bonet and H. Geffner. mGPT: A probabilistic planner based on heuristic search. JAIR, 24:933, 2005.
7. D. Bryce, S. Kambhampati, and D. E. Smith. Planning graph heuristics for belief space search. Journal of Artificial Intelligence Research, 26:35-99, 2006. (Pubitemid 44452207)
8. A. Cimatti, M. Pistore, M. Roveri, and P. Traverso. Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence, 147(1- 2):35-84, 2003.
9. Z. Feng and E. Hansen. Symbolic heuristic search for factored Markov decision processes. In Proceedings of the Eighteenth National Conference on Artificial Intelligence, 2002.
10. C. P. Gomes and B. Selman. Algorithm portfolios. Artificial Intelligence, 126:43-62, 2001. (Pubitemid 32196231)
11. E. Hansen and S. Zilberstein. LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence, 129:35-62, 2001. (Pubitemid 32498415)
12. I. Little and S. Thiebaux. Concurrent probabilistic planning in the graphplan framework. In ICAPS'06, 2006.
13. S. Martello and P. Toth. Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, 1990.
14. Mausam and D. Weld. Solving concurrent Markov decision processes. In AAAI'04, 2004.
15. Mausam and D. Weld. Concurrent probabilistic temporal planning. In ICAPS'05, pages 120-129, 2005.
16. Mausam, E. Benazara, R. Brafman, N. Meuleau, and E. Hansen. Planning with continuous resources in stochastic domains. In IJCAI'05, page 1244, 2005.
17. H. B. McMahan, M. Likhachev, and G. J. Gordon. Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees. In ICML'05, 2005.
18. J. Pineau, G. Gordon, and S. Thrun. Point-based value iteration: An anytime algorithm for POMDPs. In IJCAI'03, pages 1025-1032, 2003.
19. P. Poupart. Exploiting structure to efficiently solve large scale partially observable Markov decision processes. Ph.D. thesis. University of Toronto, 2005.
20. J. Rintanen. Conditional planning in the discrete belief space. In IJCAI'05, 2005.
21. D. E. Smith. Choosing objectives in oversubscription planning. In ICAPS'04, page 393, 2004.
22. H. L. S. Younes and R. G. Simmons. Policy generation for continuous-time stochastic domains with concurrency. In ICAPS'04, page 325, 2004.