首页 /研究 /Ranged Subgroup Particle Swarm Optimization for Localizing Multiple Odor Sources
SWARM

Ranged Subgroup Particle Swarm Optimization for Localizing Multiple Odor Sources

Wisnu Jatmiko, W. Pambuko, Andreas Febrian, Petrus Mursanto, Abdul Muis, Benyamin Kusumoputro, Kosuke Sekiyama, Toshio Fukuda

发表年份
2010
引用次数
11
访问权限
开放获取

摘要

Abstract A new algorithm based on Modified Particle Swarm Optimization (MPSO) that follows is a local gradient of a chemical concentration within a plume and follows the direction of the wind velocity is investigated. Moreover, the niche or parallel search characteristic is adopted on MPSO to solve the multi-peak and multi-source problem. When using parallel MPSO, subgroup of robot is introduced then each subgroup can locate the odor source. Unfortunately, there is a possibility that more that one subgroup locates one odor sources. This is inefficient because other subgroups locate other source, then we proposed a ranged subgroup method for coping for that problem, then the searching performance will increase. Finally ODE (Open Dynamics Engine) library is used for physical modeling of the robot like friction, balancing moment and others so that the simulation adequate to accurately address the real life scenario.

关键词

OdorParticle swarm optimizationComputer scienceArtificial intelligenceMathematicsMathematical optimizationAlgorithm

相关论文

查看 SWARM 分类全部论文