Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 임준홍 | - |
dc.date.accessioned | 2020-09-29T01:14:09Z | - |
dc.date.available | 2020-09-29T01:14:09Z | - |
dc.date.issued | 2004-11 | - |
dc.identifier.citation | 2004년도 정보 및 제어 학술대회 논문집, Page.520-522 | en_US |
dc.identifier.uri | http://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE01326527&language=ko_KR | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/154314 | - |
dc.description.abstract | In this paper, we propose the algorithm of path planning and obstacle avoidance for mobile robot. We call method Random Access Sequence(RAS) method. In the proposed method, a smaU region is set frirst and assigned to its neighbors, then the path is selected using these numbers. It has an advantage of fast simple operation. This means that new path selection may be possible within short time and that helps a robot to avoid obstacle in any direction. When a robot meets moving obstacles, it aviods obstacles in a random direction. Sonar ranger is useful to get obstacle information and RAS may be a good solution for path planning. | en_US |
dc.language.iso | ko_KR | en_US |
dc.publisher | 대한전기학회 | en_US |
dc.subject | 이동로봇 | en_US |
dc.subject | 경로설정 | en_US |
dc.subject | 밀도 | en_US |
dc.subject | 장해물 회피 | en_US |
dc.title | 분포밀도를 이용한 이동로봇의 최적경로 | en_US |
dc.title.alternative | A Path Planning of Mobile Robot using Distribution Density | en_US |
dc.type | Article | en_US |
dc.contributor.googleauthor | 곽재혁 | - |
dc.contributor.googleauthor | 임준홍 | - |
dc.sector.campus | E | - |
dc.sector.daehak | COLLEGE OF ENGINEERING SCIENCES[E] | - |
dc.sector.department | DIVISION OF ELECTRICAL ENGINEERING | - |
dc.identifier.pid | jhlim | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.