- HOME
- 기술정보
- 논문
논문
논문 기본정보
멀티로봇에 대한 전체영역 경로계획
논문 개요
| 기관명 | NDSL |
|---|---|
| 저널명 | 한국정밀공학회지 = Journal of the Korean Society of Precision Engineering |
| ISSN | 1225-9071, |
| ISBN |
논문저자 및 소속기관 정보
| 저자(한글) | 남상현,신익상,김재준,이순걸 |
|---|---|
| 저자(영문) | |
| 소속기관 | |
| 소속기관(영문) | |
| 출판인 | |
| 간행물 번호 | |
| 발행연도 | 2009-01-01 |
| 초록 | This paper describes a path planning algorithm, which is the minimal turning path based on the shape and size of the cell to clean up the whole area with two cleaning robots. Our method divides the whole cleaning area with each cell by cellular decomposition, and then provides some path plans among of the robots to reduce the rate of energy consumption and cleaning time of it. In addition we suggest how to plan between the robots especially when they are cleaning in the same cell. Finally simulation results demonstrate the effectiveness of the algorithm in an unknown area with multiple robots. And then we compare the performance index of two algorithms such as total of turn, total of time. |
| 원문URL | http://click.ndsl.kr/servlet/OpenAPIDetailView?keyValue=03553784&target=NART&cn=JAKO200921752338077 |
| 첨부파일 |
추가정보
| 과학기술표준분류 | |
|---|---|
| ICT 기술분류 | |
| DDC 분류 | |
| 주제어 (키워드) | 전체영역경로계획,셀분할,청소로봇,멀티로봇,Complete Coverage Path Planning,Cellular Decomposition,Cleaning Robot,Multi-robot |