Ranged subgroup particle swarm optimization for localizing multiple odor sources

11Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Jatmiko, W., Pambuko, W., Febrian, A., Mursanto, P., Muis, A., Kusumoputro, B., … Fukuda, T. (2010). Ranged subgroup particle swarm optimization for localizing multiple odor sources. International Journal on Smart Sensing and Intelligent Systems, 3(3), 411–442. https://doi.org/10.21307/ijssis-2017-401

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free