메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 1698-1703

Constructing spanning trees for efficient multi-robot coverage

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MOBILE ROBOTS; OPTIMIZATION; PROBLEM SOLVING;

EID: 33845605935     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2006.1641951     Document Type: Conference Paper
Times cited : (92)

References (10)
  • 3
    • 0035635030 scopus 로고    scopus 로고
    • Spanning-tree based coverage of continuous areas by a mobile robot
    • Y. Gabriely and E. Rimon. Spanning-tree based coverage of continuous areas by a mobile robot. Ann. Math. Artif. Intell., 31(1-4):77-98, 2001.
    • (2001) Ann. Math. Artif. Intell. , vol.31 , Issue.1-4 , pp. 77-98
    • Gabriely, Y.1    Rimon, E.2
  • 4
    • 84867953364 scopus 로고    scopus 로고
    • Competitive on-line coverage of grid environments by a mobile robot
    • Y. Gabriely and E. Rimon. Competitive on-line coverage of grid environments by a mobile robot. Comp. Geometry, 24:197-224, 2003.
    • (2003) Comp. Geometry , vol.24 , pp. 197-224
    • Gabriely, Y.1    Rimon, E.2


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