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

추천
검색
질문

논문 기본 정보

자료유형
학술대회자료
저자정보
저널정보
제어로봇시스템학회 제어로봇시스템학회 국제학술대회 논문집 ICCAS 2016
발행연도
2016.10
수록면
269 - 272 (4page)

이용수

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

초록· 키워드

오류제보하기
In this work, we consider the problem of robot warehouse systems using Automated Guided Vehicle (AGV). The problem consists of a transportation of multiple items to stations that make request. We use multi-robot systems to collect and deliver those items from their location back to the station with restriction on the limit carrying capacity. The environment is a simulated warehouse consisting of markers as nodes for robots travel. Since finding the optimum solution is an NP-hard problem, the greedy method is utilized. We use the Manhattan distance to approximate the nearest item for each robot and employed Dijkstras algorithm for path planning and obstacle avoidance. Moreover, we use the local search to find nearby target items. We compare two collection strategies, namely the individual collection method that let each robot takes responsibility for its own station and the collaborative collection method that allows robots take nearest items and deliver them to all stations. The performance of both methods has been verified by the simulation using MATLAB. The collaborative collection method is able to surpass the individual collection method with up to 15.4% reduction in maximum traveling cost.

목차

Abstract
1. INTRODUCTION
2. PROBLEM AND METHODOLOGY
3. EXPERIMENTATION AND ANALYSIS
4. CONCLUSIONS
REFERENCES

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

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

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2017-003-001868297