Online Optimization of Movement Cost for Robotic Applications of PSO

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Particle Swarm Optimization is an optimization algorithm that can be used as a control mechanism in robotic tasks, especially robotic search. Existing algorithms are tuned to use as little evaluations of the objective function as possible. Measuring the objective with a sensor usually has a low cost in terms of time and energy compared to moving the robot. We propose a new algorithm to optimize the particle movement in SMPSO that samples the same points in the environment with less movement cost. Our experiments show that the average movement cost can be reduced by $$50\%$$ or more in all test problems we used. The huge gain shows that there is a big potential in adapting swarm intelligence algorithms to robotic applications by optimizing them to better serve the constraints of the application.

Cite

CITATION STYLE

APA

Mai, S., Zille, H., Steup, C., & Mostaghim, S. (2019). Online Optimization of Movement Cost for Robotic Applications of PSO. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11805 LNAI, pp. 307–318). Springer Verlag. https://doi.org/10.1007/978-3-030-30244-3_26

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