Path planning for mobile robots by bacterial memetic algorithm

János Botzheim; Yuichiro Toda; Naoyuki Kubota

doi:10.1109/RIISS.2011.5945787

Path planning for mobile robots by bacterial memetic algorithm

János Botzheim, Yuichiro Toda, Naoyuki Kubota

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 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 language	English
Title of host publication	IEEE SSCI 2011
Subtitle of host publication	Symposium Series on Computational Intelligence - RIISS 2011: 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space
Pages	107-112
Number of pages	6
DOIs	https://doi.org/10.1109/RIISS.2011.5945787
Publication status	Published - Aug 12 2011
Externally published	Yes
Event	Symposium Series on Computational Intelligence, IEEE SSCI 2011 - 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space, RIISS 2011 - Paris, France Duration: Apr 11 2011 → Apr 15 2011

Publication series

Name	IEEE SSCI 2011: Symposium Series on Computational Intelligence - RIISS 2011: 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space

Other

Other	Symposium Series on Computational Intelligence, IEEE SSCI 2011 - 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space, RIISS 2011
Country/Territory	France
City	Paris
Period	4/11/11 → 4/15/11

ASJC Scopus subject areas

Artificial Intelligence
Computer Vision and Pattern Recognition
Information Systems

Access to Document

10.1109/RIISS.2011.5945787

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). Article 5945787 (IEEE SSCI 2011: Symposium Series on Computational Intelligence - RIISS 2011: 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space). 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 (IEEE SSCI 2011: Symposium Series on Computational Intelligence - RIISS 2011: 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space).

Research output: Chapter in Book/Report/Conference proceeding › Conference 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, IEEE SSCI 2011: Symposium Series on Computational Intelligence - RIISS 2011: 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space, 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. (IEEE SSCI 2011: Symposium Series on Computational Intelligence - RIISS 2011: 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space). doi: 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 (IEEE SSCI 2011: Symposium Series on Computational Intelligence - RIISS 2011: 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space).

@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 = aug,

day = "12",

doi = "10.1109/RIISS.2011.5945787",

language = "English",

isbn = "9781424498840",

series = "IEEE SSCI 2011: Symposium Series on Computational Intelligence - RIISS 2011: 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space",

pages = "107--112",

booktitle = "IEEE SSCI 2011",

note = "Symposium Series on Computational Intelligence, IEEE SSCI 2011 - 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space, RIISS 2011 ; Conference date: 11-04-2011 Through 15-04-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

T3 - IEEE SSCI 2011: Symposium Series on Computational Intelligence - RIISS 2011: 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space

SP - 107

EP - 112

BT - IEEE SSCI 2011

T2 - Symposium Series on Computational Intelligence, IEEE SSCI 2011 - 2011 IEEE Workshop on Robotic Intelligence in Informationally Structured Space, RIISS 2011

Y2 - 11 April 2011 through 15 April 2011

ER -

Path planning for mobile robots by bacterial memetic algorithm

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this