Empirical results show that PSO performance may be different if using either chaotic or random sequences to drive the algorithm's search dynamics. We analyze the phenomenon by evaluating the performance based on a benchmark of test functions and comparing random and chaotic sequences according to equality or difference in underlying distribution or density. Our results show that the underlying distribution is the main influential factor in performance and thus the assumption of general and systematic performance differences between chaos and random appears not plausible.

翻译：实证结果表明，若采用混沌序列或随机序列驱动算法搜索动态，粒子群算法性能可能呈现差异。我们通过评估基准测试函数性能分析该现象，并根据底层分布或密度的等同性或差异性比较随机与混沌序列。研究结果表明，底层分布是影响性能的主要因素，因此混沌与随机之间存在普遍系统性性能差异的假设似乎不成立。