복잡한 공간에서 그룹화 기반의실용적 지능형 청소 로봇 알고리즘Practical Intelligent Cleaning Robot AlgorithmBased on Grouping in Complex Layout Space
- Other Titles
- Practical Intelligent Cleaning Robot AlgorithmBased on Grouping in Complex Layout Space
- Authors
- 전흥석; 조재욱; 노삼혁
- Issue Date
- 2006
- Publisher
- 제어·로봇·시스템학회
- Keywords
- cleaning robot; obstacle avoidance; cleaning algorithm; Group-k; cleaning robot; obstacle avoidance; cleaning algorithm; Group-k
- Citation
- 제어.로봇.시스템학회 논문지, v.12, no.5, pp.489 - 496
- Journal Title
- 제어.로봇.시스템학회 논문지
- Volume
- 12
- Number
- 5
- Start Page
- 489
- End Page
- 496
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/24897
- ISSN
- 1976-5622
- Abstract
- The random-based cleaning algorithm is a simple algorithm widely used in commercial vacuum cleaning robots. This algorithm has two limitations, that is, cleaning takes a long time and there is no guarantee that the cleaning will cover the whole cleaning area. This has lead to customer dissatisfaction. Thus, in recent years, many intelligent cleaning algorithms that takes into consideration information gathered from the cleaning area environment have been proposed. The plowing-based algorithm, which is the most efficient algorithm known to date when there are no obstacles in the cleaning area, has a deficiency that when obstacle prevail, its performance is not guaranteed. In this paper, we propose the Group-k algorithm that is efficient for that situation, that is, when obstacle prevail. The goal is not to complete the cleaning as soon as possible, but to clean the majority of the cleaning area as fast as possible. The motivation behind this is that areas close to obstacles are usually difficult for robots to handle, and hence, many require human assistance anyway. In our approach, obstacles are grouped by the complexity of the obstacles, which we refer to as 'complex rank', and then decide the cleaning route based on this complex rank. Results from our simulation-based experiments show that although the cleaning completion time takes longer than the plowing-based algorithm, the Group-k algorithm cleans the majority of the cleaning area faster than the plowing algorithm.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Computer Engineering Major > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/24897)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.