用户名: 密码: 验证码:
蚁群优化算法及觅食行为模型研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
蚁群优化是模拟蚁群在觅食过程中能获得巢穴到食物源间最短路径的机制而提出的启发式方法,其一经产生就成为求解复杂优化问题的重要方法。当前对蚁群优化领域的研究主要包括两个方向:一种是基于解空间概率函数的优化算法,算法通过确定状态转移概率、信息素更新方式对优化问题进行求解;一种是基于主体蚂蚁的基本行为规则而确定的演化模型,模型通过基于规则的行为演化仿真揭示蚁群觅食、聚类等行为的特点、结果及复杂性成因。本论文对蚁群优化的两个方向分别进行了深入研究,首先,基于复杂适应系统理论建立基于Agent的蚁群觅食演化模型,之后,对基于解空间概率函数的蚁群优化算法进行了分析和改进,最后,将本文所得模型和算法用于实际工程问题中,仿真结果验证了模型和算法的有效性和实用性。
     主要研究内容包括以下几个方面:
     (1)根据蚁群觅食行为的原理,利用复杂适应系统理论建立了基于Agent的蚁群觅食行为演化模型,并对模型及模型中几个重要参数进行仿真分析。在此基础上,提出基于参数自适应和加入新规则的蚁群觅食行为演化模型,模型通过新规则和新参数的加入,在寻找食物源的仿真中获得了更好的效果;
     (2)针对基本蚁群算法容易出现早熟和停滞现象的缺点,提出了一种侧重数据处理和基于匀称度动态城市选择及信息素更新的改进算法,并证明了算法的收敛性,通过实验验证了算法在防止过早停滞和加速收敛上的优势;
     (3)针对蚁群算法求解连续域优化问题的不足,在蚁群算法创始人Dorigo提出的基于实数优化的蚁群算法基础上,通过对算法参数的含义及算法收敛性的研究,提出了基于均匀参数选择和解的权值改进的扩展蚁群算法。仿真试验表明了该方法在求解连续空间优化问题的可行性和有效性;
     (4)针对扩展蚁群算法的不足提出了三种融合算法,以提高算法的求解效率:提出了一种求解连续空间优化问题的量子扩展蚁群算法,算法使用量子比特的概率幅编码种群个体,通过量子非门实现变异;提出了一种基于云模型的遗传扩展蚁群算法,利用遗传算法获得扩展蚁群算法的初始解,同时,利用云模型理论自适应的调整扩展蚁群算法中的两个重要参数;提出了一种鱼群扩展蚁群算法,利用鱼群算法的追尾和聚群行为获得扩展蚁群算法的初始解,在扩展蚁群算法每次迭代中加入鱼群随机觅食行为。通过对多个多维连续函数的仿真实验,验证了三种改进算法在处理连续函数寻优问题上的优势;
     (5)针对模糊神经控制器模糊规则以及控制器参数较难确定的问题,提出了两类基于扩展量子蚁群算法的模糊神经控制器。一类是利用量子扩展蚁群算法优化参数的正规化模糊神经控制器,在此基础上,通过对变论域伸缩因子和隶属度函数进行设计获得变论域模糊神经控制器。通过对两类控制器建立不同的输入变量和模糊规则对单级倒立摆系统分别进行仿真实验,在与其它控制器的对比中验证所设计的控制器具有更好的控制性能。
     (6)根据蚁群觅食行为过程和机器人路径规划的相似性,将改进蚁群觅食行为模型和改进离散域蚁群算法用于复杂动静态环境下的机器人路径规划求解,确定了蚁群觅食模型和蚁群算法的适应性和有效性。
