ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

贝叶斯粒子群优化×鲁棒粒子群优化×
领域仿真仿真
方法族Process / pipelineProcess / pipeline
起源年份20032000s
提出者Higashi, N., Iba, H. (extending Kennedy and Eberhart's PSO)Kennedy, J. & Eberhart, R. C. (PSO); robustness extensions by multiple authors, 2000s
类型Hybrid metaheuristic — Bayesian probabilistic swarm searchMetaheuristic — robust swarm-based optimizer
开创性文献Higashi, N., Iba, H. (2003). Particle swarm optimization with Gaussian mutation. Proceedings of the 2003 IEEE Swarm Intelligence Symposium, Indianapolis, IN, USA, pp. 72-79. DOI ↗Kennedy, J., Eberhart, R. C., & Shi, Y. (2001). Swarm Intelligence. Morgan Kaufmann Publishers. ISBN: 9781558605954
别名Bayesian PSO, BPSO, Probabilistic Swarm Optimization, Prior-guided PSORobust PSO, RPSO, Uncertainty-robust PSO, PSO with robustness
相关66
摘要Bayesian Particle Swarm Optimization (Bayesian PSO) integrates Bayesian probabilistic reasoning into the standard particle swarm framework. Particles update their velocities and positions guided not only by personal and global best positions but also by a Bayesian posterior that encodes prior knowledge about the solution space, enabling more directed and statistically principled exploration of complex optimization landscapes.Robust Particle Swarm Optimization (Robust PSO) extends the classical PSO metaheuristic to explicitly account for uncertainty in the objective function, constraints, or decision variables. Rather than optimizing a single nominal objective, each candidate solution is evaluated over a set of uncertainty scenarios, and fitness is judged by a robustness criterion such as worst-case performance or expected value, yielding solutions that remain near-optimal even when conditions deviate from nominal assumptions.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Bayesian Particle Swarm Optimization · Robust Particle Swarm Optimization. 于 2026-06-17 检索自 https://scholargate.app/zh/compare