Prioritizing Bellman backups without a priority queue

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

Volumn , Issue , 2007, Pages 113-119

  Dai, Peng ^a   Hansen, Eric A ^b  

^a UNIVERSITY OF KENTUCKY   (United States)

^b MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL EFFICIENCY; DYNAMIC PROGRAMMING; ITERATIVE METHODS; QUEUEING THEORY;

ARBITRARY ORDER; DYNAMIC PROGRAMMING ALGORITHM; MARKOV DECISION PROCESSES; ON STATE; PRIORITIZATION; PRIORITY QUEUES; SIMPLE APPROACH; SIMPLE HEURISTICS; VALUE FUNCTIONS; VALUE ITERATION;

MARKOV PROCESSES;

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

References (15)

1. Andre, D.; Friedman, N.; and Parr, R. 1998. Generalized prioritized sweeping. In Proc. of the 10th conference on Advances in neural information processing systems (NIPS- 97), 1001-1007.
2. Barto, A.; Bradke, S.; and Singh, S. 1995. Learning to act using real-time dynamic programming. Artificial Intelligence J. 72:81-138.
3. Bellman, R. 1957. Dynamic Programming. Princeton, NJ: Princeton University Press.
4. Bonet, B., and Geffner, H. 2003. Labeled RTDP: Improving the convergence of real-time dynamic programming. In Proc. 13th International Conference on Automated Planning and Scheduling (ICAPS-03), 12-21.
5. Boutilier, C.; Dean, T.; and Hanks, S. 1999. Decisiontheoretic planning: Structural assumptions and computational leverage. J. of Artificial Intelligence Research 11:1-94.
6. Cormen, T. H.; Leiserson, C. E.; Rivest, R. L.; and Stein, C. 2001. Introduction to Algorithms, Second Edition. The MIT Press.
7. Dai, P., and Goldsmith, J. 2007. Topological value iteration algorithm for Markov decision processes. In Proc. 20th International Joint Conference on Artificial Intelligence (IJCAI-07), 1860-1865.
8. Dearden, R. 2001. Structured prioritised sweeping. In Proceedings of the Eighteenth International Conference on Machine Learning (ICML 2001), 82-89.
9. Ferguson, D., and Stentz, A. 2004a. Focussed dynamic programming: Extensive comparative results. Technical Report CMU-RI-TR-04-13, Carnegie Mellon University, Pittsburgh, PA.
10. Ferguson, D., and Stentz, A. 2004b. Focussed propagation of MDPs for path planning. In Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 310-317.
11. *: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence J. 129:35-62.
12. McMahan, H. B., and Gordon, G. J. 2005. Fast exact planning in Markov decision processes. In Proc. of the 15th International Conference on Automated Planning and Scheduling (ICAPS-05).
13. Moore, A., and Atkeson, C. 1993. Prioritized sweeping: Reinforcement learning with less data and less real time. Machine Learning J. 13:103-130.
14. Peng, J., and Williams, R. 1993. Efficient learning and planning within the dyna framework. Adaptive Behavior 1(4):437-454.
15. Rayner, D. C; Davison, K.; Bulitko, V.; Anderson, K.; and Lu, J. 2007. Real-time heuristic search with a priority queue. In Proc. of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), 2372-2377. Wingate, D., and Seppi, K. D. 2005. Prioritization methods for accelerating MDP solvers. J. of Machine Learning Research 6:851-881.