Optimal area covering using genetic algorithms

Authors

Paulo A. Jimenez, Monash University
Bijan Shirinzadeh, Monash University
Ann Nicholson, Monash University
Gursel Alici, University of WollongongFollow

RIS ID

22407

Publication Details

Jimenez, P. A., Shirinzadeh, B., Nicholson, A. & Alici, G. (2007). Optimal area covering using genetic algorithms. 2007 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (pp. 1-6). Switzerland: IEEE.

Abstract

Path planning problems involve computing or finding a collision free path between two positions. A special kind of path planning is complete coverage path planning, where a robot sweeps all area of free space in an environment. There are different methods to cover the complete area; however, they are not designed to optimize the process. This paper proposes a novel method of complete coverage path planning based on genetic algorithms. In order to check the viability of this approach the optimal path is tested in a virtual environment. The simulation results confirm the feasibility of this method.