arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.08299cs.AIcs.LOcs.MAcs.RO
收藏

多智能体路径寻找问题的灵活和可解释的解决方案

Flexible and Explainable Solutions for Multi-Agent Path Finding Problems

Faculty of Engineering and Natural Sciences, Sabanci University(萨班哲大学工程与自然科学学院);Sabanci University(萨班哲大学);Istanbul(伊斯坦布尔)

Aysu Bogatarkan

摘要:

多智能体路径寻找(MAPF)问题是一个组合搜索问题,其目的是为多个智能体(例如,机器人)在环境中(例如,自治仓库),使得没有两个代理彼此冲突,并且受到路径长度的一些约束。MAPF的实际应用需要灵活性(例如,解决MAPF的变化)以及可解释性。在这项研究中,这两个挑战都得到了解决,并介绍了MAPF及其变体的一些灵活和可解释的解决方案。

英文摘要:

The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous warehouse) such that no two agents collide with each other, and subject to some constraints on the lengths of paths. The real-world applications of MAPF require flexibility (e.g., solving variations of MAPF) as well as explainability. In this study, both of these challenges are addressed and some flexible and explainable solutions for MAPF and its variants are introduced.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