메뉴 건너뛰기




Volumn , Issue , 2004, Pages 310-317

Focussed processing of MDPs for path planning

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; FUNCTIONS; GLOBAL POSITIONING SYSTEM; MARKOV PROCESSES; ROBOTS;

EID: 16244413209     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (14)

References (16)
  • 1
    • 0029210635 scopus 로고
    • Learning to act using real-time dynamic programming
    • A. Barto, S. Bradtke, and S. Singh. Learning to Act Using Real-Time Dynamic Programming. Artificial Intelligence, 72:81-138, 1995.
    • (1995) Artificial Intelligence , vol.72 , pp. 81-138
    • Barto, A.1    Bradtke, S.2    Singh, S.3
  • 7
    • 0029332887 scopus 로고
    • Planning under time constraints in stochastic domains
    • July
    • T. Dean, L. Kaelbling, J. Kirman, and A. Nicholson. Planning Under Time Constraints in Stochastic Domains. Artificial Intelligence, 76(1-2):35-74, July 1995.
    • (1995) Artificial Intelligence , vol.76 , Issue.1-2 , pp. 35-74
    • Dean, T.1    Kaelbling, L.2    Kirman, J.3    Nicholson, A.4
  • 9
    • 16244399286 scopus 로고    scopus 로고
    • Focussed dynamic programming: Extensive comparative results
    • Carnegie Mellon Robotics Institute, March
    • D. Ferguson and A. Stentz. Focussed Dynamic Programming: Extensive Comparative Results. Technical Report CMU-RI-TR-04-13, Carnegie Mellon Robotics Institute, March 2004.
    • (2004) Technical Report , vol.CMU-RI-TR-04-13
    • Ferguson, D.1    Stentz, A.2
  • 10
    • 0035369425 scopus 로고    scopus 로고
    • LAO*: A heuristic search algorithm that finds solutions with loops
    • E. Hansen and S. Zilberstein. LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence, 129(1-2):35-62, 2001.
    • (2001) Artificial Intelligence , vol.129 , Issue.1-2 , pp. 35-62
    • Hansen, E.1    Zilberstein, S.2
  • 13
    • 0027684215 scopus 로고
    • Prioritized sweeping: Reinforcement learning with less data and less real time
    • A. Moore and C. Atkeson. Prioritized Sweeping: Reinforcement Learning with Less Data and Less Real Time. Machine Learning, 13:103-130, 1993.
    • (1993) Machine Learning , vol.13 , pp. 103-130
    • Moore, A.1    Atkeson, C.2
  • 16
    • 0031350985 scopus 로고    scopus 로고
    • Spline approximations to value functions: A linear programming approach
    • M. Trick and S. Zin. Spline approximations to value functions: a linear programming approach. Macroeconomic Dyna8mics, 1:255-277, 1997.
    • (1997) Macroeconomic Dyna8mics , vol.1 , pp. 255-277
    • Trick, M.1    Zin, S.2


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