The ant colony optimization (ACO) is a heuristic method which is proposed bysimulating the mechanism that the ant colony can find out the shortest path betweenthe nest to a food source. The algorithm is being the important method to solve thecomplex optimization problem as soon as being proposed. Nowadays, researches onACO mainly include two fields: one is ACO based on probability function insolution space, which solves optimization problem by the determination of statetransition probability and regeneration pattern of pheromone; the other is the modelbased on basic ant’s behavior rule, which reveals the characteristics, results andcomplexity causes of the ant colony’ behavior, such as the foraging and clusteringetc, through the behavior evolution based on the rule. In this thesis, the two researchfields of ACO are deeply studied respectively. Firstly, by the use of the complexadaptive systems theory, the ant colony foraging behavior model based on Agent isestablished. Next, the analysis and improvement of ACO based on probabilityfunction in solution space is studied. Finally, the model and the algorithms are usedin actual engineering problem, and the simulation results verify the effective and th epracticality of the methods.
     Main research contents are as follows:
     (1)According to the principle of the ant foraging behavior, an ant colonyforaging behavior model based on Agent is proposed by the use of the complexadaptive systems theory. Through simulating and analyzing several importantparameters in the model, the models based on adaptive parameters and added newbehavior rules are proposed respectively. And with the addition of the new behaviorrules and the new parameters, the better effective is obtained in the simulation offinding food source;
     (2)To overcome the premature and stagnation phenomenon in basic ACOalgorithm, this paper proposes an improved ACO algorithm which emphasizes dataprocessing and bases on symmetry degree city selection and pheromoneregeneration, and proves the convergence of this algorithm. Finally, experimentalresults show that this algorithm can overcome the defects of premature andstagnation, and accelerate convergence;
     (3)Due to the lack of ACO in solving optimization problem in continuespace, on this basis of extended ACO proposed by M. Dorigo, who is founder ofACO algorithm, this paper proposes an extended ACO based on uniform parameterselection and weighted improvement of solution by studying implication ofalgorithm parameter and convergence of extended ACO algorithm. Simulation experiments show that this algorithm has feasibility and efficiency in solvingoptimization problem in continue space;
     (4)Aiming to the shortcomings of the extended ACO, this paper proposesthree hybrid algorithms of ACO. Firstly, an improved quantum extended ACO isproposed to solve continue optimization problem. This algorithm codes individualby using probability amplitude of quantum bit and fulfills mutation by quantum notgate. Secondly, this paper proposed a genetic extended ACO based on cloudy model.This algorithm obtains initial solution of extended ACO by GA and uses the cloudymodel to adjust the two parameters in extended ACO adaptively. Thirdly, this paperproposes an extended ACO based artificial fish swarm algorithm. This algorithmobtains initial solution of extended ACO by artificial fish-swarm algorithm andadds random foraging behavior of fish swarm in each iteration. Many multi-dimensions continue function simulation experiments show the advantages of thethree extended algorithms to solve optimization problem in continue space;
     (5)As fuzzy rules and control parameters in fuzzy neural controller aredifficult to acquired, this paper puts forward two fuzzy neural network controllersbased on extended quantum ACO. One is the normal fuzzy neural networkcontroller of which the parameter is optimized by extended quantum ACO. On thebasis of the controller, through designing the variable universe contractionexpansion factor and membership function, the variable universe fuzzy neuralcontroller is proposed. Finally, using these two controller to the single levelinverted pendulum system respectively, and compare with other controllers,simulation results show that this controller has better control performance;
     (6)According to the similarity between the process of ant colony foragingbehavior and the robot path planning, the improved ant colony foraging behaviormodel and modified discrete domain ant colony algorithm are used to the robot pathplanning in the static and dynamic complex environment, the experiment resultsverify the adaptability and the effectiveness of the methods.
