Path planning for mobile robots by bacterial memetic algorithm

János Botzheim, Yuichiro Toda, Naoyuki Kubota

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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 hard optimization problems which can be 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 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 proposed algorithm is tested in real environment.

Original languageEnglish
Title of host publicationIEEE SSCI 2011
Subtitle of host publicationSymposium Series on Computational Intelligence - RIISS 2011: 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space
Pages107-112
Number of pages6
DOIs
Publication statusPublished - Aug 12 2011
Externally publishedYes
EventSymposium Series on Computational Intelligence, IEEE SSCI 2011 - 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space, RIISS 2011 - Paris, France
Duration: Apr 11 2011Apr 15 2011

Other

OtherSymposium Series on Computational Intelligence, IEEE SSCI 2011 - 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space, RIISS 2011
CountryFrance
CityParis
Period4/11/114/15/11

Fingerprint

Motion planning
Mobile robots
Evolutionary algorithms
Mathematical operators
Genetic algorithms

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Vision and Pattern Recognition
  • Information Systems

Cite this

Botzheim, J., Toda, Y., & Kubota, N. (2011). Path planning for mobile robots by bacterial memetic algorithm. In IEEE SSCI 2011: Symposium Series on Computational Intelligence - RIISS 2011: 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space (pp. 107-112). [5945787] https://doi.org/10.1109/RIISS.2011.5945787

Path planning for mobile robots by bacterial memetic algorithm. / Botzheim, János; Toda, Yuichiro; Kubota, Naoyuki.

IEEE SSCI 2011: Symposium Series on Computational Intelligence - RIISS 2011: 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space. 2011. p. 107-112 5945787.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Botzheim, J, Toda, Y & Kubota, N 2011, Path planning for mobile robots by bacterial memetic algorithm. in IEEE SSCI 2011: Symposium Series on Computational Intelligence - RIISS 2011: 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space., 5945787, pp. 107-112, Symposium Series on Computational Intelligence, IEEE SSCI 2011 - 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space, RIISS 2011, Paris, France, 4/11/11. https://doi.org/10.1109/RIISS.2011.5945787
Botzheim J, Toda Y, Kubota N. Path planning for mobile robots by bacterial memetic algorithm. In IEEE SSCI 2011: Symposium Series on Computational Intelligence - RIISS 2011: 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space. 2011. p. 107-112. 5945787 https://doi.org/10.1109/RIISS.2011.5945787
Botzheim, János ; Toda, Yuichiro ; Kubota, Naoyuki. / Path planning for mobile robots by bacterial memetic algorithm. IEEE SSCI 2011: Symposium Series on Computational Intelligence - RIISS 2011: 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space. 2011. pp. 107-112
@inproceedings{b58ecd5814544841862df25f00a629f2,
title = "Path planning for mobile robots by bacterial memetic algorithm",
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 hard optimization problems which can be 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 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 proposed algorithm is tested in real environment.",
author = "J{\'a}nos Botzheim and Yuichiro Toda and Naoyuki Kubota",
year = "2011",
month = "8",
day = "12",
doi = "10.1109/RIISS.2011.5945787",
language = "English",
isbn = "9781424498840",
pages = "107--112",
booktitle = "IEEE SSCI 2011",

}

TY - GEN

T1 - Path planning for mobile robots by bacterial memetic algorithm

AU - Botzheim, János

AU - Toda, Yuichiro

AU - Kubota, Naoyuki

PY - 2011/8/12

Y1 - 2011/8/12

N2 - 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 hard optimization problems which can be 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 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 proposed algorithm is tested in real environment.

AB - 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 hard optimization problems which can be 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 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 proposed algorithm is tested in real environment.

UR - http://www.scopus.com/inward/record.url?scp=79961227053&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79961227053&partnerID=8YFLogxK

U2 - 10.1109/RIISS.2011.5945787

DO - 10.1109/RIISS.2011.5945787

M3 - Conference contribution

AN - SCOPUS:79961227053

SN - 9781424498840

SP - 107

EP - 112

BT - IEEE SSCI 2011

ER -