Optimization of Floor Cleaning Coverage Performance of a Random Path-Planning Mobile Robot

نویسنده

  • Marcel Tresanchez Ribes
چکیده

Floor cleaning is a typical mobile robot application. Most commercial cleaning mobile robots designed for domestic applications use random path-planning algorithms and very few sensors and the critical problem is to decide when the cleaning is already finished or the coverage completed. In this work, we have simulated and modeled the evolution of the area cleaned by the robot and demonstrate it can be estimated if the size of the area is known, we have proposed some methods to estimate the size of the cleaning area using only the information of encoders and collision detectors. To this end, three typical rooms have been tested with and without furniture. Results show the great influence of furniture distribution in the estimation of the cleaning area of the room.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mobile-robot navigation with complete coverage of unstructured environments

There are some mobile-robot applications that require the complete coverage of an unstructured environment. Examples are humanitarian de-mining and floor-cleaning tasks. A complete-coverage algorithm is then used, a path-planning technique that allows the robot to pass over all points in the environment, avoiding unknown obstacles. Different coverage algorithms exist, but they fail working in u...

متن کامل

Sensor Based Coverage of Unknown Environments for Land Mine Detection

This paper introduces a sensor based coverage algorithm and an overview of a mobile robot system for demining. The algorithm is formulated in terms of critical points which are the points where the topology of an environment changes. We developed a provably complete coverage algorithm which makes a robot pass over all possible points of an unknown environment. Overview of The Coverage Algorithm...

متن کامل

On Complete Coverage Path Planning Algorithms for Non-holonomic Mobile Robots: Survey and Challenges

The problem of determining a collision free path within a region is an important area of research in robotics. One significant aspect of this problem is coverage path planning, which is a process to find a path that passes through each reachable position in the desired area. This task is fundamental to many robotic applications such as cleaning, painting, underwater operations, mine sweeping, l...

متن کامل

Coverage Path Planning for Mobile Cleaning Robots

In this paper a path planning algorithms for a mobile cleaning robot is developed. An exact cellular decomposition divides an environment in multiple smaller regions called cells. To produce an efficient cleaning path, the order in which these cells are cleaned is important. This paper describes how the optimalization of this path can be formulated as a Traveling Salesman Problem. Furthermore a...

متن کامل

Optimal Trajectory Planning of a Mobile Robot with Spatial Manipulator For Spatial Obstacle Avoidance

Mobile robots that consist of a mobile platform with one or many manipulators mounted on it are of great interest in a number of applications. Combination of platform and manipulator causes robot operates in extended work space. The analysis of these systems includes kinematics redundancy that makes more complicated problem. However, it gives more feasibility to robotic systems because of the e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007