2011年
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
- ,
- ,
- 開始ページ
- 107
- 終了ページ
- 112
- 記述言語
- 英語
- 掲載種別
- 研究論文(国際会議プロシーディングス)
- DOI
- 10.1109/RIISS.2011.5945787
- 出版者・発行元
- IEEE
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. © 2011 IEEE.
- リンク情報
-
- DOI
- https://doi.org/10.1109/RIISS.2011.5945787
- DBLP
- https://dblp.uni-trier.de/rec/conf/riiss/BotzheimTK11
- URL
- http://dblp.uni-trier.de/db/conf/riiss/riiss2011.html#conf/riiss/BotzheimTK11
- Scopus
- https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=79961227053&origin=inward
- Scopus Citedby
- https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=79961227053&origin=inward
- ID情報
-
- DOI : 10.1109/RIISS.2011.5945787
- DBLP ID : conf/riiss/BotzheimTK11
- SCOPUS ID : 79961227053