%0 Journal Article
%T Improved Ant Colony Algorithm with Planning of Dynamic Path<br>动态路径规划中的改进蚁群算法
%A ZHOU Ming-xiu
%A CHENG Ke
%A WANG Zheng-xia
%A <br>周明秀
%A 程科
%A 汪正霞
%J 计算机科学
%D 2013
%I 
%X In view of the shortcomings of slow rate of convergence and easy to fall into local optimal solution for the tra- ditional ant algorithm, this paper put forward to improve distance heuristic factor to encrease effects on the next node, so as to enhance the global search ability, avoid trap in local optimal solution and improve the rate of convergence. Con- sidering the complexity and diversity of the real environment, this paper introduced multiple path quality constraints to improve the rules of the pheromone update. I}he simulation results show the improved ant colony algorithm has a good effect in the dynamic path planning.
%K Dynamic path planning
%K Ant colony algorithm
%K Distance heuristic factor
%K Pheromome update<br>动态路径规划
%K 蚁群算法
%K 距离启发因子
%K 信息素更新
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=F2F3E0E822DEB5B21959CFAAC64C2E4B&yid=FF7AA908D58E97FA&vid=1371F55DA51B6E64&iid=CA4FD0336C81A37A&sid=AA5FB09E1F81059E&eid=EC34D52BE81085CE&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=0