메뉴 건너뛰기

ENG

추천
검색
질문

논문 기본 정보

자료유형
학술대회자료
저자정보
(Hongik University) (Konkuk University) (Hongik University) (TELECOMLAND) (Chungju National University)
저널정보
제어로봇시스템학회 제어로봇시스템학회 국제학술대회 논문집 ICCAS 2010
발행연도
수록면
299 - 303 (5page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
이 논문의 연구방법이 궁금하신가요?
🏆
연구결과
이 논문의 연구결과가 궁금하신가요?
AI에게 요청하기
추천
검색
질문

초록· 키워드

Coverage algorithm is one of the core technologies required for intelligent robots such as cleaning robots, harvesting robots, painting robots and lawn mowing robots. Although many smart coverage algorithms have been proposed, to the best of our knowledge, all of them make the same assumption that they have sufficient time to cover the entire target area. However, the time to completely cover the whole target area may not always be available. Therefore, in this paper, we propose another new coverage scheme, which we call the DmaxCoverage algorithm, that decides the coverage path by considering the deadline for coverage. This approach can be beneficial when the time for the coverage is not sufficient to cover the entire target area. Experimental results show that the DmaxCoverage algorithm outperforms previous algorithms for these situations.
#Mobile Robot #SLAM #Coverage algorithm
상세정보 수정요청해당 페이지 내 제목·저자·목차·페이지
정보가 잘못된 경우 알려주세요!

목차

  1. Abstract
  2. 1. INTRODUCTION
  3. 2. RELATED WORK
  4. 3. DMAXCOVERAGE ALGORIHTM
  5. 4. EXPERIMENTAL RESULTS
  6. 5. CONCLUSION
  7. REFERENCES

참고문헌

참고문헌 신청

최근 본 자료

전체보기
260319_딥리서치
260319_AI리더
260304_새학기에이전트
260420 이주의질문
260122_AIagent
260304_아그논문롤
260127_아그논문
260127_AI뷰어
UCI(KEPA) : I410-ECN-0101-2014-569-000937129