File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

노삼혁

Noh, Sam H.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.endPage 107 -
dc.citation.number 2 -
dc.citation.startPage 101 -
dc.citation.title 대한임베디드공학회논문지 -
dc.citation.volume 9 -
dc.contributor.author Park, Jung Kyu -
dc.contributor.author Jeon, Heung Seok -
dc.contributor.author Noh, Sam H. -
dc.date.accessioned 2023-12-22T02:43:12Z -
dc.date.available 2023-12-22T02:43:12Z -
dc.date.created 2016-02-16 -
dc.date.issued 2014-04 -
dc.description.abstract Mobile robots use an environment map of its workspace to complete the surveillance task. However grid-based maps that are commonly used map format for mobile robot navigation use a large size of memory for accurate representation of environment. In this reason, grid-based maps are not suitable for path planning of mobile robots using embedded board. In this paper, we present the path planning algorithm that produce a secure path rapidly. The proposed approach utilizes a hybrid map that uses less memory than grid map and has same efficiency of a topological map. Experimental results show that the fast path planning uses only 1.5% of the time that a grid map based path planning requires. And the results show a secure path for mobile robot. -
dc.identifier.bibliographicCitation 대한임베디드공학회논문지, v.9, no.2, pp.101 - 107 -
dc.identifier.doi 10.14372/IEMEK.2014.9.2.101 -
dc.identifier.issn 1975-5066 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/18983 -
dc.identifier.url http://scholar.ndsl.kr/schArticleDetail.do?cn=JAKO201415641085352 -
dc.language 한국어 -
dc.publisher 대한임베디드공학회 -
dc.title 모바일 로봇의 네비게이션을 위한 빠른 경로 생성 알고리즘 -
dc.type Article -
dc.description.journalRegisteredClass kci -
dc.description.journalRegisteredClass other -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.