메뉴 건너뛰기




Volumn 3, Issue , 2010, Pages 1980-1981

On multi-robot area coverage

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; INDUSTRIAL ROBOTS;

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

References (10)
  • 1
    • 64749092245 scopus 로고    scopus 로고
    • The giving tree: Constructing trees for efficient offline and online multi-robot coverage
    • Agmon, N.; Hazon, N.; and Kaminka, G. A. 2008. The giving tree: constructing trees for efficient offline and online multi-robot coverage. Annals of Mathematics and Artificial Intelligence 52(2-4): 143-168.
    • (2008) Annals of Mathematics and Artificial Intelligence , vol.52 , Issue.2-4 , pp. 143-168
    • Agmon, N.1    Hazon, N.2    Kaminka, G.A.3
  • 2
    • 0035616724 scopus 로고    scopus 로고
    • Coverage for robotics - A survey of recent results
    • Choset, H. 2001. Coverage for robotics - a survey of recent results. Annals of Mathematics and Artificial Intelligence 31(1-4): 113-126.
    • (2001) Annals of Mathematics and Artificial Intelligence , vol.31 , Issue.1-4 , pp. 113-126
    • Choset, H.1
  • 8
    • 45749152580 scopus 로고    scopus 로고
    • Computing multiple watchman routes
    • McGeoch, C. C, ed., 7th International Workshop on Experimental Algorithms, WEA. Springer
    • Packer, E. 2008. Computing multiple watchman routes. In McGeoch, C. C, ed., 7th International Workshop on Experimental Algorithms, WEA, volume 5038 of Lecture Notes in Computer Science, 114-128. Springer.
    • (2008) Lecture Notes in Computer Science , vol.5038 , pp. 114-128
    • Packer, E.1


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