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)

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.endPage 2002 -
dc.citation.number 6A -
dc.citation.startPage 1991 -
dc.citation.title INFORMATION -
dc.citation.volume 19 -
dc.contributor.author Park, Jung Kyu -
dc.date.accessioned 2023-12-21T23:39:11Z -
dc.date.available 2023-12-21T23:39:11Z -
dc.date.created 2016-09-19 -
dc.date.issued 2016-06 -
dc.description.abstract In this paper, we propose a new on-line coverage algorithm, which we call deadline coverage. The algorithm has an assumption that robot does not know the map of environments for coverage in advance. To cope with the unknown environment, deadline coverage algorithm integrates with a SLAM solution. Because the robot does not know the map for coverage in advance, not like the previous coverage, the goal of deadline coverage algorithm is not to minimize the complete coverage time but to maximize the coverage efficiency in real time. Experimental results show that the deadline coverage algorithm outperforms previous algorithms for unknown environments. -
dc.identifier.bibliographicCitation INFORMATION, v.19, no.6A, pp.1991 - 2002 -
dc.identifier.issn 1343-4500 -
dc.identifier.scopusid 2-s2.0-84985997747 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/20461 -
dc.identifier.url http://www.information-iii.org/abs_e2.html#No6(A)-2016 -
dc.language 영어 -
dc.publisher International Information Institute Ltd. -
dc.title An on-line incremental robot coverage algorithm integrated with SLAM for unknown environments -
dc.type Article -
dc.description.journalRegisteredClass scopus -
dc.subject.keywordAuthor Coverage algorithm -
dc.subject.keywordAuthor Mapping -
dc.subject.keywordAuthor Mobile robot -
dc.subject.keywordAuthor SLAM -

qrcode

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