메뉴 건너뛰기




Volumn 2, Issue , 2003, Pages 1159-1166

On the Heuristics of A* or A Algorithm in ITS and Robot Path-Planning

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALIBRATION; DATA REDUCTION; FUNCTIONS; GRAPH THEORY; HEURISTIC METHODS; MANIPULATORS; PROBLEM SOLVING; ROBOTS;

EID: 0348040457     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (40)

References (11)
  • 1
    • 34147120474 scopus 로고
    • A Note on Two Problems in Connecting with Graphs
    • E.W.Dijkstra, "A Note on Two Problems in Connecting with Graphs," Numerische Mathematik, vol.1, pp.269-271, 1959.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 7
    • 0028055356 scopus 로고
    • Optimal and Efficient Path Planning for Partially-Known Environments
    • A.Stentz, "Optimal and Efficient Path Planning for Partially-Known Environments", Proc. of the Int. Conf. on Robotics and Automation, pp.3310-3317, 1994.
    • (1994) Proc. of the Int. Conf. on Robotics and Automation , pp. 3310-3317
    • Stentz, A.1
  • 9
    • 0029507728 scopus 로고
    • A complete navigation system for goal acquisition in unknown environments
    • August
    • A.Stentz and M.Hebert, "A complete navigation system for goal acquisition in unknown environments", J. of Autonomous Robots, Vol.2, No.2, August 1995.
    • (1995) J. of Autonomous Robots , vol.2 , Issue.2
    • Stentz, A.1    Hebert, M.2


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