• 제어로봇시스템학회논문지
• /
• 제12권5호
• /
• pp.489-496
• /
• 2006

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.

• 한국컴퓨터정보학회논문지
• /
• 제13권3호
• /
• pp.85-90
• /
• 2008

본 논문에서는 가장 덜 복잡한 공간부터 청소하는 공간 효율적인 새로운 로봇 청소 알고리즘인 SetClean 알고리즘을 제안한다. 청소 완료 시간이 길어지거나, 예측하기 어려운 경우에는 전체 청소 완료시간을 최적화하기보다는 가능한 빠른 시간에 가장 넓은 공간을 최대한 청소하는 것이 유리한 경우가 있다. 이를 위해 SetClean 알고리즘에서는 전체 공간을 셋 커버 알고리즘을 이용하여 청소 가능한 공간으로 구분하고, 단위 시간 당 청소 효율이 가장 높은 공간부터 청소를 진행하게 된다. SetClean 알고리즘은 해당 청소 가능 구역의 면적뿐만 아니라 로봇의 현재위치로부터 해당 청소 구역까지의 이동 거리, 청소 구역 내에서의 로봇의 회전으로 인한 지연 시간 등을 고려하여 최적의 청소 순서를 결정한다. 실험을 통해 SetClean 알고리즘의 동작 과정 및 성능을 보여준다.

• KEPCO Journal on Electric Power and Energy
• /
• 제7권1호
• /
• pp.79-84
• /
• 2021

The fundamental element to be kept for big data analysis, artificial intelligence technologies and asset management system is a data quality, which could directly affect the entire system reliability. For this reason, the momentum of data cleaning works is recently increased and data cleaning methods have been investigating around the world. In the field of electric power, however, asset data cleaning methods have not been fully determined therefore, automatic cleaning algorithm of asset data for transmission cables has been studied in this paper. Cleaning algorithm is composed of missing data treatment and outlier data one. Rule-based and expert opinion based cleaning methods are converged and utilized for these dirty data.

• KEPCO Journal on Electric Power and Energy
• /
• 제7권1호
• /
• pp.73-77
• /
• 2021

As the big data analysis technologies has been developed worldwide, the importance of asset management for electric power facilities based data analysis is increasing. It is essential to secure quality of data that will determine the performance of the RISK evaluation algorithm for asset management. To improve reliability of asset management, asset data must be preprocessed. In particular, the process of cleaning dirty data is required, and it is also urgent to develop an algorithm to reduce time and improve accuracy for data treatment. In this paper, the result of the development of an automatic cleaning algorithm specialized in overhead transmission asset data is presented. A data cleaning algorithm was developed to enable data clean by analyzing quality and overall pattern of raw data.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제35권5호
• /
• pp.297-305
• /
• 2008

청소 로봇은 지도 작성 및 위치 인식을 기준으로 청소 방법을 랜덤(random)방식과 매핑(mapping)방식으로 분류 할 수 있다. 랜덤방식은 지도를 작성하지 않아 가격경쟁력이 있지만 효율이 떨어진다. 반면, 매핑방식은 지도를 작성하므로 청소 효율이 높지만 상대적인 가격경쟁력이 떨어진다. 그러므로 랜덤방식과 매핑방식의 문제점들을 보안하기 위해 본 논문은 고가의 센서 정보를 사용하지 않고 사람이 청소 로봇에게 청소 공간에 대한 정보를 알려주며, 이 정보를 이용하여 기존의 청소 로봇보다 효율적이고 저렴한 청소 로봇을 제안한다. 또한 기존의 청소 로봇과 본 논문에서 제안한 청소 로봇과의 성능 비교를 통해서 본 논문에서 제안한 방식의 효율성을 보인다.

• 동력기계공학회지
• /
• 제21권4호
• /
• pp.26-33
• /
• 2017

In this paper, we developed a control algorithm to maximize the cleaning performance and the cleaning efficiency of the underwater cleaning robot platform which has been developed for various cistern environment in the industrial field. Through these research and development, we have presented the operation and application of underwater cleaning robots that have been developed, and contributed to commercialization. Finally, this results were verified the effectiveness through actual field experiments.

• 대한건축학회논문집:구조계
• /
• 제36권5호
• /
• pp.187-194
• /
• 2020

This study presents the energy-saving sequential control algorithm to handle indoor CO₂ and PM2.5 for the improvement of the air quality of school classrooms. To solve indoor air quality (IAQ) problems, air cleaning and ventilation systems are mainly used for school classrooms. Although air cleaning is able to collect PM2.5, it is difficult to remove harmful gas substances. The ventilation system is suitable to tackle CO and CO₂, the volume ventilation, however, is relatively small. In this paper, to remove CO₂ and PM2.5, the pollutant balance equation for improving indoor air quality is reviewed. The sequential control algorithm of the ventilation and air cleaning system with four levels of criteria is introduced for the effective removal of pollutants. The proposed sequential control algorithm confirms that indoor CO₂ and PM2.5 can be properly controlled below the standard value. In addition, the sequential operation of air cleaning and ventilation systems has shown significant improvement in IAQ compared to the independent ventilation system operation. Particularly, such systems are efficient when outdoor PM2.5 is high.

• 제어로봇시스템학회논문지
• /
• 제11권9호
• /
• pp.789-794
• /
• 2005

This paper describes an algorithm for minimal turning complete coverage Path planning for cleaning robots. This algorithm divides the whole cleaning area by cellular decomposition, and then provides the path planning among the cells employing a flow network. It also provides specific path planning inside each cell guaranteeing the minimal turning of the robots. The minimal turning of the robots is directly related to the faster motion and energy saving. The proposed algorithm is compared with previous approaches in simulation and the result shows the validity of the algorithm.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.252-254
• /
• 2005

Completer coverage path planning requires the robot path to cover every part of the workspace, which is an essential issue in cleaning robots and many other robotic applications such as vacuum robots and painter robots. In this paper, a novel Water Flowing Algorithm (WFA) is proposed for cleaning robots to complete coverage path planning in unknown environment without obstacles. The robot covers the whole workspace just like that water fills up a container. First the robot goes to the lowest point in the workspace just like water flows to the bottom of the container. At last the robot will come to highest point in the workspace just like water overflows from the container and simultaneously the robot has covered the whole workspace. The computer simulation results show that the proposed algorithm enable the robot to plan complete coverage paths.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2002년도 ICCAS
• /
• pp.108.1-108
• /
• 2002

This paper is willing to propose a method of wall tracing, a moving algorithm between two points, when a Cleaning robot between two points moves. We use the information about obstacles and wall side in calculating different weight vector the each infrared sensors in cleaning robot. Therefore the cleaning robot navigates the wall. In the algorithm of wall tracing, the value of error in angle and distance between starting point and ending point should be zero to navigate the wall safely. The propriety of algorithm of the wall tracing is simulated as this method by using Visual C++. The result simulated proved to the simulation.