Planning under continuous time and resource uncertainty: A challenge for AI (2002)

by John Bresina , Nicolas Meuleauy , Sailesh Ramakrishnan , David Smith , Rich Washingtonx
Venue:In Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence
Citations:81 - 13 self

Documents Related by Co-Citation

33 Dynamic programming for structured continuous markov decision problems – Z Feng, R Dearden, N Meuleau, R Washington - 2004
24 Incremental contingency planning – Richard W Dearden, Nicolas Meuleau, Sailesh Ramakrishnan, David E Smith, Rich Washington - 2003
52 Exact Solutions to Time-Dependent MDPs – Justin A. Boyan, Michael L. Littman - 2000
852 Fast Planning Through Planning Graph Analysis – Avrim L. Blum, Merrick L. Furst - 1995
878 Markov Decision Processes: Discrete Stochastic Dynamic Programming – M L Puterman - 1994
57 Just-in-Case Scheduling – Mark Drummond, John Bresina, Keith Swanson - 1994
19 Planning with continuous resources in stochastic domains – E Benazara Mausam, R Brafman, N Meuleau, E Hansen
77 Labeled RTDP: Improving the convergence of real-time dynamic programming – Blai Bonet - 2003
70 Solving very large weakly coupled Markov decision processes – Nicolas Meuleau, Milos Hauskrecht, Kee-eung Kim, Leonid Peshkin, Leslie Pack Kaelbling, Thomas Dean, Craig Boutilier - 1998
117 Multiagent Planning with Factored MDPs – Carlos Guestrin, Daphne Koller, Ronald Parr - 2001
133 Decision theoretic planning: Structural assumptions and computational leverage – C Boutilier, T Dean, S Hanks - 1999
114 LAO*: A heuristic search algorithm that finds solutions with loops – Eric A. Hansen, Shlomo Zilberstein - 2001
19 Decision-Theoretic Planning with Concurrent Temporally Extended Actions – Khashayar Rohanimanesh, Sridhar Mahadevan - 2001
24 Linear Program Approximations for Factored Continuous-State Markov Decision Processes – Milos Hauskrecht, Branislav Kveton - 2003
85 Variable Resolution Discretization in Optimal Control – Rémi Munos, Andrew Moore, Satinder Singh - 2001
28 Lazy approximation for solving continuous finitehorizon MDPs – L Li, M Littman - 2005
58 Max-norm Projections for Factored MDPs – Carlos Guestrin, Daphne Koller, Ronald Parr - 2001
488 an algorithm for finding best matches in logarithmic expected time – J Friedman, J Bentley, R Finkel - 1977
472 Learning to act using real-time dynamic programming – Andrew G. Barto, Steven J. Bradtke, Satinder P. Singh - 1993