### Abstract

The goal of the path planning problem is to determine an optimal collision-free path between a start and a target point for a mobile robot in an environment surrounded by obstacles. This problem belongs to the group of combinatorial optimization problems which are approached by modern optimization techniques such as evolutionary algorithms. In this paper the bacterial memetic algorithm is proposed for path planning of a mobile robot. The objective is to minimize the path length and the number of turns without colliding with an obstacle. The representation used in the paper fits well to the algorithm. Memetic algorithms combine evolutionary algorithms with local search heuristics in order to speed up the evolutionary process. The bacterial memetic algorithm applies the bacterial operators instead of the genetic algorithm's crossover and mutation operator. One advantage of these operators is that they easily can handle individuals with different length. The method is able to generate a collision-free path for the robot even in complicated search spaces. The proposed algorithm is tested in real environment.

Original language | English |
---|---|

Pages (from-to) | 73-86 |

Number of pages | 14 |

Journal | Memetic Computing |

Volume | 4 |

Issue number | 1 |

DOIs | |

Publication status | Published - Mar 1 2012 |

### Fingerprint

### Keywords

- Bacterial memetic algorithm
- Path planning

### ASJC Scopus subject areas

- Computer Science(all)
- Control and Optimization

### Cite this

*Memetic Computing*,

*4*(1), 73-86. https://doi.org/10.1007/s12293-012-0076-0