벽추종 경로계획 기반의 효과적인 방 찾기 탐사
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 박중태 | - |
dc.contributor.author | 송재복 | - |
dc.date.accessioned | 2021-09-08T22:53:21Z | - |
dc.date.available | 2021-09-08T22:53:21Z | - |
dc.date.issued | 2009 | - |
dc.identifier.issn | 1976-5622 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/121385 | - |
dc.description.abstract | This paper proposes an exploration strategy to efficiently find a specific place in large unknown environments with wall-following based path planning. Many exploration methods proposed so far showed good performance but they focused only on efficient planning for modeling unknown environments. Therefore, to successfully accomplish the room finding task, two additional requirements should be considered. First, suitable path-planning is needed to recognize the room number. Most conventional exploration schemes used the gradient method to extract the optimal path. In these schemes, the paths are extracted in the middle of the free space which is usually far from the wall. If the robot follows such a path, it is not likely to recognize the room number written on the wall because room numbers are usually too small to be recognized by camera image from a distance. Second, the behavior which re-explores the explored area is needed. Even though the robot completes exploration, it is possible that some rooms are not registered in the constructed map for some reasons such as poor recognition performance, occlusion by a human and so on. With this scheme, the robot does not have to visit and model the whole environment. This proposed method is very simple but it guarantees that the robot can find a specific room in most cases. The proposed exploration strategy was verified by various experiments. | - |
dc.format.extent | 8 | - |
dc.language | 한국어 | - |
dc.language.iso | KOR | - |
dc.publisher | 제어·로봇·시스템학회 | - |
dc.title | 벽추종 경로계획 기반의 효과적인 방 찾기 탐사 | - |
dc.title.alternative | Efficient Exploration for Room Finding Using Wall-Following based Path Planning | - |
dc.type | Article | - |
dc.publisher.location | 대한민국 | - |
dc.identifier.bibliographicCitation | 제어.로봇.시스템학회 논문지, v.15, no.12, pp 1232 - 1239 | - |
dc.citation.title | 제어.로봇.시스템학회 논문지 | - |
dc.citation.volume | 15 | - |
dc.citation.number | 12 | - |
dc.citation.startPage | 1232 | - |
dc.citation.endPage | 1239 | - |
dc.identifier.kciid | ART001392547 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.description.journalRegisteredClass | kci | - |
dc.subject.keywordAuthor | exploration | - |
dc.subject.keywordAuthor | SLAM | - |
dc.subject.keywordAuthor | intelligence | - |
dc.subject.keywordAuthor | mobile robot | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea 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.