메뉴 건너뛰기




Volumn , Issue , 2005, Pages 569-576

Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DYNAMIC PROGRAMMING; PLANNING; PROBLEM SOLVING;

EID: 31844446535     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1102351.1102423     Document Type: Conference Paper
Times cited : (147)

References (12)
  • 1
    • 0029210635 scopus 로고
    • Learning to act using real-time dynamic programming
    • Barto, A. G., Bradtke, S. J., & Singh, S. P. (1995). Learning to act using real-time dynamic programming. Artif. Intell., 72, 81-138.
    • (1995) Artif. Intell. , vol.72 , pp. 81-138
    • Barto, A.G.1    Bradtke, S.J.2    Singh, S.P.3
  • 3
    • 84880851659 scopus 로고    scopus 로고
    • Faster heuristic search algorithms for planning with uncertainty and full feedback
    • Acapulco, Mexico: Morgan Kaufmann
    • Bonet, B., & Geffner, H. (2003a). Faster heuristic search algorithms for planning with uncertainty and full feedback. Proc. 18th International Joint Conf. on Artificial Intelligence (pp. 1233-1238). Acapulco, Mexico: Morgan Kaufmann.
    • (2003) Proc. 18th International Joint Conf. on Artificial Intelligence , pp. 1233-1238
    • Bonet, B.1    Geffner, H.2
  • 4
    • 31844451230 scopus 로고    scopus 로고
    • Labeled RTDP: Im
    • Bonet, B., & Geffner, H. (2003b). Labeled RTDP: Im
    • (2003)
    • Bonet, B.1    Geffner, H.2
  • 5
    • 9444233135 scopus 로고    scopus 로고
    • Proving the convergence of real-time dynamic programming
    • proving the convergence of real-time dynamic programming. Proc. of ICAPS-03 (pp. 12-21).
    • Proc. of ICAPS-03 , pp. 12-21
  • 6
  • 8
    • 0035369425 scopus 로고    scopus 로고
    • LAO*: A heuristic search algorithm that finds solutions with loops
    • Hansen, E. A., & Zilberstein, S. (2001). LAO*: a heuristic search algorithm that finds solutions with loops. Artif. Intell., 129, 35-62.
    • (2001) Artif. Intell. , vol.129 , pp. 35-62
    • Hansen, E.A.1    Zilberstein, S.2
  • 9
    • 84890267871 scopus 로고    scopus 로고
    • Fast exact planning in markov decision processes
    • McMahan, H. B., & Gordon, G. J. (2005). Fast exact planning in markov decision processes. To appear in ICAPS.
    • (2005) To Appear in ICAPS
    • McMahan, H.B.1    Gordon, G.J.2
  • 12
    • 31144465830 scopus 로고    scopus 로고
    • Heuristic search value iteration for pomdps
    • Banff, Alberta.
    • Smith, T., & Simmons, R. (2004). Heuristic search value iteration for pomdps. Proc. of UAI 2004. Banff, Alberta.
    • (2004) Proc. of UAI 2004
    • Smith, T.1    Simmons, R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.