噪声下的预期性污名性避碰

Friedrich Burkhard von der Osten, M. Kirley, Tim Miller
{"title":"噪声下的预期性污名性避碰","authors":"Friedrich Burkhard von der Osten, M. Kirley, Tim Miller","doi":"10.1145/2576768.2598389","DOIUrl":null,"url":null,"abstract":"Reactive path planning to avoid collisions with moving obstacles enables more robust agent systems. However, many solutions assume that moving objects are passive; that is, they do not consider that the moving objects are themselves re-planning to avoid collisions, and thus may change their trajectory. In this paper we present a model, Anticipatory Stigmergic Collision Avoidance (ASCA) for reciprocal collision avoidance using anticipatory stigmergy. Unlike standard stigmergy, in which agents leave pheromones to indicate a trace of previous actions, anticipatory stigmergy deposits pheromones on intended future paths. By sharing their intended future paths with each other at regular intervals, agents can re-plan to attempt to avoid collisions. We experimentally evaluate ASCA over three scenarios, and compare with a state of art approach, Reciprocal Velocity Obstacles (RVO). Our evaluation showed that ASCA is consistently more robust in noisy environments in which transmitted information can be lost or degraded. Further, using ASCA without noise results in fewer collisions than RVO when agents are in formation, but more collisions when formed randomly.","PeriodicalId":123241,"journal":{"name":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Anticipatory stigmergic collision avoidance under noise\",\"authors\":\"Friedrich Burkhard von der Osten, M. Kirley, Tim Miller\",\"doi\":\"10.1145/2576768.2598389\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Reactive path planning to avoid collisions with moving obstacles enables more robust agent systems. However, many solutions assume that moving objects are passive; that is, they do not consider that the moving objects are themselves re-planning to avoid collisions, and thus may change their trajectory. In this paper we present a model, Anticipatory Stigmergic Collision Avoidance (ASCA) for reciprocal collision avoidance using anticipatory stigmergy. Unlike standard stigmergy, in which agents leave pheromones to indicate a trace of previous actions, anticipatory stigmergy deposits pheromones on intended future paths. By sharing their intended future paths with each other at regular intervals, agents can re-plan to attempt to avoid collisions. We experimentally evaluate ASCA over three scenarios, and compare with a state of art approach, Reciprocal Velocity Obstacles (RVO). Our evaluation showed that ASCA is consistently more robust in noisy environments in which transmitted information can be lost or degraded. Further, using ASCA without noise results in fewer collisions than RVO when agents are in formation, but more collisions when formed randomly.\",\"PeriodicalId\":123241,\"journal\":{\"name\":\"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2576768.2598389\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2576768.2598389","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

避免与移动障碍物碰撞的反应性路径规划使智能体系统更加健壮。然而,许多解决方案假设移动对象是被动的;也就是说,他们没有考虑到移动的物体本身是为了避免碰撞而重新规划的,因此可能会改变它们的轨迹。在本文中,我们提出了一个模型,预期耻辱避免碰撞(ASCA)互惠避免碰撞使用预期耻辱。与标准的污名性不同,在标准的污名性中,药物留下信息素来指示先前行为的痕迹,而预期的污名性将信息素沉积在预期的未来路径上。通过定期共享它们预期的未来路径,智能体可以重新规划以避免碰撞。我们在三种情况下对ASCA进行了实验评估,并与最先进的方法反向速度障碍(RVO)进行了比较。我们的评估表明,在传输信息可能丢失或退化的嘈杂环境中,ASCA始终更加稳健。此外,使用无噪声的ASCA比RVO在agent编队时碰撞更少,但在随机编队时碰撞更多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Anticipatory stigmergic collision avoidance under noise
Reactive path planning to avoid collisions with moving obstacles enables more robust agent systems. However, many solutions assume that moving objects are passive; that is, they do not consider that the moving objects are themselves re-planning to avoid collisions, and thus may change their trajectory. In this paper we present a model, Anticipatory Stigmergic Collision Avoidance (ASCA) for reciprocal collision avoidance using anticipatory stigmergy. Unlike standard stigmergy, in which agents leave pheromones to indicate a trace of previous actions, anticipatory stigmergy deposits pheromones on intended future paths. By sharing their intended future paths with each other at regular intervals, agents can re-plan to attempt to avoid collisions. We experimentally evaluate ASCA over three scenarios, and compare with a state of art approach, Reciprocal Velocity Obstacles (RVO). Our evaluation showed that ASCA is consistently more robust in noisy environments in which transmitted information can be lost or degraded. Further, using ASCA without noise results in fewer collisions than RVO when agents are in formation, but more collisions when formed randomly.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Three-cornered coevolution learning classifier systems for classification tasks Runtime analysis to compare best-improvement and first-improvement in memetic algorithms Clonal selection based fuzzy C-means algorithm for clustering SPSO 2011: analysis of stability; local convergence; and rotation sensitivity GPU-accelerated evolutionary design of the complete exchange communication on wormhole networks
×
引用
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