Stochastic enforced hill-climbing

ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2008, Pages 396-403

  Wu, Jia Hong ^a   Kalyanam, Rajesh ^a   Givan, Robert ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK DOMAINS; BREADTH-FIRST SEARCHES; DETERMINISTIC PROBLEMS; DETERMINIZATION; EXPECTED COSTS; GOAL-ORIENTED; GREEDY ACTIONS; GREEDY POLICIES; HEURISTIC FUNCTIONS; HILL-CLIMBING; HILL-CLIMBING TECHNIQUES; LOCAL OPTIMUM; MARKOV-DECISION PROCESS; ON-LINE USE; PROBABILISTIC PLANNING; STOCHASTIC GENERALIZATIONS; STOCHASTIC PROBLEMS; VALUE FUNCTIONS;

BEHAVIORAL RESEARCH; FUNCTIONS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; PLANNING; PROBABILITY DENSITY FUNCTION; RANDOM PROCESSES; SCHEDULING; STOCHASTIC MODELS;

FUNCTION EVALUATION;

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

References (14)

1. Barto, A. G.; Bradtke, S. J.; and Singh, S. P. 1995. Learning to act using real-time dynamic programming. AIJ 72:81-138.
2. Bertsekas, D. P., and Tsitsiklis, J. N. 1996. Neuro-Dynamic Programming. Athena Scientific.
3. Bertsekas, D. P. 1995. Dynamic Programming and Optimal Control. Athena Scientific.
4. Bonet, B., and Geffner, H. 2006. Learning depth-first search: A unified approach to heuristic search in deterministic and non-deterministic settings, and its application to MDPs. In ICAPS.
5. Cerny, V. 1985. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. J. Optim. Theory Appl. 45:41-51.
6. Dean, T.; Kaelbling, L. P.; Kirman, J.; and Nicholson, A. 1995. Planning under time constraints in stochastic domains. AIJ 76:35-74.
7. *: A heuristic search algorithm that finds solutions with loops. AIJ 129:35-62.
8. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302.
9. Kirkpatrick, S.; Gelatt, Jr, C.; and Vecchi, M. 1983. Optimization by simulated annealing. Science 220:671-680.
10. Nilsson, N. 1980. Principles of Artificial Intelligence. Tioga Publishing, Palo Alto, CA.
11. Sutton, R. S., and Barto, A. G. 1998. Reinforcement Learning: An Introduction. MIT Press.
12. Wu, J., and Givan, R. 2007. Discovering relational domain features for probabilistic planning. In ICAPS.
13. Yoon, S.; Fern, A.; and Givan, R. 2007. FF-Replan: A baseline for probabilistic planning. In ICAPS.
14. Younes, H.; Littman, M.; Weissman, D.; and Asmuth, J. 2005. The first probabilistic track of the international planning competition. JAIR 24:851-887.