An UCT approach for anytime agent-based planning

Advances in Intelligent and Soft Computing

Volumn 70, Issue , 2010, Pages 211-220

  Pellier, Damien ^a   Bouzy, Bruno ^a   Métivier, Marc ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GAMES; HEURISTIC ALGORITHMS; MODULAR ROBOTS; OPTIMIZATION;

AGENT BASED; ANYTIME PLANNING; CLASSICAL PLANNING; HEURISTIC SEARCH; HEURISTIC SEARCH ALGORITHMS; MEAN VALUES; OPTIMAL PLAN; PLANNING ALGORITHMS;

MULTI AGENT SYSTEMS;

EID: 84982987989     PISSN: 18675662     EISSN: 18600794     Source Type: Book Series    
DOI: 10.1007/978-3-642-12384-9_26     Document Type: Conference Paper

References (16)

1. Auer, P., Cesa-Bianchi, N., Fisher, P.: Finite-time Analysis of the Multiarmed Bandit Problem. Machine Learning 47(2–3), 235–256 (2002)
2. Bonet, B., Geffner, H.: Planning as Heuristic Search. Artificial Intelligence 129(1–2), 5–33 (2001)
3. Chaslot, G., Winands, M., van den Herik, H., Uiterwijk, J., Bouzy, B.: Progressive Strategies for Monte-Carlo Tree Search. New Mathematics and Natural Computation 4(3), 343–357 (2008)
4. Chen, Y., Huang, R., Zhang, W.: Fast Planning by Search in Domain Transition Graphs. In: Proc. AAAI, pp. 886–891 (2008)
5. Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modification of UCT with Patterns in Monte-Carlo Go. Tech. Rep. RR-6062, INRIA (2006)
6. Gerevini, A., Serina, I.: LPG: A Planner Based on Local Search for Planning Graphs with Action Costs. In: Proc. ICAPS, pp. 13–22 (2002)
7. Grandcolas, S., Pain-Barre, C.: Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning. In: Proc. AAAI (2007)
8. Hansen, E.A., Zhou, R.: Anytime Heuristic Search. JAIR 28(1), 267–297 (2007)
9. Hayes-Roth, B.: An architecture for adaptive intelligent systems. Artificial Intelligence 72, 329–365 (1995)
10. Hoffmann, J., Nebel, B.: The FF Planning System: Fast Plan Generation Through Heuristic Search. JAIR 14(1), 253–302 (2001)
11. Hsu, C.W., Wah, B., Huang, R., Chen, Y.: Handling Soft Constraints and Goals Preferences in SGPlan. In: Proc. of the ICAPS Workshop on Preferences and Soft Constraints in Planning (2006)
12. Kautz, H.A., Selman, B.: Unifying SAT-based and Graph-based Planning. In: Proc. IJCAI, pp. 318–325 (1999)
13. Kocsis, L., Szepesvari, C.: Bandit-based Monte-Carlo Planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282–293. Springer, Heidelberg (2006)
14. Koehler, J., Nebel, B., Hoffmann, J., Dimopoulos, Y.: Extending planning graphs to an ADL subset. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348, pp. 273–285. Springer, Heidelberg (1997)
15. Korf, R.: Real-Time Heuristic Search. Artificial Intelligence 42(2-3), 189–211 (1990)
16. Musliner, D., Goldman, R., Krebsbach, K.: Deliberation scheduling strategies for adaptive mission planning in real-time environments. In: Proceedings of the Third International Workshop on Self Adaptive Software (2003)