We use cookies to improve your experience with our site.

只需要有限的存储空间和适度的计算开销的高性能轻紧凑差分演化算法

Compact Differential Evolution Light: High Performance Despite Limited Memory Requirement and Modest Computational Overhead

  • 摘要: 紧凑算法是指一类通过对候选解群体进行概率表示来模仿基于种群算法行为的分布估计算法。这类算法和基于种群算法行为相似但是需要更小的存储空间。这一特征在一些工程应用尤其是机器人技术中至关重要。紧凑查分演化算法(cDE)是一种高性能的紧凑算法。为了同时满足节省存储空间和实时性要求, 本文基于cDE提出了轻紧凑查分演化算法(cDElight)。为了能够在不影响性能的情况下降低计算开销, cDElight对cDE进行了两处修饰。在大量的测试函数上进行测试的结果表明, 尽管cDElight只要求最低的硬件需求, 但它并没有降低cDE的性能, 从而同其它的节省存储空间的算法以及基于群体的算法相比, 是有竞争力的。在移动机器人领域的应用突显了cDElight的可用性和优势。

     

    Abstract: Compact algorithms are Estimation of Distribution Algorithms which mimic the behavior of population-based algorithms by means of a probabilistic representation of the population of candidate solutions. These algorithms have a similar behaviour with respect to population-based algorithms but require a much smaller memory. This feature is crucially important in some engineering applications, especially in robotics. A high performance compact algorithm is the compact Differential Evolution (cDE) algorithm. This paper proposes a novel implementation of cDE, namely compact Differential Evolution light (cDElight), to address not only the memory saving necessities but also real-time requirements. cDElight employs two novel algorithmic modifications for employing a smaller computational overhead without a performance loss, with respect to cDE. Numerical results, carried out on a broad set of test problems, show that cDElight, despite its minimal hardware requirements, does not deteriorate the performance of cDE and thus is competitive with other memory saving and population-based algorithms. An application in the field of mobile robotics highlights the usability and advantages of the proposed approach.

     

/

返回文章
返回