메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술대회자료
저자정보
L.S.R. Mechsy (University of Moratuwa) M.U.B. Dias (University of Moratuwa) W. Pragithmukar (University of Moratuwa) A.L. Kulasekera (University of Moratuwa)
저널정보
제어로봇시스템학회 제어로봇시스템학회 국제학술대회 논문집 ICCAS 2017
발행연도
2017.10
수록면
218 - 223 (6page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
This paper presents a solution to the problem of 2D coverage path planning (CPP) for a tethered robot where the tether is of a constraint length connected to a fixed point in a known environment. Limited research has been done in this problem area hence there is a lack of algorithms providing CPP in the literature. CPP algorithms are highly useful in various applications such as search and rescue robots, cleaning robots, area exploration robots, agricultural robots and lawn maintenance robots. The path planning algorithm discussed here can be used in an environment having a defined boundary with an a priori map. The given algorithm enables the robot to take an optimum path while detecting, avoiding static obstacles and preventing entanglements of the tether. An occupancy grid map based approach is used here. The algorithm is applicable to a system with a mechanism to retract and extend the tether when required either mounted on the robot or a fixed base. The proposed novel algorithm to the problem assures coverage of all accessible grids in the map. The implementation and the scalability of the algorithm has also been validated using simulation in MATLAB.

목차

Abstract
1. INTRODUCTION
2. STATE OF THE ART
3. PROBLEM DESCRIPTION
4. OPTIMAL OFFLINE TETHERED COVERAGE
5. SIMULATION RESULTS
6. CONCLUSION
REFERENCES

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2018-003-001426151