The path planning of cleaner robot for coverage region using Genetic Algorithms

https://doi.org/10.1016/j.jides.2016.05.004Get rights and content
Under a Creative Commons license
open access

Highlights

  • Method for the path planning of cleaner robot for coverage region.

  • Genetic Algorithms approach.

  • To demonstrate the efficiency and feasibility of our approache and validate the results obtained, we conducted a numerical comparison.

Abstract

The vacuum cleaner robot should have a mechanism such as the artificial intelligence to solve the problem of cleaning the entire environment areas taking into account some factors such as the number of turns and the length of the trajectory. This robot’s mechanism or task is known as the path planning of coverage region (PPCR). In this paper, to resolve the problem of PPCR in a room environment, we propose an evolutionary approach. The latter is based on Genetic Algorithms (GA) which, consist of several steps to get the solutions. Each gene represents the robot position and some of chromosomes represent also the mini-path. In addition, this algorithm helps the robot to pass through every part of the environment by avoiding obstacles using different sensors. The results of simulation and comparison studies demonstrate the effectiveness and efficiency of the proposed approach.

Keywords

Vacuum cleaner robot
Artificial intelligence
Path planning coverage region
Genetic Algorithms

Cited by (0)

Peer review under responsibility of Qassim University.