메뉴 건너뛰기




Volumn , Issue , 2004, Pages 786-791

A fast algorithm to plan a collision-free path in cluttered 2D environments

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MATHEMATICAL TRANSFORMATIONS; MOBILE ROBOTS; ARRAYS; CONSTRAINT THEORY; DATA STRUCTURES; GRAPH THEORY; MOTION PLANNING; PROBABILITY; PROBLEM SOLVING; ROBOTICS;

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

References (7)
  • 1
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • E.W. Dijkstra. A Note on Two Problems in Connexion with Graphs, Numerische Mathematik, pp. 269-271, 1959
    • (1959) Numerische Mathematik , pp. 269-271
    • Dijkstra, E.W.1
  • 4
    • 0000629945 scopus 로고
    • Planning paths of complete coverage of an unstructured environment by a mobile robot
    • Tokyo, Japan
    • A. Zelinsky, R.A. Jarvis, J.C. Byme and S. Yuta Planning Paths of Complete Coverage of an Unstructured Environment by a Mobile Robot, Proc. of Int'l Conf. on Advanced Robotics, pp533-538, Tokyo, Japan, 1993.
    • (1993) Proc. of Int'l Conf. on Advanced Robotics , pp. 533-538
    • Zelinsky, A.1    Jarvis, R.A.2    Byme, J.C.3    Yuta, S.4


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