A finite-time particle swarm optimization algorithm for odor source localization
From MaRDI portal
Publication:506107
DOI10.1016/j.ins.2014.02.010zbMath1354.90184OpenAlexW2064460517MaRDI QIDQ506107
Shirong Liu, Qing-Long Han, Qiang Lu
Publication date: 31 January 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.02.010
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59)
Uses Software
Cites Work
- Multiple sequence alignment using the hidden Markov model trained by an improved quantum-behaved particle swarm optimization
- Finite-time convergent gradient flows with applications to network consensus
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- Finite-time formation control for multi-agent systems
- A piecewise linear chaotic map and sequential quadratic programming based robust hybrid particle swarm optimization
- Continuous finite-time stabilization of the translational and rotational double integrators
- Finite-Time Stability of Continuous Autonomous Systems
- General Framework for Mobile Robot Navigation Using Passivity-Based MPC
This page was built for publication: A finite-time particle swarm optimization algorithm for odor source localization