Cost based navigation for autonomous vacuum cleaners

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In this paper, the Autonomous Vacuum Cleaner Navigation Problem is defined, formulated, and a solution is provided. In the design of an Autonomous Vacuum Cleaner (AVC), the most critical aspect is its navigation. An AVC is required to sweep the whole environment in order to clean it, and hence, this problem belongs to a category of problems known as Coverage Problems. We propose a cost-based navigation algorithm that, at each stage, assigns costs to all the possible moves the AVC can make. These costs are based on certain navigation rules that are preprogrammed into the AVC. After all the rules are applied, the move with the lowest total cost is considered the winning move, and is the one selected by the AVC. The algorithm is tested via simulation, and the simulation results are presented.

Original languageBritish English
Title of host publicationAn Edition of the Presented Papers from the 1st International Conference on Robot Intelligence Technology and Applications
PublisherSpringer Verlag
Pages415-422
Number of pages8
ISBN (Print)9783642373732
DOIs
StatePublished - 2013
Event1st International Conference on Robot Intelligence Technology and Applications, RiTA 2012 - Gwangju, Korea, Republic of
Duration: 16 Dec 201218 Dec 2012

Publication series

NameAdvances in Intelligent Systems and Computing
Volume208 AISC
ISSN (Print)2194-5357

Conference

Conference1st International Conference on Robot Intelligence Technology and Applications, RiTA 2012
Country/TerritoryKorea, Republic of
CityGwangju
Period16/12/1218/12/12

Fingerprint

Dive into the research topics of 'Cost based navigation for autonomous vacuum cleaners'. Together they form a unique fingerprint.

Cite this