基于遗传算法和蚁群优化的驾驶员意图识别方法

Zhou Shenpei, W. Chaozhong
{"title":"基于遗传算法和蚁群优化的驾驶员意图识别方法","authors":"Zhou Shenpei, W. Chaozhong","doi":"10.1109/ICNC.2011.6022185","DOIUrl":null,"url":null,"abstract":"A new recognition method for driver's intention is proposed in this study. Genetic algorithm (GA) has strong adaptability, robustness and quick global searching ability. It has such disadvantages as premature convergence, low convergence speed and so on. Ant colony optimization (ACO) converges on the optimization path through pheromone accumulation and renewal. It has the ability of parallel processing and global searching and the characteristic of positive feedback. But the convergence speed of ACO is lower at the beginning for there is only little pheromone difference on the path at that time. The hybrid algorithm of genetic algorithm and ant colony optimization adopts genetic algorithm to give pheromone to distribute. And then it makes use of ant colony optimization to give the precision of the solution. It develops enough advantage of the two algorithms. The comparative analysis on optimal performance is made by using the Camel function. Finally, the method is used for the optimized the decision tree of driver's intention recognition. The experimental result shows that the recognition method and the hybrid algorithm are feasible and effective.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"26 1","pages":"1033-1037"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A recognition method for driver's intention based on genetic algorithm and ant colony optimization\",\"authors\":\"Zhou Shenpei, W. Chaozhong\",\"doi\":\"10.1109/ICNC.2011.6022185\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new recognition method for driver's intention is proposed in this study. Genetic algorithm (GA) has strong adaptability, robustness and quick global searching ability. It has such disadvantages as premature convergence, low convergence speed and so on. Ant colony optimization (ACO) converges on the optimization path through pheromone accumulation and renewal. It has the ability of parallel processing and global searching and the characteristic of positive feedback. But the convergence speed of ACO is lower at the beginning for there is only little pheromone difference on the path at that time. The hybrid algorithm of genetic algorithm and ant colony optimization adopts genetic algorithm to give pheromone to distribute. And then it makes use of ant colony optimization to give the precision of the solution. It develops enough advantage of the two algorithms. The comparative analysis on optimal performance is made by using the Camel function. Finally, the method is used for the optimized the decision tree of driver's intention recognition. The experimental result shows that the recognition method and the hybrid algorithm are feasible and effective.\",\"PeriodicalId\":87274,\"journal\":{\"name\":\"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications\",\"volume\":\"26 1\",\"pages\":\"1033-1037\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2011.6022185\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2011.6022185","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本研究提出了一种新的驾驶员意图识别方法。遗传算法具有较强的适应性、鲁棒性和快速全局搜索能力。它具有收敛过早、收敛速度慢等缺点。蚁群优化算法通过信息素的积累和更新在优化路径上收敛。它具有并行处理和全局搜索的能力以及正反馈的特性。但蚁群算法在初始阶段的收敛速度较慢,因为当时路径上的信息素差异很小。遗传算法与蚁群算法的混合算法采用遗传算法进行信息素分配。然后利用蚁群算法给出了解的精度。充分发挥了两种算法的优势。利用Camel函数对最优性能进行了对比分析。最后,将该方法应用于驾驶员意图识别决策树的优化。实验结果表明,该识别方法和混合算法是可行和有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A recognition method for driver's intention based on genetic algorithm and ant colony optimization
A new recognition method for driver's intention is proposed in this study. Genetic algorithm (GA) has strong adaptability, robustness and quick global searching ability. It has such disadvantages as premature convergence, low convergence speed and so on. Ant colony optimization (ACO) converges on the optimization path through pheromone accumulation and renewal. It has the ability of parallel processing and global searching and the characteristic of positive feedback. But the convergence speed of ACO is lower at the beginning for there is only little pheromone difference on the path at that time. The hybrid algorithm of genetic algorithm and ant colony optimization adopts genetic algorithm to give pheromone to distribute. And then it makes use of ant colony optimization to give the precision of the solution. It develops enough advantage of the two algorithms. The comparative analysis on optimal performance is made by using the Camel function. Finally, the method is used for the optimized the decision tree of driver's intention recognition. The experimental result shows that the recognition method and the hybrid algorithm are feasible and effective.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信