Situated Grid Pathfinding Among Moving Obstacles (Extended Abstract)

Devin Thomas, Tianyi Gu, Wheeler Ruml, S. E. Shimony
{"title":"Situated Grid Pathfinding Among Moving Obstacles (Extended Abstract)","authors":"Devin Thomas, Tianyi Gu, Wheeler Ruml, S. E. Shimony","doi":"10.1609/socs.v15i1.21800","DOIUrl":null,"url":null,"abstract":"There has been much recent work on finding paths in grid maps among moving obstacles.\nHowever, in addition to assuming complete omniscience regarding the map and the obstacles' trajectories, previous work has also assumed that time stands still while the agent plans. In this paper, we address situated pathfinding, in which time passes and the obstacles continue to move while the agent plans. We study the choice of state space representation and search algorithm, with a focus on whether conclusions drawn from studies in the off-line case continue to hold in a situated setting.","PeriodicalId":425645,"journal":{"name":"Symposium on Combinatorial Search","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Combinatorial Search","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1609/socs.v15i1.21800","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

There has been much recent work on finding paths in grid maps among moving obstacles. However, in addition to assuming complete omniscience regarding the map and the obstacles' trajectories, previous work has also assumed that time stands still while the agent plans. In this paper, we address situated pathfinding, in which time passes and the obstacles continue to move while the agent plans. We study the choice of state space representation and search algorithm, with a focus on whether conclusions drawn from studies in the off-line case continue to hold in a situated setting.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
移动障碍物中的定位网格寻路(扩展摘要)
最近有很多关于在移动障碍物之间的网格地图中寻找路径的工作。然而,除了假设智能体对地图和障碍物的轨迹完全无所不知之外,之前的工作还假设智能体在计划时时间是静止的。在本文中,我们解决了定位寻路,其中时间流逝,障碍物继续移动,而智能体计划。我们研究了状态空间表示和搜索算法的选择,重点关注离线情况下的研究结论是否继续适用于情境设置。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A-A*pex: Efficient Anytime Approximate Multi-Objective Search Tunable Suboptimal Heuristic Search Hitting Set Heuristics for Overlapping Landmarks in Satisficing Planning Fools Rush in Where Angels Fear to Tread in Multi-Goal CBS Evaluating Distributional Predictions of Search Time: Put Up or Shut Up Games (Extended Abstract)
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1