메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1310-1315

Anytime, dynamic planning in high-dimensional search spaces

Author keywords

[No Author keywords available]

Indexed keywords

IMPROVEMENT BOUND; SEARCH PROBLEMS; SEARCH SPACES; SIMULATED MULTIROBOT PLANNING;

EID: 36349012454     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2007.363166     Document Type: Conference Paper
Times cited : (58)

References (13)
  • 1
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • E. Dijkstra. "A note on two problems in connexion with graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.1
  • 13
    • 36348997324 scopus 로고    scopus 로고
    • Single Agent and Multi-agent Path Planning in Unknown and Dynamic Environments,
    • Ph.D. dissertation, Carnegie Mellon University
    • D. Ferguson, "Single Agent and Multi-agent Path Planning in Unknown and Dynamic Environments," Ph.D. dissertation, Carnegie Mellon University, 2006.
    • (2006)
    • Ferguson, D.1


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