摘要
潜艇导航规划是实现潜艇自动化、智能化航行的关键技术之一,其研究目的在于如何使潜艇更快更好的完成上层指令规定的任务,按照安全航行、隐蔽航行、快速航行的优化目标自动规划出由当前点到指定目标位置的最优航线。从算法执行过程来看,导航规划主要由环境建模和路径优化搜索两部分组成。因此,导航规划问题可以归结为优化搜索问题。
蚁群算法是20世纪90年代初提出的一种群智能优化算法。其优越的问题分布式求解模式在组合优化问题的求解中取得了极大成功,引起了相关领域学者的广泛关注。实践已经证明,蚁群算法能够很好的解决复杂非线性条件下的多约束优化问题。本文主要针对蚁群优化方法及其在潜艇导航规划中的应用进行研究,论文主要研究工作如下:
1.概述了蚁群算法的基本原理,对ACS算法的值收敛性和解收敛性进行了详细分析,证明了标准ACS算法能够值收敛,但无法实现解收敛。通过对标准ACS算法进行改进,选择适当的信息素值下限函数,可以同时实现ACS算法的值收敛和解收敛。
2.给出了状态转移策略的一般表示形式,提出了蚁群算法中选择函数、选择概率、选择强度的概念,并设计了三种选择函数,就不同选择函数对蚁群算法性能的影响进行了理论和仿真分析。提出了一种基于粒子群优化的蚁群算法参数选取方法,将蚁群算法的参数选取看作一个优化问题,使用粒子群优化算法对其进行迭代寻优。该方法能够方便有效地实现蚁群算法参数的优选,有利于蚁群算法的应用和推广。
3.基于提高离散域蚁群算法寻优能力和寻优速度两方面考虑,分别提出并设计了协同多蚁群伪并行优化算法和空间收缩蚁群优化算法。协同多蚁群伪并行优化算法使用采用不同算法实例模型的多个子蚁群并行独立的构建问题的解,通过信息交互的方式综合各子蚁群信息素矩阵上累积的历史经验信息,保证信息素分布的指导性和多样性,提高了算法的寻优能力和稳定性。空间收缩蚁群优化算法在运行过程中通过不断的整合信息素浓度较高的构造块,从而缩小解的组成成分集合和构造块集合的规模,加快了算法运行速度。
4.通过对蚂蚁觅食过程中蚁群的分布与食物源的关系进行深入的分析,提出了一种基于蚁群觅食行为的改进连续域优化算法。设计了算法解的表达形式、信息素分布模型、状态转移策略、信息素更新规则和约束条件处理方法,并就算法参数对算法性能的影响进行了定性分析。对一类无约束和一类有约束基准测试函数的求解结果表明,该算法具有收敛速度快和全局寻优能力强的优点。
5.针对基于蚁群优化的潜艇三维空间导航规划的实现方法及其关键技术进行了深入研究。分别以空间收缩蚁群优化算法和基于蚁群觅食行为的改进连续域优化算法为基础,设计了潜艇三维空间导航规划算法。获得的两种导航规划算法不仅能够灵活地规划出具有不同特点的优化路径,而且可以方便容易地处理各种约束,具有较强的搜索能力,能够很好的解决潜艇三维空间导航规划问题。
Submarine navigation planning is one of the key technologies in Submarine automation and intelligent navigation. The aim of its research is how to make submarine accomplish the mission from upper command fasterly and better; according to the optimization objective of safe, hidden, fast navigation, planning automatically optimum route from recent point to intended target point. In the process of algorithm execution, the navigation planning mainly composese by two parts, environment modeling and path optimization search. Thus, the problem of navigation planning can be regarded as an optimization search.
Ant colony optimization algorithm is a swarm intelligence optimization algorithm proposed in the early 1990s. The superiority of distributed solution model of problem in solving combinatorial optimization problem is very great, and this causese scientists' large attention in concerned fields. The practice has shown that, ant colony optimization algorithm can well solve problems of multi-constraint optimization under complicated nonlinear conditions. This paper is mainly about ant colony optimization algorithm and its application in submarine navigation planning, including:
1. The basic principle of the ant colony optimization algorithm is summarized, and the convergence of value and solution for the standard ACS algorithm is analysed in detail. It can not prove the ablitiy of the solution convergence, but the value convergence can. By improving the standard ACS algorithm, choosing appropriate lower function of pheromone value, we can get both of them.
2. The general representation of state transition strategy is given. We also propose three concepts of ant colony algorithm: selection function, selection probability and selection intensity, then design three selection functions. To each function, theory and simulation analysis on influence of performance of ant colony algorithm have been done. A parameter selection method of ant colony algorithm is proposed. Based on particle swarm optimization, it regards parameter selection as an optimization problem, then iterates particle swarm optimization algorithm for optimization. This method can realize the optimization of ant colony algorithm and is good for its application and popularization.
3. In order to inproving the optimization ability and speed in ant colony algorithm in discrete domain, we design two algorithms: virtual parallel ant colonies optimization algorithm based on cooperative multiple ant colonies and ant colonies optimization algorithm based on space contraction. In the former one, many children ant colonies adopted different case algorithm model consist the problem solution in concurrent and independence. It can ensure the instructive and diversity of pheromone distribution by synthetizing experience information from each pheromone matrix of children ant colonies through information interaction, and it can improve the optimization ability and stability. In the latter one, it can reduce the solution compositions and the scale of structure block set by continually integrating the structure block with thick pheromones in execute process, and it can work faster.
4. Based on deep analysis of relationship between ant colony distribution and food source in ant foraging process, an improved ant colony algorithm in continuous domain based on ant foraging behavior is proposed. We design the representation of algorithm solution, pheromone distribution model, state transition strategy, pheromone update rules and processing method of constraint conditions. Then, influence of algorithm performance to parameters is qualitatively analyzed. The results of one kind of benchmark test function with or without constraints show that, this algorithm is converged faster and has strong global optimization ability.
5. According to the deep research of way and key technologies of submarine navigation planning in three dimensional spaces based on ant colony optimization, we design submarine navigation planning algorithms in three dimensional space, which is respectively based on space contraction ant colonies optimization algorithm and ant colony algorithm in continuous domain. These two algorithms for navigation planning not only can plan neatly optimization path with different characters, but also can deal with different constraints. It has srong searching ability and can work out the problem of submarine navigation planning in three dimensional spaces perfectly.
引文
[1]张丽平.粒子群优化算法的理论及实践.浙江大学博士学位论文.2005年1月:1-15页.
[2]钟一文.智能优化方法及其应用研究.浙江大学博士学位论文.2005年5月:1-23页.
[3]M.Dorigo,V.Maniezzo,A.Colomi.Positive feedback as a search strategy.Dipartimento di Elettronica,Politecnico di Milano,Italy,Tech.Rep.91-016,1991,
[4]A.Colomi,M.Dorigo,V.Maniezzo,et al.Distributed opt,imization by ant colonies.Proceedings of the 1st European Conference on Artificial Life,1991:134-142P.
[5]M.Dorigo,G.Di Caro.The Ant Colony Optimization meta-heuristic.In D.Come,M.Dorigo,and F.Glover,editors,New Ideas in Optimization[M],McGraw Hill,London,UK,1999:11-32P.
[6]圳小兵.蚁群优化原理、理论及其应用研究.重庆大学博士学位论文.2004年3月:1-56页.
[7]M.Dorigo,V.Maniezzo,A.Colorni.Ant system:optimization by a colony of cooperating agents.IEEE Transaction on Systems,Man,and Cybernetics-Part B,1996,26(1):29-41P.
[8]E.Bonabeau,M.Dorigo,G.Theraulaz.Inspiration for optimization from social insect behavior.Nature,2000,406(6):39-42P.
[9]Michael J B K,Jean-Bernard B,Laurent K.Ant-like task and recruitment in cooperative robots.Nature,2000,406(31):992-995P.
[10]D E Jackson,M Holcombe,F L W Ratnieks.Trail geometry gives polarity to ant foraging networks.Nature,2004,432(7019):907-909P.
[11]段海滨,王道波,于秀芬.蚁群算法的研究进展评述.自然杂志.2006,28(2):102-105页.
[12]L M Gambardella,M.Dorigo.Ant-Q:a reinforcement learning approach to the traveling salesman problem.Proceedings of the 12th International Conference on Machine Learning.1995:252-260P.
[13]M.Dorigo,L M Gambardella.Ant Colony System:A Cooperative learning Approach to the Traveling Salesman Problem.IEEE Trans.On Evolutionary Computation.1997,1(1):53-66P.
[14]T.St(U|¨)tzle,H.Hoos.The MAX-MIN ant system and local search for the traveling salesman problem.Proceedings of the IEEE International Conference on Evolutional Computation and Evolutionary Programming Conference,1997:309-314P.
[15]C.Blum,A.Roli,M.Dorigo.HC-ACO:The hyper-cube framework for ant colony optimization,in Proceedings of MIC'2001 Metaheuristics International Conference.2001,Vol.2:399-403P.
[16]W J Gutjahr.A generalized convergence result for the graph based ant system,Technical Report 99-09,Dept.of Statistics and Decision Support Systems,University of Vienna,Austria,1999
[17]W J Gutjahr.A graph-based ant system and its convergence.Future Generation Computer Systems.2000,16(8):873-888P.
[18]T.St(u|¨)tzle,M.Dorigo.A Short Convergence Proof'for a Class of Ant Colony Optimization Algorithms.IEEE Transactions on Evolutionary Compution.2002,Vol.6,No.4:358-365P.
[19]GutjahrWJ.ACO algorithms with guaranteed convergence to the optimal solution.Information Processing Letters.2002,82(3):145-153P.
[20]孙焘,王秀坤,刘业欣等.一种简单蚂蚁算法及其收敛性分析.小型微型计算机系统.2003,21(8):1524-1526页.
[21]段海滨,王道波,于秀芬.蚁群算法的全局收敛性研究及改进.系统工程与电子技术.2004,26(10):1506-1609页.
[22]丁建立,陈增强,袁著祉..遗传算法与蚂蚁算法融合的马尔科夫收敛性分析.自动化学报.2004,30(4):659-664页.
[23]M.Birattari,G.Di Caro,M.Dorigo.Toward the formal foundation of ant programming,in Ant Algorithms—Proceedings of ANTS 2002—Third International Workshop,ser.LNCS,M.Dorigo et al.,Eds.2002,Springer Verlag,Voi.2463:188-201P.
[24]N.Meuleau and M.Dorigo.Ant colony optimization and stochastic gradient descent.Artificial Life.2002,Vol.8,No.2:103-121P.
[25]M.Zlochin,M.Birattari,N.Meuleau,M.Dorigo.Model-based search for combinatorial optimization.Technical Report TR/IRIDIA/2001-15,IRID IA,Universit'e Libre de Bruxelles.2001.
[26]N.Meuleau,M.Dorigo.Ant colony optimization and stochastic gradient descent. Artificial Life. 2002, Vol.8, No.2:103-121P.
[27] C.Blum. Theoretical and Practical Aspects of Ant Colony Optimization, ser.Dissertations in Artificial Intelligence. Akademische Verlagsgesellschaft Aka GmbH, Berlin, Germany, 2004, Vol.282.
[28] C.Blum, M.Dorigo. Search bias in ant colony optimization: On the role of competition-balanced systems. IEEE Transactions on Evolutionary Computation. 2005, Vol.9, No.2: 159-174P.
[29] D.Merkle, M.Middendorf. Modelling the dynamics of ant colony optimization algorithms. Evolutionary Computation. 2002, Vol.10, No.3:235-262P.
[30] R.Schoonderwoerd, O.Holland, J.Bruten, L.Rothkrantz. Ant-based load balancing in telecommunications networks. Adaptive Behavior, 1996, 5(2):169-207P.
[31] D.Subramanian, P.Druschel, J.Chen. Ants and reinforcement learning: A case study in routing in dynamic networks. In Proceedings of the 15th International Joint Conference on Artificial Intelligence. San Francisco,Morgan Kaufmann. 1997: 832-838P.
[32] M.Heusse, D.Snyers, S.Guerin, P.Kuntz. Adaptive agent-driven routing and load balancing in communication networks. Advances in Compplex Systems. 1998,1(2): 237-254P.
[33] L.M.Gambardella, E.D.Taillard, GAgazzi. MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. New Ideas in Optimization. London, McGraw Hill, 1999: 63-76P.
[34] C.E.Mariano, E.Morales. MOAQ: An Ant-Q algorithm for multiple objective optimization problems. Proceedings of the Genetic and Evolutionary Computation Conference(GECCO-1999). San Francisco,Morgan Kaufmann, 1999, Vol.1: 894-901P.
[35] K.Doerner, R.F.Hartl, M.Reimann. Cooperative ant colonies for optimizing resource allocation in transportation. Applications of Evolutionary Computing: Proceedings of EvoWorkshops 2001, Lecture Notes in Computer Science. 2001, Vol.2037: 70-79P.
[36] S.Iredi, D.Merkle, M.Middendorf. Bi-criterion optimization with multi-colony ant algorithms..First International Conference on Evolutionary Multi-Criterion Optimization (EMO'01), Lecture Notes in Computer Science.2001,Vol.1993:359-372P.
[37]T.Lazano-Perez.Automatic planning of transfer movements.IEEE Trans.On Sys,Man and Cyb.1981,11(10):681-689P.
[38]Perez.Automatic planning of manipulator movements.IEEE Trans.On Sys,Man and Cyb.1981,11(11):681-698P.
[39].周培德,卢开澄.计算几何—算法分析与设计.北京:清华大学出版社,广西科学技术出版社.2000:1-85页.
[40]P.C.Kevin,R.M.Stephen,L.N.Eric,M.B.David,K.EDonald,N.W.Glen.AUV Path Planning:an A~* Approach to Path Planning with Consideration of Variable Vehicle and Multiple,Overlapping,Timo-Dependent Exclusion Zones.IEEE.
[41]Flann,Saunders,Pells.Cooperative Mission Planning and Execution.Proceedings of the SPIE Conference on Robotics and Semi-robotic Ground Vehicles Technology.Orlando,Florida.1998,4.
[42]艾海舟,张钹.基于拓扑的路径规划问题的图形算法.机器人.1990,12(5):20-24页.
[43]R.R.Murphy.Introduction to AI Robotics,MIT Press.2002:143-165P.
[44]H.Choset,K.Nagatani.Topological simultaneous location and mapping:toward exact localization without explicit localization.IEEE Trans.On Robotics and Automation.2001,17(2):125-137P.
[45]H.Weber.A motion planning and execution system for mobile robots driven by stepping motors.Robotics and Autonomous Systems.2000,33(4):207-221P.
[46]O.Khatib.Real-time obstacle avoidance for manipulators and mobile robots.The International Journal Robotics Research.1986,5(1):90-98P.
[47]孙增圻.机器人智能控制.山西教育出版社.1995:433-450页.
[48]禹建丽,李晓燕,王跃明,韩平.一种基于神经网络的机器人路径规划算法.洛阳工学院学报.2001,Vol.22,No.1:31-34页.
[49]朱咏杰,王树国,常疆.一种基于神经网络的移动机器人路径规划算法.高技术通讯.2002,No.9:42-45页.
[50]Harmut Surmann,Jrg Huser,Jens Wehking.Path planning for a fuzzy controlled autonomus mobile robot.Fifth IEEE Int.Conf.On Fuzzy System Fuzz-IEEE'96.USA:New Orleans,1996
[51]张汝波,顾国昌,张国印.水下智能机器人模糊局部规划器设计.机器 人.1996,Vol.18,No.3:158-162页.
[52]庄晓东,孟庆春,殷波.动态环境中基于模糊概念的机器人路径搜索方法.机器人.2001,Vol.23,No.5:397-399页.
[53]张菁,王立权,张铭钧.基于模糊决策法的水下机器人路径规划方法.哈尔滨工程大学学报.2001,Vol.22,No.1:49-54页.
[54]张京娟.基于遗传算法的水下潜器自主导航规划技术研究.哈尔滨工程大学博士学位论文.2003年11月:1-130页.
[55]吴晓涛,孙增圻.用遗传算法进行路径规划.清华大学学报(自然科学版).1995,Vol.35,No.5:14-19页.
[56]周明,孙树栋,彭炎午.用遗传算法规划机器人路径.西北工业大学学报.1998,Vol.16,No.4:581-583页.
[57]金飞虎,洪炳熔,高庆吉.基于蚁群算法的自由飞行空间机器人路径规划.机器人.2002,Vol.24 No.6:526-529页.
[58]朱庆保.动态复杂环境下的机器人路径规划蚂蚁预测算法.计算机学报.2005,28(11):1898-1906页.
[59]岳富占,崔平远,崔祜涛.基于改进蚁群算法的星球探测机器人路径规划技术.控制与决策.2006,Vol.21 No.12:1437-1440页.
[60]张汝波,郭必祥,熊江.基于遗传蚁群算法的机器人全局路径规划研究.哈尔滨工程大学学报.2004,Vol.25 No.6:724-727页.
[61]胡小兵,黄席樾.基于蚁群算法的三维空间机器人路径规划.重庆大学学报.2004,27(8):132-135页.
[62]闻育.复杂多阶段动态决策的蚁群优化方法及其在交通系统控制中的应用.浙江大学博士学位论文.2004年4月:1-39页.
[63]段海滨.蚁群算法原理及其应用.北京:科学出版社.2005,12:1-209页,374-419页.
[64]C.Blum,M.Dorigo.The Hyper-Cube Framework for Ant Optimization.IEEE Transactions on Systems,Man,and Cybernetics-part B:cybernetics.2004,34(2):1161-1172P.
[65]L.P.kaelbling,A.W.Moore.Reinforcement Learning:A Survey.Journal of Artificial Intelligence Research.1996,4:237-285P.
[66]B.Bullnheimer,R.F.Hartl,C.Strauss.A new rank-based version of the ant system:a computational study.Central European Journal for Operations Research and Economics.1999,7(1):25-38P.
[67]T.St(u|¨)tzle.Local Search Algorithms forCombinatorial Problems:Analysis, Improvements,and New Applications.1999,Vol.220 of DISKI.Sankt Augustin,Germany,Infix.
[68].M.Dorigo,T.StUtzle著,张军,胡晓敏,罗旭耀等译.蚁群优化.清华大学出版社.2007年1月:1-263页.
[69]T.St(u|¨)ezle,M.Dorigo.A short covergenee proof for a class of ant colony optimization algorithms.IEEE Transactions on Evolutionary Computation.2002,6(4):358-365P.
[70]J.H.Yoo,R.J.La,A.M.Makowski.Convergence results for ant routing.Technical Report CSHCN 2003-46.Institute for Systems Research,University of Maryland,College Park.2003
[71]J.H.Yoo,R.J.La,A.M.Makowski.Convergence of ant routing algorithms results for simple parallel network and Perspectives.Technical Report CSHCN 2003-44.Institute for Systems ResearCh,University of Maryland,College Park,2003
[72]A.Badr,A.Fahmy.A proof of convergence for ant algorithms.International Journal of Intelligent Computing and Information.2003,3(1):22-32P.
[73]赵霞.蚁群优化算法及其收敛性证明.南京师范大学硕士学位论义.2006年4月:25-30页.
[74]赵霞,田恩刚.蚁群系统(ACS)及其收敛性证明.计算机工程与应用,2007,43(5):67-70页.
[75]J.L.Deneubourg,S.Aron,S.Goss,J.M.Pasteels.The self-organizing exploratory pattern of the Argentine ant,Journal of Insect Behavior.1990,3:159-168P.
[76]詹士昌,徐婕,吴俊.蚁群算法中有关算法参数的最优选择.科技通报.2003,Vol19,No.5:381-386页.
[77]叶志伟,正肇葆.蚁群算法中参数α、β、ρ设置的研究——以TSP问题为例[J].武汉大学学报·信息科学版.2007,Vol.29,No.7:597-601页.
[78]Hozefa M.Botee,Eric Bonabeau,Evolving Ant Colony Optimization.Complex Systems.1998(1):149-159P.
[79]黄永青,梁昌勇,张祥德.基于均匀设计的蚁群算法参数设定.控制与决策.2006,Vol.21 No.1:93-96页.
[80]闵克学.蚁群——粒子群优化算法混合求解TSP问题.吉林大学:吉林大学硕士学位论文.2005年5月:24-29页.
[81]闵克学,葛宏伟,张毅,梁艳春.基于蚁群和粒子群优化的混合算法求 解TSP问题.吉林大学学报(信息科学版).2006,Vol.24 No.4:402-405页.
[82]Kennedy J,Eberhart.RC.Particle Swarm Optimization.Proceedings of IEEE International Conference on Neural Networks.Piscataway.1995:193-197P.
[83]王俊伟.粒子群优化算法的改进及应用.东北大学博士学位论文.2006年1月:1-34页.
[84].M.Dorigo.Optimization,learning and natural algorithm(in italian).Ph.D.dissertation,Dipartimento di Elettronica,Politecnico di Milano,Italy,1992
[85]王颖,谢剑英.一种自适应蚁群算法及其仿真研究.系统仿真学报,2002,14(1):31-33页.
[86]Y Wang,J Y Xie.Ant colony optimization for multicast routing.Proceedings of the IEEE Asia-Pacific Conference on Circuits and Systems.2000:54-57P.
[87]黄国锐,曹先彬,王煦法.基于信息素扩散的蚁群算法.电子学报,2004,32(5):865-868页.
[88]李炳宇,萧蕴诗.基于模式求解旅行商问题的蚁群算法.同济大学学报.2003,31(11):1348-1352页.
[89]胡小兵,黄席樾.基于混合行为蚁群算法的研究.控制与决策,2005,Vol.20 No.1:69-72页.
[90]陈烨.变尺度混沌蚁群优化算法.计算机工程与应用.2007,43(3):68-70页.
[91]丁建立,陈增强,袁著址.遗传算法与蚂蚁算法的融合.计算机研究与发展.2003,40(9):1531-1536页.
[92]候云鹤,熊信良,吴耀武等.广义蚁群与粒子群结合算法在电力系统经济负荷分配中的应用.电网技术.2004,28(21):34-38页.
[93]Abbattista F,Abbattista N,Caponetti L.An evolutionary and cooperative agents model for optimization.Proceeding of the IEEE International Conference on Evolutionary Computation.1995,2:668-671P.
[94]Li S H,Liu Z M.A general CAC approach using novel ant algorithm training based neural network.Proceedings of the.International Joint Conference on Neural Networks.1999,3:1885-1888P.
[95]Lee Z J,Lee C Y,Su S F.An immunity-based ant colony optimization algorithm for solving weapon-target assignment problem.Applied Soft Computing.2002,2(1):39-47P.
[96]Shu-Chuan Chu,John F.Roddick,Jent-Shyang Pan.Ant colony system with communication strategies.Information Sciences.2004:63-76P.
[97]JUN OUYANG,GUI-RONG YAN.A multi-group ant colony system algorithm for TSP.Proceedings of the Third International Conference on Machine Learning and Cybernetics.Shanghai.2004,8:117-121P.
[98]B.Bullnheimer,R.F.Hartl,C.Strauss.A new rank-based version of the ant system:a computational study.Central European Journal for Operations Research and Economics.1999,7(1):69-71P.
[99]I Watanabe,S Matsui.Improving the performance of ACt algorithms by adaptive control of candidate set.Proceedings of the 2003 Congress on Evolutionary Computation.2003,2:1355-1362P.
[100]吴庆洪,张纪会,徐心如.具有变异特征的蚁群算法.计算机研究与发展.1999,36(10):1240-1245页.
[101]陈崚,秦玲,陈宏建等.具有感觉和知觉特征的蚁群算法.系统仿真学报.2003,15(10):1418-1425页.
[102]徐精明,曹先彬,王煦法.多态蚁群算法.中国科学技术大学学报.2005:35(1):59-65页.
[103]段海滨,王道波,于秀芬等.基于云模型理论的蚁群算法改进研究.哈尔滨工业大学学报.2005,37(1):115-119页.
[104]K.A.De Jong.An analysis of the behavior of a class of genetic adaptive systems(Ph.D Dissertation).University of Michigan.No.76-9381,1975
[105]K.A.De Jong.Genetic algorithms:a 25 year perspective.In Proceedings of the fitch International Conference on Genetic Algorithms(ICGA 5),Whitley,L.D.(ed.),San Mateo,CA:Morgan Kaufmann.1993:169-177P.
[106]S.W.Mahfoud.Crowding and pre-selection revisited.In Paralled Problem Soling from Nature(PPSN 2),Manner,R.,and Manderick,B.(eds.),North-Holland,Elsevier Science Publishers,Amsterdam,1992
[107]D.E.Goldberg,M.Rudnick.Genetic algorithms and the variance of fitness.Complex Systems.1991,5:265-278P.
[108]R.K.Belew,M.D.Vose.Foundations of genetic algorithms 4.San Francisco,CA:Morgan Kaufmann Publishers,Inc.,1997
[109]B.L.Miller,M.J.Shaw.Genetic Algorithms with dynamic niche sharing for multi-modal function optimization.In IEEE International Conference on Evolutionary Computation.Piscataway,NJ:IEEE Press.1996:786-791P.
[110]G.Bilchev,I.C.Parmee.The ant colony metaphor for searching continuous design spaces.In:Fogarty,T.C.(Ed.),Proceedings of the AISB Workshop on Evolutionary Computation.1995,Vol.993 of LNCS:25-39P.
[111]J.Dreo,P.Siarry.Continuous interacting ant colony algorithm based on dense hierarchy.Future Generation Computer Systems.2004,20(5),841-856P.
[112]N.Monmarche,G.Venturini,M.Slimane.On how Pachycondyla apicalis ants suggest a new search algorithm.Future Generation Computer Systems.2000,16:937-946P.
[113]K.Socha,M.Dorigo.Ant colony optimization for continuous domains.European Journal of Operational Research,2006.06.046.
[114]高尚,钟娟,莫述军.连续优化问题的蚁群算法研究.微机发展.2003,13(1):21-22,69页.
[115]李艳军,吴铁军.连续空间优化问题的自适应蚁群系统算法.模式识别与人工智能.2001,14(4):423-427页.
[116]陈崚,沈洁,秦玲.蚁群算法求解连续空间优化问题的一种方法.软件学报.2002,13(12):2317-2323页.
[117]杨勇,宋晓峰,王建飞等.蚁群算法求解连续空间优化问题.控制与决策.2003,18(5):573-576页.
[118]段海滨,王道波,于秀芬等.一种改进的蚁群算法用于约束非线性规划问题求解.四川大学学报.2004,42(5):973-977页.
[119]程志刚,陈德钊,吴晓华.连续蚁群优化算法的研究.浙江大学学报(工学版).2005,Vol.39 No.8:1147-1151页.
[120]程志刚,陈德钊,吴晓华.基于信息素正态分布的连续蚁群优化系统.系统工程与电子技术.2006,Vol.28 No.3:458-462页.
[121]陈烨.用于连续函数优化的蚁群算法.四川大学学报.2004,Vol.36 No.6:117-120页.
[122]汪镭,吴启迪.蚁群算法在连续空间寻优问题求解中的应用.控制与决策.2003,Vol.18 No.1:45-48,57页.
[123]寇晓丽,刘三阳,张建科.一种随机蚁群算法求解连续空间优化问题.系统工程与电子技术.2006,Vol.28 No.12:1909-1911页.
[124]段海滨,马冠军,王道波,于秀芬.一种求解连续空间优化问题的改进蚁群算法.系统仿真学报.2007,Vol.19 No.5:974-977页.
[125]程志刚.连续蚁群优化算法的研究及其化工应用.浙江大学博士学位论文.2005年8月:49-50页.
[126]李敏强,寇纪淞,林丹等著.遗传算法的基本理论与应用.北京:科学出版社.2002年3月:163-204页,233-244页,387-399页.
[127]M.Mameil,F.Zambonelli,L.Leonardi.Co-fields towards a unifying approach to the engineering of swarm intelligent systems.Petta,P.et al.(Eds.):ESAW.2002,LNAI 2577.2003:68-81P.
[128]K.E.Parsopoulos,M.N.Vrahatis.Recent approaches to global optimization problems through particle swarm optimization.Natural Computing.2002,1(2-3):235-306P.
[129]E.Ozcan,C.K.Mohan.Particle swarm optimization:surfing the waves.Proceedings of the IEEE Congress on Evolutionary Computation(CEC).Picataway,NJ.1999:1939-1944P.
[130]Hyun Myung,Jong-Hwan Kim.Hybird evolutionary programming for heavily constrained problems.BioSystems.1996,38:29-43P.
[131]Michalewica Z,Janikow C.Handling Constraints in Genetic Algorithms.In Proceedings of the Fourth International Conference on Genetic Algorithms.Morgan Kaufmann Publishers.1999:151-157P.
[132]Michalewica Z.Genetic algorithms+data structures=evolution programs,3~(rd) edition.New York:Springer-Verlag,1996
[133]S.Kern,S.D.M(u|¨)ller,N.Hansen,D.B(u|¨)che,J.Ocenasek,P.Koumoutsakos.Learning probability distributions in continuous evolutionary algorithms-A comparative review.Natural Computing.2004,3(1):77-112P.
[134]A.Ostermeier,A.Gawelczyk,N.Hansen.Step-size adaptation based on non-local use of selection information.In:Davidor,Y.,Schwefel,H.-P.,M(a|¨)nner,R.(Eds.),Parallel Problem Solving from Nature-PPSN Ⅲ.1994,Vol.866 of LNCS:189-198P.
[135]N.Hansen,A.Ostermeier.Completely derandomized self-adaptation in evolution strategies.Evolutionary Computation.2001,2(9),159-195P.
[136]P.A.N.Bosman,D.Thierens.Continuous iterated density estimation evolutionary algorithms within the IDEA framework.In:Pelikan,M.,M(u|¨)hlenbein,H.,Rodriguez,A.O.(Eds.),Proceedings of OBUPM Workshop at GECCO-2000.Morgan-Kaufmann Publishers,San Francisco,CA.2000:197-200P.
[137]R.Chelouah,P.Siarry.A continuous genetic algorithm designed for the global optimization of multimodal functions.Journal of.Heuristics.2000,6:191-213P.
[138]R.Chelouah,P.Siarry.Enhanced continuous tabu search.In:Voss,S.,Martello,S.,Osman,I.H.,Roucairol,C.(Eds.),Meta-Heuristics Advances and Trends in Local Search Paradigms for Optimization.Kluwer Academic Publishers,Boston,MA.1999:49-61P.
[139]P.Siarry,G.Berthiau,F.Durbin,J.Haussy.Enhanced simulated annealing for globally minimizing functions of many continuous variables.ACM Transactions on Mathematical Software.1997,23(2):209-228P.
[140]R.Storn,K.Price.Differential Evolution-A simple and efficient adaptive scheme for global optimization over continuous spaces.Technical Report TR-95-01.2,International Computer Science Institute,Berkeley,CA.1995
[141]Thomas P.Runarsson,Xin Yao.Stochastic Ranking for Constrained Evolutionary Optimization.IEEE Transactions on Evolutionary Computation.2000,4:284-294P.
[142]S.Koziel and Z.Michalewicz.Evolutionary algorithms,homomorphous mappings,and constrained parameter optimization.Evolutionary Compute.1999,Vol.7,No.1:19-44P.
[143]Ming yuchi,Jong-Hwan Kim,Jun Jo.A population ecology inspired parent selection strategy for numerical constrained optimization problems.Published by Elsevier Inc,2007.
[144]C.W.Warren.A Technique for Autonomous Underwater Vehicle Route Planning.IEEE J.of Oceanic Engineering.1990,No.15:199-204P.
[145]孙茂相,王艳红,吴学曼.动态补偿的水下机器人路径规划.机器人.1993,No.2:8-12页.
[146]Kevin P.Caroll,Stephen R.McClaran,Eric L.Nelson et al.AUV Path Planning:An A~* Approach.Proc.Symp.on AUV Technology.Washington D.C.1992:79-84P.
[147]C.Vasudevan,K.Ganesan.Case-Based Path Planning for Autonomous Underwater Vehicles.Autonomous Robots.1996,No.3:79-89P.
[148]尚游,刘百顺,张万春等.基于案例的自主式水下机器人全局路径规划的学习方法.哈尔滨工程大学学报.1998,Vol.26,No.1:30-35页.
[149]田峰敏,基于先验地形数据处理的水下潜器地形辅助导航方法研究.哈尔滨工程大学硕士学位论文.2007年3月:19-35页.