{"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}
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.