최소영역 정보를 이용한 이동로봇의 경로설정 알고리즘
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 임준홍 | - |
dc.date.accessioned | 2021-06-23T13:04:52Z | - |
dc.date.available | 2021-06-23T13:04:52Z | - |
dc.date.created | 2021-02-18 | - |
dc.date.issued | 2010-06 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/39743 | - |
dc.description.abstract | Using informations from various sensors, we can find obstacles and make a path. In spite of many solutions of finding optimal path, each can be applied to only a constrained condition. This means that it is difficult to find a universal algorithm. A optimal path with a complicated computation generates a time delay which cannot avoid moving obstacles. For reducing the path information, we proposed a method of region separation. | - |
dc.publisher | 대한전자공학회 | - |
dc.title | 최소영역 정보를 이용한 이동로봇의 경로설정 알고리즘 | - |
dc.title.alternative | The Path Planning Algorithm for Mobile Robot Using Minimum Space Information | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | 임준홍 | - |
dc.identifier.bibliographicCitation | 2010년도 대한전자공학회 하계학술대회, v.33, no.1, pp.1332 - 1334 | - |
dc.relation.isPartOf | 2010년도 대한전자공학회 하계학술대회 | - |
dc.citation.title | 2010년도 대한전자공학회 하계학술대회 | - |
dc.citation.volume | 33 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 1332 | - |
dc.citation.endPage | 1334 | - |
dc.type.rims | ART | - |
dc.description.journalClass | 3 | - |
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.