基于非知情和知情搜索算法的混合扫描代理的导航模式

Hasibe Çoruh, İremnur Çivioğlu, Cevda Nur Öztürk
{"title":"基于非知情和知情搜索算法的混合扫描代理的导航模式","authors":"Hasibe Çoruh, İremnur Çivioğlu, Cevda Nur Öztürk","doi":"10.1109/UBMK52708.2021.9558897","DOIUrl":null,"url":null,"abstract":"Hybrid agent architectures enable effective control layering the agent functions according to the sophistication they require. In this study, assuming a partially observable and deterministic environment, reactive and deliberative behaviors of a hybrid scanning agent were controlled using some uninformed and informed search algorithms, respectively. As the reactive layer decided the agent actions online in an unknown environment, a map of the environment was constructed in parallel. When the reactive layer failed to find a proper action, the deliberative layer proposed a solution offline using the constructed map so that the agent could continue its scanning task. The navigation patterns that were produced with the adapted algorithms in the reactive and deliberative layers were analyzed. The results showed that depth-first search (DFS) and breadth-first search (BFS) algorithms can be used as reactive motion planners for scanning an environment in zigzag and spiral patterns. Simulations in 25 grid-based environments with different sizes and varying percentages of obstacles yielded that running A* algorithm as a deliberative planner, the agent could completely scan the environments with equal successes for all different modes of the developed scanning algorithms. The horizontal mode of the DFS-based scanning algorithm had the least rescan rate on average.","PeriodicalId":106516,"journal":{"name":"2021 6th International Conference on Computer Science and Engineering (UBMK)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Navigation Patterns of a Hybrid Scanning Agent using Uninformed and Informed Search Algorithms for Reactive and Deliberative Behaviors\",\"authors\":\"Hasibe Çoruh, İremnur Çivioğlu, Cevda Nur Öztürk\",\"doi\":\"10.1109/UBMK52708.2021.9558897\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hybrid agent architectures enable effective control layering the agent functions according to the sophistication they require. In this study, assuming a partially observable and deterministic environment, reactive and deliberative behaviors of a hybrid scanning agent were controlled using some uninformed and informed search algorithms, respectively. As the reactive layer decided the agent actions online in an unknown environment, a map of the environment was constructed in parallel. When the reactive layer failed to find a proper action, the deliberative layer proposed a solution offline using the constructed map so that the agent could continue its scanning task. The navigation patterns that were produced with the adapted algorithms in the reactive and deliberative layers were analyzed. The results showed that depth-first search (DFS) and breadth-first search (BFS) algorithms can be used as reactive motion planners for scanning an environment in zigzag and spiral patterns. Simulations in 25 grid-based environments with different sizes and varying percentages of obstacles yielded that running A* algorithm as a deliberative planner, the agent could completely scan the environments with equal successes for all different modes of the developed scanning algorithms. The horizontal mode of the DFS-based scanning algorithm had the least rescan rate on average.\",\"PeriodicalId\":106516,\"journal\":{\"name\":\"2021 6th International Conference on Computer Science and Engineering (UBMK)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 6th International Conference on Computer Science and Engineering (UBMK)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/UBMK52708.2021.9558897\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 6th International Conference on Computer Science and Engineering (UBMK)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UBMK52708.2021.9558897","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

混合代理体系结构能够根据其所需的复杂程度对代理功能进行有效的控制分层。在本研究中,假设一个部分可观察和确定性的环境,混合扫描代理的反应性和慎重性行为分别使用一些不知情和知情搜索算法进行控制。由于反应层决定了智能体在未知环境中的在线行为,因此并行构建了环境映射。当反应层找不到合适的动作时,审议层使用构造好的地图离线提出解决方案,使agent能够继续其扫描任务。分析了在反应层和审议层采用自适应算法生成的导航模式。结果表明,深度优先搜索(DFS)和宽度优先搜索(BFS)算法可以作为反应运动规划器,用于扫描锯齿形和螺旋形的环境。在25个基于网格的不同大小和不同障碍物百分比的环境中进行仿真,结果表明,将A*算法作为一个慎重的计划者来运行,对于所开发的所有不同模式的扫描算法,智能体都可以完全扫描环境,并取得相同的成功。基于dfs的水平模式扫描算法的平均重扫描率最低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Navigation Patterns of a Hybrid Scanning Agent using Uninformed and Informed Search Algorithms for Reactive and Deliberative Behaviors
Hybrid agent architectures enable effective control layering the agent functions according to the sophistication they require. In this study, assuming a partially observable and deterministic environment, reactive and deliberative behaviors of a hybrid scanning agent were controlled using some uninformed and informed search algorithms, respectively. As the reactive layer decided the agent actions online in an unknown environment, a map of the environment was constructed in parallel. When the reactive layer failed to find a proper action, the deliberative layer proposed a solution offline using the constructed map so that the agent could continue its scanning task. The navigation patterns that were produced with the adapted algorithms in the reactive and deliberative layers were analyzed. The results showed that depth-first search (DFS) and breadth-first search (BFS) algorithms can be used as reactive motion planners for scanning an environment in zigzag and spiral patterns. Simulations in 25 grid-based environments with different sizes and varying percentages of obstacles yielded that running A* algorithm as a deliberative planner, the agent could completely scan the environments with equal successes for all different modes of the developed scanning algorithms. The horizontal mode of the DFS-based scanning algorithm had the least rescan rate on average.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信