引文
[1]李建会,张江.数字创世纪—人工生命的新科学[M].北京:科学出版社,2006:118-128.
    [2] Dorigo M, Bonabeau E, Theraulaz G. Ant algorithms and stigmergy[J]. FutureGeneration Computer Systems,2000,16(8):851-871.
    [3] Deneubourg J L, Goss S, Franks N,et al. The dynamics of collective sortingrobot-like ants and ant-like robots[C]. Proceedings of the First InternationalConference on Simulation of Adaptive Behavior: From Animals to Animats.Cambridge:The MIT Press,1990,356-363.
    [4] Lumer E, Faieta B.Diversity and adaptation in populations of clustering ants[C].Proceedings of the Third International Conference on Simulation ofAdaptive Behavior: From Animals to Animats. Cambridge:The MIT Press,1994,501-508.
    [5] Bonabeau E, Theraulaz G, Deneubourg J L. Quantitative study of the fixedthreshold model for the regulation of division of labour in insect societies[C].Proceedings of the Royal Society. London: London Series B-BiologicalSciences,1996,263:1565-1569.
    [6] Theraulaz G, Bonabeau E, Deneubourg J L.Threshold reinforcement and theregulation of division of labor in insect societies[C]. Proceedings of the RoyalSociety.London:London Series B-Biological Sciences,1998,265:327-332.
    [7] Dorigo M,Stutzle T.蚁群优化[M].张军等,译.北京:清华大学出版社,2007:20-50.
    [8] Deneubourg J L,Goss S, Franks N R,et al.The blind leading the blind:Mode-ling chemically mediated army ant raid patterns[J].Insect Behavior,1989,2(1):719-725.
    [9] Dorigo M, Maniezzo V,Colorni A.Ant system: Optimization by a colony ofcooperating agents[J]. IEEE Transactions on Systems, Man,and CyberneticsPart B,1996,26(1):29-41.
    [10] Dorigo M,Caro G D.Ant colony optimization:A new meta-heuristic[C].Proceedings of the1999Congress on Evolutionary Computation,1999,2:1470-1477.
    [11] Shuang B,Chen J P, Li Z B. Microrobot based micro-assembly sequenceplanning with hybrid ant colony algorithm[J]. The International Journal ofAdvanced Manufacturing Technology,2008,38(11):1227-1235.
    [12] Gajpal Y, Abad P L. An ant colony system (ACS) for vehicle routing problemwith simultaneous delivery and pickup[J]. Computers and Operations Research,2009,36(12):3215-3223.
    [13] Seo M, Kim D. Ant colony optimisation with parameterised search space for thejob shop[J].International Journal of Production Research,2010,48(4):1143-1154.
    [14] Juang C F, Chang P H.Recurrent fuzzy system design using elite-guidedcontinuous ant colony optimization [J].Applied Soft Computing,2011,11(2):2687-2697.
    [15] Lei X S, Guo K X.The model identification for small unmanned aerialrotorcraft based on adaptive ant colony algorithm[J].Journal of BionicEngineering,2012,9(4):508-514.
    [16]刘小龙.细菌觅食优化算法的改进及应用[D].广州:华南理工大学博士论文,2011:1-15.
    [17]胡运权.运筹学教程[M].第3版.北京:清华大学出版社,2007:210-270.
    [18] Deneubourg J L, Aron S, Goss S, et al. The self-organizing exploratorypattern of the argentine ant[J]. Journal of Insect Behavior,1990,3(2):159-168.
    [19] Goss S, Aron S, Deneubourg J L, et al.Self-organized shortcuts in theArgentine ant[J]. Naturwissenschaften,1989,76:579–581.
    [20] Collins R J, Jefferson D R.Antfarm: Towards simulated evolution[M].NewYork: Artificial life Ⅱ,1992:579-601.
    [21] Bonabeau E.Marginally stable swarms are flexible and efficient[J].Journal DePhysique,1996,6(2):309-320.
    [22] Wilensky U.NetLogo ants model[EB/OL].(1997-09-12)[2009-04-08].http://ccl. northwestern.edu/netlogo/models/Ants.
    [23] Resnick M.Turtles, Termites and Traffic Jams[M].Cambridge:The MIT Press,1994,35-70.
    [24] Wodrich M,Bilchev G.Cooperative distributed search: The ants’ way[J].Control and Cybernetics,1997,26(2):151-160.
    [25] Vaughan R,Stoy K, Sukhatme G,et al. Whistling in the dark: Cooperative trailfollowing in uncertain localization space[C].Proceedings of the FourthInternational Conference on Autonomous Agents.NewYork:ACM Press,2000:187-194.
    [26] Panait L, Luke S.A pheromone-based utility model for collaborative foraging[C].Proceedings of the Third International Joint Conference on AutonomousAgents and Multi Agent Systems.NewYork:IEEE Computer SocietyPress,2004:36-43.
    [27]贺建民,闵锐.多Agent系统中蚁群算法的设计与实现[J].微电子学与计算机,2006,23(10):32-34.
    [28]张成,贾素玲,魏法杰.人工蚁群觅食行为建模、仿真和分析[J].计算机应用研究,2009,26(1):33-36.
    [29] Elton B,Bandeira D M, Aluízio F R,et al. Modelling foraging ants in adynamic and confined environment Original Research Article[J].Biosystems,2011,104(1):23-31.
    [30]孟志刚.蚁群觅食仿真和动画的研究[D].长沙:中南大学博士学位论文,2011:15-30.
    [31] Gambardella L M, Dorigo M. Ant-Q: A reinforcement learning approach tothe traveling salesman problem[C].Proceedings of the12th InternationalConference on Machine Learning.Morgan Kaufmann,1995:252-260.
    [32] Dorigo M, Gambardella L M.Ant colony system:A cooperative learningapproach to the traveling salesman problem[J]. IEEE Transactions on Evolutionary Computation,1997,1(1):53-66.
    [33] Stützle T, Hoos H.The MAX-MIN ant system and local search for theTraveling salesman problem[C]. Proceedings of the IEEE InternationalConference on Evolutionary Computation,Indianpolis,IN,1997:309-314.
    [34] Bullnheimer B, Hartl R F, Strauss C. A new rank-based version of the antsystem:A computational study[J]. Central European Journal for OperationsResearch and Economics,1999,7(1):25-38.
    [35] Ho S L, Yang S Y, Ni G Z, et al.A modified ant colony optimization algo-rithm modeled on tabu-search methods[J].IEEE Transactions on Magnetics,2005,42(4):1195-1198.
    [36] Qin L, Chen Y X, Chen L,et al.An improved ant colony algorithm withbiological characteristics[C]. Proceedings of the2006IEEE InternationalConference on Granular Computing,2006:405-408.
    [37] Ellabib I,Calamai P,Basir O.Exchange strategies for multiple ant colonysystem original research article[J]. Information Sciences,2007,177(5):1248-1264.
    [38] Cai J.Chaotic ant swarm optimization to economic dispatch[J]. Electric PowerSystems Research,2007,77(10):1373-1380.
    [39] Kong M,Tian P. A new ant colony optimization algorithm for the multidi-mensional Knapsack problem[J].Computers and Operations Research,2008,35(8):2672-2683.
    [40] Naimi H M, Taherinejad N. New robust and efficient ant colony algorithms:Using new interpretation of localupdating process[J].Expert Systems withApplications,2009(36):481-488.
    [41] Zhang P,Lin J,Xue L.An adaptive heterogeneous multiple ant coloniesalgorithm[J].Journal of Intelligent Systems,2010,19(4):301-314.
    [42]杜占玮,杨永健,孙永雄,等.基于互信息的混合蚁群算法及其在旅行商问题上的应用[J].东南大学学报(自然科学版),2011,41(3):478-481.
    [43]郭禾,程童,陈鑫,等.一种使用视觉反馈与行为记忆的蚁群优化算法[J].软件学报,2011,22(9):1994-2005.
    [44] Koshimizu H, Saito T.Parallel ant colony optimizers with local and globalants[C]. Proceedings of the Int’l Joint Conf. on Neural Networks,2009,1655-1659.
    [45] Li Z Y,Wang Y,Olivier K,et al.The cloud-based framework for ant colonyopti-mization[C].Proceedings of the the1stACM/SIGEVO Summit onGenetic and Evolu-tionary Computation,2009,279-286.
    [46]刘朝华,张英杰,章兢,等.蚁群算法与免疫算法的融合及其在TSP中的应用[J].控制与决策,2010,25(5):695-700.
    [47]吴建辉,章兢,刘朝华.基于自适应多态免疫蚁群算法的TSP求解[J].计算机应用研究,2010,27(5):1653-1658.
    [48]白洪涛,欧阳丹彤,李熙铭.基于GPU的共享信息素矩阵多蚁群算法[J].吉林大学学报(工学版),2011,41(6):1678-1683.
    [49]张兆军,冯祖仁,任志刚.采用序优化的改进蚁群算法[J].西安交通大学学报,2010,44(2):15-20.
    [50] Bilehev G,Parmee I C.The ant colony metaphor for searching continuousdesign spaces[J].Lectures Notes in Computer Science,1995,993:25-39.
    [51]高尚,钟娟,莫述军.连续优化问题的蚁群算法研究[J].微机发展,2003,13(l):1-22.
    [52]汪镭,吴启迪.蚁群算法在连续空间寻优问题求解中的应用[J].控制与决策,2003,18(1):45-48.
    [53]李盼池,李士勇.求解连续空间优化问题的量子蚁群算法[J].控制理论与应用,2008,25(2):237-241.
    [54] Socha K, Dorigo M. Ant colony optimization for continuous domains[J].European Journal of Operational Research,2008,185(3):1155-1173.
    [55]梁昔明,肖金红,龙文,等.基于记忆表的连续蚁群优化算法[J].计算机工程,2010,36(16):183-185.
    [56] Zhu Q B, Yang Z J, Ma W. A quickly convergent continuous ant colonyoptimization algorithm with scout ants[J]. Applied Mathematics andComputation,2011,218(5):1805-1819.
    [57] Gutjahr W J.A generalized convergence result for the graph-based ants systemmetaheuristic[J].Probability in the Engineering and Information Science,2003,17(4):545-569.
    [58] Stützle T,Dorigo M.A short convergence proof for a class of ant colonyoptimization algorithms[J].IEEE Transactions on Evolutionary Computation,2002,6(4):358-365.
    [59] Meuleau N,Dorigo M.Ant colony optimization and stochastic gradientdescent[J]. Artif Life,2002,8(2):103-121.
    [60] Badr A, Fahmy A. A proof of convergenc for ant algorithms[J].InformationScience,2004,160(1):267-279.
    [61]段海滨,王道波,于秀芬.基本蚁群算法的A.S.收敛性研究[J].应用基础与工程科学学报,2006,14(2):297-301.
    [62]金劲,洪毅,赵付青,等.多约束条件蚁群算法的收敛性分析及其应用[J].控制理论与应用,2010,27(10):1353-1361.
    [63] Ghoseiri K, Nadjari B. An ant colony optimization algorithm for the biob-jective shortest path problem[J]. Applied Soft Computing Journal,2010,10(4):1237-1246.
    [64] Maniezzo V, Colorni A.The ant system applied to the quadratic assignmentproblem[J]. IEEE Transactions on Data and Knowledge Engineering,1999,11(5):769–778.
    [65] Colorni A,Dorigo M, Maniezzo V, et al. Ant system for job-shop cheduling[J].Belgian Journal of Operations Research Statistics and Computer Science,1994,34(1):39-53.
    [66] Costa D, Hertz A.Ants can color graphs[J]. Journal of the OperationalResearch Society,1997,48(3):295-305.
    [67] Bullnheimer B, Hartl R F, Strauss C.An improved ant system algorithm forthevehicle routing problem [J]. Annals of Operations Research,1999,89(0):319-328.
    [68] Santos L,Coutinho-Rodrigues J,Current J R.An improved ant colonyoptimization based algorithm for the capacitated arc routing problem[J].Transportation Research Part B:Method ological,2010,44(2):246-266.
    [69] Gajpal Y,Abad P L.Multi-ant colony system (MACS) for a vehicle routingproblem with backhauls[J]. European Journal of Operational Research,2009,196(1):102-117.
    [70] Hu X M,Zhang J,Li Y.Orthogonal methods based ant colony search forsolving continuous optimization problems[J].Journal of Computer Scienceand Technology,2008,23(1):2-18.
    [71] Cao K,Yang X,Chen X J,et al. A novel ant colony optimization algorithm forlargedistorted fingerprint matching[J].Pattern Recognition,2012,45(1):151-161.
    [72] Wang Z Q,Zhu X G,Han Q Y.Mobile robot path planning based on parameteroptimization ant colony algorithm[J].Procedia Engineering,2011,15:2738-2741.
    [73]邢娅浪,何鑫,孙世宇.基于改进蚁群算法的模糊控制器优化设计[J].计算机仿真,2012,29(1):131-134.
    [74]陈建良,朱伟兴.蚁群算法优化模糊规则[J].计算机工程与用,2007,43(5):113-115.
    [75]贺勇.基于蚁群算法的模糊控制器优化研究[J].控制理论与应用,2007,26(8):14-16.
    [76]段海滨,王道波,黄向华,等.基于蚁群算法的PID参数优化[J].武汉大学学报,2004,37(5):97-100.
    [77] Ji C M,Shan Y,Zhao B,et al.The optimization of dispatching function basedon ant colony optimization[C].Proceedings of the20117th InternationalConference on Natural Com-putation,2011,1207-1210.
    [78]朱庆保.全局未知环境下多机器人运动蚂蚁导航算法[J].软件学报,2006,17(9):1890-1898.
    [79] Yee Z C, Ponnambalam S G. Mobile robot path planning using ant colonyoptimization[C]. Proceedings of the IEEE/ASME International Conference onAdvanced Intelligent Mechatronics.Singapore,2009:851-856.
    [80] Porta Garcia M A,Montiel O,Castillo O, et al. Path planning for autonomousmobile robot navigation with ant colony optimization and fuzzy cost functionevaluation[J]. Applied Soft Computing,2009,9(3):1102–1110.
    [81]赵娟平,高宪文,符秀辉,等.移动机器人路径规划的改进蚁群优化算法[J].控制理论与应用,2011,28(4):457-461.
    [82]王培栋.改进蚁群算法及在路径规划问题的应用研究[D].青岛:中国海洋大学博士学位论文,2012:45-60.
    [83]程启明,王勇浩.基于蚁群优化算法的模糊神经网络控制器及仿真研究[J].上海电力学院学报,2006,22(2):105-108.
    [84]李文江,杨崔,王涛.基于蚁群优化的模糊神经网络控制器的应用研究[J].工矿自动化,2009,3:14-17.
    [85]程国建,颜宇甲,强新建,等.基于多Agent的生态复杂适应系统建模和仿真[J].西安石油大学学报(自然科学版),2011,26(2):99-103.
    [86]宁爱兵,马良,熊小华.基于复杂适应系统的蚂蚁群体智能研究[J].微计算机信息,2008,24(1):265-267.
    [87] Almeida S J,Ferreira R,álvaro E,et al.Multi-agent modeling and simulation ofan Aedes aegypti mosquito population[J].Environmental Modelling andSoftware,2010,25(12):1490-1507.
    [88] Le Q B, Seidl R, Roland W,et al.Feedback loops and types of adaptation inthe modelling of land-use decisions in an agent-based simulation[J].Environ-mental Modelling and Software,2012,27:83-96.
    [89] Rolón M, Martínez E.Agent-based modeling and simulation of an autonomicmanufacturing execution system[J].Computers in Industry,2012,63(1):53-78.
    [90] Amini M, Wakolbinger T, Racer M, et al.Alternative supply chain productionsales policies for new product diffusion: An agent-based modeling andsimulation approach[J].European Journal of Operational Research,2012,216(2):301-311.
    [91]熊伟清,周扬,魏平.具有灾变的动态蚁群算法[J].电路与系统学报,2005,10(6):98-102.
    [92]姚金涛,祝胜林,孔宇彦.具有寿命估算的最大-最小蚂蚁系统[J].计算机工程与应用,2011,47(24):27-29.
    [93] Xiong Z H, Li S K, Chen J H. Hardware/software partitioning based on dyna-mic combination of genetic algorithm and ant algorithm[J].Journal ofSoftware,2005,16(4):503-512.
    [94]王青.改进蚁群算法及其在智能控制中的应用[D].哈尔滨:哈尔滨工业大学硕士学位论文,2009:50-60.
    [95] Shelokar P S,Patrick S, Jayaraman V K,et al.Particle swarm and ant colonyalgorithms hybridized for improved continuous optimization[J].AppliedMathematics and Computation,2007,188(1):129-142.
    [96] Xiao J, Li L P. A hybrid ant colony optimization for continuous domains[J].Expert Systems with Applications,2011,38(9):11072-11077.
    [97] Reinel T G.TSPLIB [EB/OL].(2007-05-22)[2009-11-15]. http://www.iwr.uniheidelberg.de/groups/comopt/software/TSPLIB95/.
    [98]周秀玲,孙承义.有界连续空间中MEC算法的收敛性分析[J].计算机工程与应用,2005,1:87-91.
    [99]方开泰,马长兴.正交与均匀试验设计[M].北京:科学出版社,2001:1-50.
    [100] Chuang S C, Hung Y C.Uniform design over general input domains withapplications to target region estimation in computer experiments[J].Computa-tional Statistics&Data Analysis,2010,54(1):219-232.
    [101]井孝功,张井波.高等量子力学导论[M].哈尔滨:哈尔滨工业大学出版社,2006:23-273.
    [102] Li P C, Li S Y.Learning algorithm and application of quantum BP neuralnetworks based on universal quantum gates[J]. Journal of Systems Enginee-ring and Electronics.2008,19(1):167-174.
    [103]陈晓峰,宋杰.量子人工鱼群算法[J].东北大学学报(自然科学版),2012,33(12):1710-1713.
    [104] Li P C, Li S Y.Grover quantum searching algorithm based on the weightedtargets[J].Journal of Systems Engineering and Electronics,2008,19(2):363-369.
    [105]张葛祥,李娜,金炜东.一种新量子遗传算法及其应用[J].电子学报,2004,32(3):476-479.
    [106]李士勇,李盼池.基于实数编码和目标函数梯度的量子遗传算法[J].哈尔滨工业大学学报,2006,38(8):1216-1218.
    [107]黄永青,郝国生,钟志水.基于网格划分策略的连续域改进蚁群算法[J].计算机工程与应用,2012,6:1-6.
    [108]段海滨.蚁群算法原理及其应用[M].北京:科学出版社,2005:385-390.
    [109] Li D Y.Uncertainty in knowledge representation [J].Chinese EngineeringScience,2000,2(10):73-79.
    [110]张光卫,何锐,刘禹.基于云模型的进化算法[J].计算机学报,2008,31(7):1082-1089.
    [111]齐名军,杨爱红.基于云模型云滴机制的量子粒子群优化算法[J].计算机工程与应用,2012,48(24):49-52.
    [112] Lee Z J, Su S F,Chuang C C,et al.Genetic algorithm with ant colony optimi-zation for multiple sequence alignment[J].Applied Soft Computing,2008,8(1):55-78.
    [113]李敬花.遗传蚁群融合算法求解多项目资源能力平衡问题[J].计算机集成制造系统,2010,16(3):643-649.
    [114]周伟,李智勇.多源扩散蚁群遗传算法[J].计算机工程与设计,2008,29(19):5006-5008.
    [115]韦修喜,曾海文,周永权.云人工鱼群算法[J].计算机工程与应用,2010,46(22):26-29.
    [116]李晓磊,邵之江,钱积新.一种基于动物自治体的寻优模式:鱼群算法[J].系统工程理论与实践,2002,11:32-38.
    [117]赵振锋,吴庆宪,姜长生.基于遗传的人工鱼群优化之武装直升机对地攻击火力分配决策[J].电光与控制,2011,18(3):31-34.
    [118]宋志宇,李俊杰,汪红宇.混沌人工鱼群算法在重力坝材料参数反演中的应用[J].岩土力学,2007,28(10):2193-2196.
    [119]高德芳,赵勇,郭杨,等.基于混合鱼群-蚁群算法的模块化产品配置设计[J].设计与研究,2007,34(1):7-10.
    [120] Tipping M. Sparse bayesian learning and the vector machine[J]. Journal ofMachine Learning Research,2001,(l):211-244.
    [121] Tipping M.Bayesian inference:An introduction to principles and practice inmachine learning[J].Advanced Lectures on Machine Learning,2004,3176:41-62.
    [122] Ruan X G, Ding M X, Gong D X, et al.On-line adaptive control for invertedpendulum balancing based on feedback-error-learning[J].Neuro Computing.2007,(70):770-776.
    [123] Chen C S, Chen H H.Robust adaptive neural fuzzy network control for thesynchronization of uncertain chaotic systems[J]. Nonlinear Analysis: RealWorld Applications,2009,10(3):1466-1479.
    [124]胡玉林,曹建国.基于模糊神经网络的动态非线性系统辨识研究[J].系统仿真学报,2007,19(3):560-562.
    [125] Dandil B.Fuzzy neural network IP controller for robust position control ofinduction motor drive[J].Expert Systems with Applications,2009,36(3):4528-4534.
    [126]李国勇,杨庆佛.基于模糊神经网络的车用发动机智能故障诊断系统[J].系统仿真学报,2007,19(5):1034-1037.
    [127]方彦军,苏正伟,李世红.基于一种混和遗传算法的模糊神经网络的优化[J].武汉大学学报(工学版),2004.37(2):74-77.
    [128]李盼池,李士勇.基于量子遗传算法的正规模糊神经网络控制器设计[J].系统仿真学报,2007,19(16):3710-3714.
    [129]李文江,杨崔,王涛.基于蚁群优化的模糊神经网络控制器的应用研究[J],工矿自动化,2009,3:14-17.
    [130]李洪兴.变论域自适应模糊控制器[J].中国科学(E辑),1999,29(l):32-42.
    [131]龙祖强,变论域模糊控制器的若干重要问题研究[D].长沙:中南大学博士学位论文,2007:1-30.
    [132] Chen Y, Lei J H, Yang X B.Variable diseourse of universe fuzzy-PID tern-perature control system for vacuum smelting based on PLC[C]. Proceedingsof the2009WRI Global Congress on Intelligent Systems.Xiamen,2009:541-544.
    [133] Guo C,Zhao J X,Chen Z Q,et al.H-ilfinity variable universe fuzzy control forhysteretic systems[J].Journal of University of Seience and Teehnology ofChina,2007,37(9):1130-1136.
    [134]高淑芝,高宪文,朱志承.基于变论域模糊PID的汽提塔温度控制方法[J].东北大学学报(自然科学版),2010,31(10):1369-1372.
    [135]李红伟.变论域模糊控制的无刷直流电机控制系统[J].控制工程,2010,17(5):599-602.
    [136]白寒,管成,吴彦来.推土机半物理试验系统与作业效率复合控制研究[J].农业机械学报,2010,41(1):34-40.
    [137]李盼池.量子计算及其在智能控制中的应用[D].哈尔滨:哈尔滨工业大学博士学位论文,2009:110-125.
    [138]杨树仁,沈洪远.基于相关向量机的机器学习算法研究与应用[J].计算技术与自动化,2010,29(1):43-47.
    [139]古劲声.基于混沌同步与相关向量机的入侵检测算法研究[D].上海:上海交通大学硕士毕业论文,2010:49-55.
    [140] Lu C H, Chang N N. A novel algorithm for moving objects recognition basedon sparse Bayesian classification[C].Proceedings of the200616thIEEESignal Processing Society Workshop,2006,135-139.
    [141]何曙光,郑轶松,齐二石,等.复杂曲面拟合的相关向量机模型及其泛化能力[J].系统工程,2009,27(12):73-78.
    [142]朱世增,党选举.基于相关向量机的非线性动态系统辨识[J].计算机仿真,2008,25(6):102-107.
    [143]吴良海.基于粒子群优化相关向量机的网络入侵检测[J].微电子学与计算机,2010,27(5):181-184.
    [144]张昱,谢小鹏.基于遗传相关向量机的图像分类技术[J].计算机仿真,2011,8(5):283-285.
    [145]王凯,张永祥,李军.基于支持向量机的齿轮故障诊断方法研究[J].振动与冲击,2006,25(6):97-99.
    [146]李永龙,邵忍平,薛腾.基于小波神经网络的齿轮系统故障诊断[J].航空动力学报,2010,25(1):234-240.
    [147]李书磊.基于小波神经网络的齿轮故障模式识别[D].武汉:武汉科技大学硕士学位论文,2007:35-45.
    [148] Soulignac M.Feasible and optimal path planning in strong current fields [J].IEEE Transactions on Robotics,2011,27(1):89-98.
    [149]蔡自兴,贺汉根,陈虹.未知环境中移动机器人导航控制理论与方法[M].北京:科学出版社,2009:5-70.
    [150]朱毅,张涛,宋靖雁.非完整移动机器人的人工势场法路径规划[J].控制理论与应用,2010,27(2):152-158.
    [151] Peter J.Using evolved paths for control in robot soccer[C].Proceedings ofIEEE International Symposium on Computational Intelligence in Robotics andAutomations,2003:735-740.
    [152] Rahul K, Anupam S, Ritu T. Robotic path planning in static environmentusing hierarchical multi-neuron heuristic search and probability[J]. Neurocomputing,2011,74(14):2314-2335.
    [153] Taharwa I,Sheta A,Weshan M.A mobile robot path planning using geneticalgorithm in static environment[J].Journal of Computer Science,2008,4(4):341-344.
    [154]陈卫东,朱奇光.基于模糊算法的移动机器人路径规划[J].电子学报,2011,39(4):971-980.
    [155] Sedighi K H, Ashenayi K, et al. Autonomous local path planning for a mobilerobot using a genetic algorithm[C]. Proceedings of the Congress onEvolutionary Computation.United states,2004,2:1338-1345.
    [156]雷艳敏,朱齐丹,冯志彬.基于速度障碍和行为动力学的动态路径规划[J].华中科技大学学报(自然科学版),2011,39(4):15-19.
    [157] Zhang H D, Liu S R.On-line affective cognitive learning and decision-making for autonomous navigation of rnobile robots[C]. Proceedings of the2009IEEE Intemational Conference on Information and Automation.China,2009,1234-1239.
    [158] Yan S Q, F W P,et al.Research on application of genetic algorithm for intelli-gent mobile robot navigation based on dynamic approach[C]. Proeeedings ofthe IEEE International Conference on Autornation and Logistics.China,2007:898-902.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700