共查询到19条相似文献,搜索用时 528 毫秒
1.
一种新的计算方法:粒度进化计算 总被引:4,自引:4,他引:4
从分析进化计算的起源入手,总结了进化计算产生的根源,然后探讨了人类进化——文化进化的基本特征,模仿进化计算的来源机制,提出了粒度进化计算。如果说进化计算是模拟达尔文生物进化机制而发展起来的一种计算方法,那么粒度进化计算则是在模仿文化进化机制的基础上,综合了Agent技术以及粒度计算、进化计算的理论和方法而提出的一种计算方法。文中,从群进化和超群进化两方面来介绍粒度进化计算的基本原理和方法,并给出了基于粒度Agent系统的粒度进化递归模型。 相似文献
2.
3.
4.
进化计算是多Agent系统学习的一个有用技术。在多Agent系统研究中的某些领域,一种常用的方法是协同进化多Agent合作。研究已经指出:在某些领域,协同进化系统更倾向于稳定而不是成效(即收敛到局部优化解)。这与多Agent系统研究的目的(追求利益最大化)是不相符的。为此,文章提出了一种基于混沌机制的倾向于最大回报的协同进化算法,改进了Wiegand等人的工作,。理论分析和仿真实验表明,这种基于混沌机制的倾向能促使协同进化向更优化的全局稳定点收敛,从而帮助协同进化算法在某些合作的多Agent领域发现更好的解(甚至是最优解)。 相似文献
5.
基于进化规划的多Agent系统任务调度 总被引:1,自引:0,他引:1
Agent任务调度是多Agent系统研究的重要内容之一.调度方法直接影响调度方案的优劣与否和系统的执行效率.进化规划是近年来兴起的一种进化计算方法,具有对实数直接操作及全局寻优能力.将之用于Agent任务调度,建立了Agent任务调度模型,设计了进化规划调度算法.采取多个体竞争策略有效地解决了进化规划的早熟问题.实例验证了这种方法的可行性及性能,进一步的研究是在资源及优先度限制的条件下,如何用进化规划算法解决Agent任务调度问题. 相似文献
6.
7.
多Agent系统中双边多指标自动协商的ACEA算法 总被引:2,自引:0,他引:2
自动协商是多Agent系统中的一个中心议题,它是在Agent间建立一种合作合约,多数情况下这种合约包含多个协商指标,而多指标的协商比单一指标的协商要复杂得多·因此,如何快速、高效地进行Agent间的多指标自动协商是多Agent系统中必须解决的一个问题·给出了一个Agent间多指标协商的模型(MN),并在此基础上提出了双边—多指标协商的一种加速混沌进化算法(ACEA)·ACEA算法首先将混沌机制引入进化计算,然后采用压缩技术对算法进行加速,这样既克服了进化计算过早收敛到局部Nash平衡点的缺点,又解决了多指标协商繁杂的计算和引入混沌后带来的收敛速度慢的问题·理论分析和仿真实验表明,ACEA算法以概率1收敛到全局最优解· 相似文献
8.
9.
新的进化算法--文化算法 总被引:8,自引:0,他引:8
文化算法源于对人类社会多层面进化的模拟,为进化算法提供了一个新的计算框架.和其他进化算法相比,文化算法概念清晰,更能准确地反映社会的进化过程,并在一些领域取得了成功的应用.本文首先讲述了该算法的生物解释,然后介绍了算法的基本原理和不同版本,并给出了一些成功应用的实例,最后给出了本文的结论和进一步的研究方向. 相似文献
10.
一种基于多Agent的进化多目标优化算法 总被引:1,自引:0,他引:1
将进化多Agent系统引入多目标优化问题求解,通过Agent的局部搜索机制及Agent种群的协同进化机制来寻求Pareto最优解。在设计的进化算法当中借鉴了人工生命系统中的一些基本方法,如能量、小生境和迁移机制等。实例表明通过该进化算法求得Pareto最优解集具有很高的效率。 相似文献
11.
针对复杂网络数据量大,与知识存在与/或关系及不易管理等特性,探讨和研究了复杂网络与知识网络之间的关系和演化过程.采用粒商空间理论构建了复杂网络与知识网络协同进化模型,提出了基于粒计算的复杂网络协同进化算法,该方法将双库融合机制及变区域策略应用到协同进化中,较好地解决了复杂网络与知识网互相作用、协同演化等问题.通过实验与比较,验证了此方法的有效性和可行性. 相似文献
12.
13.
In this paper,a new dynamical evolutionary algorithm(DEA) is presented based on the theory of statistical mechanics.The novelty of this kind of dynamical evolutionary algorithm is that all individuals in a population(called particles in a dynamical system)are running and searching with their population evolving driven by a new selecting mechanism.This mechanism simulates the principle of molecular dynamics,which is easy to design and implement.A basic theoretical analysis for the dynamical evolutionary algorithm is given and as a consequence two stopping criteria of the algorithm are derived from the principle of energy minimization and the law of entropy increasing.In order to verify the effectiveness of the scheme,DEA is applied to sloving some typical numerical function minimization problems which are poorly solved by traditional evolutionary algorithms.The experimental results show that EAT is fast and reliable. 相似文献
14.
This paper describes μGP, an evolutionary approach for generating assembly programs tuned for a specific microprocessor. The approach is based on
three clearly separated blocks: an evolutionary core, an instruction library and an external evaluator. The evolutionary core
conducts adaptive population-based search. The instruction library is used to map individuals to valid assembly language programs.
The external evaluator simulates the assembly program, providing the necessary feedback to the evolutionary core. μGP has some distinctive features that allow its use in specific contexts. This paper focuses on one such context: test program
generation for design validation of microprocessors. Reported results show μGP being used to validate a complex 5-stage pipelined microprocessor. Its induced test programs outperform an exhaustive functional
test and an instruction randomizer, showing that engineers are able to automatically obtain high-quality test programs. 相似文献
15.
运用动力学原理,基于进化博弈理论,对信任计算的动力学方程进行了求解分析,并运用复制动态原理分析了节点之间信任关系的演化趋势,进一步揭示了信任计算的演化动力学规律。仿真实验表明,进化是网络节点信任合作的动力源泉。 相似文献
16.
Florin Manea Carlos Martín-Vide Victor Mitrana 《Electronic Notes in Theoretical Computer Science》2006,135(3):95
We propose a construction of an accepting hybrid network of evolutionary processors (AHNEP) which behaves as a universal device in the class of all these devices. We first construct a Turing machine which can simulate any AHNEP and then an AHNEP which simulates the Turing machine. We think that this approach can be applied to other bio-inspired computing models which are computationally complete. 相似文献
17.
《Expert systems with applications》2014,41(6):2729-2741
In the past decade, granular computing (GrC) has been an active topic of research in machine learning and computer vision. However, the granularity division is itself an open and complex problem. Deep learning, at the same time, has been proposed by Geoffrey Hinton, which simulates the hierarchical structure of human brain, processes data from lower level to higher level and gradually composes more and more semantic concepts. The information similarity, proximity and functionality constitute the key points in the original insight of granular computing proposed by Zadeh. Many GrC researches are based on the equivalence relation or the more general tolerance relation, either of which can be described by some distance functions. The information similarity and proximity depended on the samples distribution can be easily described by the fuzzy logic. From this point of view, GrC can be considered as a set of fuzzy logical formulas, which is geometrically defined as a layered framework in a multi-scale granular system. The necessity of such kind multi-scale layered granular system can be supported by the columnar organization of the neocortex. So the granular system proposed in this paper can be viewed as a new explanation of deep learning that simulates the hierarchical structure of human brain. In view of this, a novel learning approach, which combines fuzzy logical designing with machine learning, is proposed in this paper to construct a GrC system to explore a novel direction for deep learning. Unlike those previous works on the theoretical framework of GrC, our granular system is abstracted from brain science and information science, so it can be used to guide the research of image processing and pattern recognition. Finally, we take the task of haze-free as an example to demonstrate that our multi-scale GrC has high ability to increase the texture information entropy and improve the effect of haze-removing. 相似文献
18.
19.
DNA计算是由生物学和计算机科学相互结合形成的交叉学科,该文将对此学科的发展进行介绍。首先介绍如何借助于处理DNA序列的方法来解决卖货郎问题,并以此表明DNA计算的可行性;再对DNA的切片重组系统和图灵机系统进行比较,以此说明用切片重组系统来实现图灵机功能的可行性,最后简单介绍待解决的问题. 相似文献