基于双层遗传算法的路径规划

Jin Lu, Dongyong Yang
{"title":"基于双层遗传算法的路径规划","authors":"Jin Lu, Dongyong Yang","doi":"10.1109/ICNC.2007.546","DOIUrl":null,"url":null,"abstract":"It is a more difficult problem to plan path in environment which with both static obstacles and dynamic obstacles. Double-layer genetic algorithm mechanism is brought up in this paper. It introduces the method which deals with static obstacles avoidance and dynamic avoidance respectively. Optimized operator and adaptive technology are designed to speed up creating optimized path. The result of experimentation is show that multifactor could be taken into account synthetically and the best path could be convergent by this way.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Path Planning Based on Double-Layer Genetic Algorithm\",\"authors\":\"Jin Lu, Dongyong Yang\",\"doi\":\"10.1109/ICNC.2007.546\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is a more difficult problem to plan path in environment which with both static obstacles and dynamic obstacles. Double-layer genetic algorithm mechanism is brought up in this paper. It introduces the method which deals with static obstacles avoidance and dynamic avoidance respectively. Optimized operator and adaptive technology are designed to speed up creating optimized path. The result of experimentation is show that multifactor could be taken into account synthetically and the best path could be convergent by this way.\",\"PeriodicalId\":250881,\"journal\":{\"name\":\"Third International Conference on Natural Computation (ICNC 2007)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Natural Computation (ICNC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2007.546\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Natural Computation (ICNC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2007.546","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

摘要

在既有静态障碍物又有动态障碍物的环境中进行路径规划是一个比较困难的问题。本文提出了双层遗传算法机制。介绍了静态避障和动态避障的处理方法。设计了优化算子和自适应技术,加快了优化路径的生成速度。实验结果表明,该方法能综合考虑多因素,并能收敛出最佳路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Path Planning Based on Double-Layer Genetic Algorithm
It is a more difficult problem to plan path in environment which with both static obstacles and dynamic obstacles. Double-layer genetic algorithm mechanism is brought up in this paper. It introduces the method which deals with static obstacles avoidance and dynamic avoidance respectively. Optimized operator and adaptive technology are designed to speed up creating optimized path. The result of experimentation is show that multifactor could be taken into account synthetically and the best path could be convergent by this way.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信