基于蚁群优化的自动驾驶车辆同步任务分配与路径规划

A. Kulatunga, D. Liu, G. Dissanayake, S. Siyambalapitiya
{"title":"基于蚁群优化的自动驾驶车辆同步任务分配与路径规划","authors":"A. Kulatunga, D. Liu, G. Dissanayake, S. Siyambalapitiya","doi":"10.1109/ICCIS.2006.252349","DOIUrl":null,"url":null,"abstract":"This paper applies a meta-heuristic based ant colony optimization (ACO) technique for simultaneous task allocation and path planning of automated guided vehicles (AGV) in material handling. ACO algorithm allocates tasks to AGVs based on collision free path obtained by a proposed path and motion planning algorithm. The validity of this approach is investigated by applying it to different task and AGV combinations which have different initial settings. For small combinations, i.e. small number of tasks and vehicles, the quality of the ACO solution is compared against the optimal results obtained from exhaustive search mechanism. This approach has shown near optimal results. For larger combinations, ACO solutions are compared with simulated annealing algorithm which is another commonly used meta-heuristic approach. The results show that ACO solutions have slightly better performance than that of simulated annealing algorithm","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"title\":\"Ant Colony Optimization based Simultaneous Task Allocation and Path Planning of Autonomous Vehicles\",\"authors\":\"A. Kulatunga, D. Liu, G. Dissanayake, S. Siyambalapitiya\",\"doi\":\"10.1109/ICCIS.2006.252349\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper applies a meta-heuristic based ant colony optimization (ACO) technique for simultaneous task allocation and path planning of automated guided vehicles (AGV) in material handling. ACO algorithm allocates tasks to AGVs based on collision free path obtained by a proposed path and motion planning algorithm. The validity of this approach is investigated by applying it to different task and AGV combinations which have different initial settings. For small combinations, i.e. small number of tasks and vehicles, the quality of the ACO solution is compared against the optimal results obtained from exhaustive search mechanism. This approach has shown near optimal results. For larger combinations, ACO solutions are compared with simulated annealing algorithm which is another commonly used meta-heuristic approach. The results show that ACO solutions have slightly better performance than that of simulated annealing algorithm\",\"PeriodicalId\":296028,\"journal\":{\"name\":\"2006 IEEE Conference on Cybernetics and Intelligent Systems\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Conference on Cybernetics and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIS.2006.252349\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Conference on Cybernetics and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIS.2006.252349","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26

摘要

本文将基于元启发式的蚁群优化(ACO)技术应用于自动导引车(AGV)在物料搬运过程中的同步任务分配和路径规划。蚁群算法根据路径和运动规划算法得到的无碰撞路径为agv分配任务。将该方法应用于具有不同初始设置的不同任务和AGV组合,验证了该方法的有效性。对于小组合,即任务和车辆数量少,将蚁群算法解的质量与穷举搜索机制得到的最优结果进行比较。这种方法显示出接近最佳的结果。对于较大的组合,将蚁群算法与另一种常用的元启发式算法模拟退火算法进行比较。结果表明,蚁群算法的性能略优于模拟退火算法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Ant Colony Optimization based Simultaneous Task Allocation and Path Planning of Autonomous Vehicles
This paper applies a meta-heuristic based ant colony optimization (ACO) technique for simultaneous task allocation and path planning of automated guided vehicles (AGV) in material handling. ACO algorithm allocates tasks to AGVs based on collision free path obtained by a proposed path and motion planning algorithm. The validity of this approach is investigated by applying it to different task and AGV combinations which have different initial settings. For small combinations, i.e. small number of tasks and vehicles, the quality of the ACO solution is compared against the optimal results obtained from exhaustive search mechanism. This approach has shown near optimal results. For larger combinations, ACO solutions are compared with simulated annealing algorithm which is another commonly used meta-heuristic approach. The results show that ACO solutions have slightly better performance than that of simulated annealing algorithm
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multi-layer Control Strategy of Dynamics Control System of Vehicle A Fuzzy Multiple Critera Decision Making Method Gait Recognition Considering Directions of Walking Nonlinear Diffusion Driven by Local Features for Image Denoising Designing of an Adaptive Adcock Array and Reducing the Effects of Other Transmitters, Unwanted Reflections and Noise
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1