영역 확장을 이용한 이동 로봇의 경로 설정
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 곽재혁 | - |
dc.contributor.author | 임준홍 | - |
dc.date.accessioned | 2021-06-23T23:37:53Z | - |
dc.date.available | 2021-06-23T23:37:53Z | - |
dc.date.issued | 2005-05 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/45940 | - |
dc.description.abstract | In this paper, an algorithm of path planning and obstacle avoidance for mobile robot is proposed. We call the proposed method Random Access Sequence (RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors. By processing assigned numbers all regions are covered and then the path from start to destination is selected by these numbers. The RAS has an advantage of fast planning because of simple operations. This implies that new path selection may be possible within a short time and helps a robot to avoid obstacles in any direction. The algorithm can be applied to unknown environments. When moving obstacles appear, a mobile robot avoids obstacles reactively, then new path is selected by RAS. | - |
dc.format.extent | 3 | - |
dc.language | 한국어 | - |
dc.language.iso | KOR | - |
dc.publisher | 대한전기학회 | - |
dc.title | 영역 확장을 이용한 이동 로봇의 경로 설정 | - |
dc.title.alternative | Path Planning Algorithm for Mobile Robot using Region Extension | - |
dc.type | Article | - |
dc.publisher.location | 대한민국 | - |
dc.identifier.bibliographicCitation | 2005 정보 및 제어 심포지엄 논문집(ICS '05), pp 249 - 251 | - |
dc.citation.title | 2005 정보 및 제어 심포지엄 논문집(ICS '05) | - |
dc.citation.startPage | 249 | - |
dc.citation.endPage | 251 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | other | - |
dc.subject.keywordAuthor | path planning | - |
dc.subject.keywordAuthor | region extension | - |
dc.subject.keywordAuthor | density | - |
dc.subject.keywordAuthor | mobile robot | - |
dc.identifier.url | https://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE01339962 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.