지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술대회자료
- 저자정보
- 발행연도
- 2013.10
- 수록면
- 1,094 - 1,099 (6page)
이용수
초록· 키워드
오류제보하기
Path planning algorithms for multiple robots have been needed and developed as the use of robots in industrial setting has been increased. The issue of multiple robots’ path planning in many researches is to guarantee completeness and scalability. Recently, a couple of papers considered the issue by using the graph theory in roadmap representation. However, to move all robots to their goals with the results, it takes long time although they guarantee completeness and scalability. In this paper, we propose a path planning algorithm which can improve the weakness of existing algorithms by moving robots concurrently retaining the completeness and scalability. Thus, the proposed algorithm of this paper presents high work productivity in multiple robots’ path planning.
목차
Abstract
1. INTRODUCTION
2. PRELIMINARY
3. MULTIPLE SHARED CYCLES CHAINS METHOD
4. THREE PHASE CONCURRENT ALGORITHM USING A SHARED CYCLE GRAPH
5. EXAMPLE
6. CONCLUSION
REFERENCES
참고문헌 (0)
참고문헌 신청이 논문의 저자 정보
이 논문과 함께 이용한 논문
A Study on Swarm Robot-Based Invader-Enclosing Technique on Multiple Distributed Object Environments
Kwang-Eun Ko
,
Seung-Min Pa
,
k
외 3명
Journal of Electrical Engineering & Technology
2011
.11
Position Estimation of Mobile Robots using Multiple Active Sensors with Network
TaeSeok Jin
INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGENT SYSTEMS
2011
.12
다 개체 로봇의 협업기법에 관한 연구
최준용
,
김동환
,
이귀형
대한기계학회 논문집 A권
2010
.08
최근 본 자료
댓글(0)
0