arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.01489cs.ROcs.MA
收藏

随机行程时间下多智能体路径搜索的在线重规划和自适应参数更新

Online Re-Planning and Adaptive Parameter Update for Multi-Agent Path Finding with Stochastic Travel Times

Panasonic Holdings Corporation(松下控股株式会社);Ritsumeikan University(立命馆大学)

Atsuyoshi Kita, Nobuhiro Suenari, Masashi Okada, Tadahiro Taniguchi

摘要:

本研究探讨多智能体路径搜寻问题,行程时间为连续且随机,且其机率分布未知。我们的目的是管理一组自动化机器人,在行人和各种机器人共存的建筑物中提供包裹递送服务,例如办公楼,医院和公寓的递送服务。在这些现实世界的应用中,机器人穿越走廊所需的时间通常是连续的,并且是随机分布的,并且旅行时间的概率分布的先验知识是有限的。多智能体路径搜索已被广泛研究和应用于机器人管理系统,然而,在这样的环境中,机器人操作自动化仍然是困难的。我们建议1)在线重新规划更新的机器人的行动计划,而它的执行,和2)参数更新估计的概率分布的行程时间使用贝叶斯推理的延迟观察。我们使用一个贪婪的启发式,以获得在有限的计算时间的解决方案。通过模拟,我们经验比较我们的方法的性能,现有的方法在冲突概率和机器人的实际行程时间。仿真结果表明,所提出的方法可以找到至少50%的旅行路径,减少冲突和更短的实际总行程时间比现有的方法。所提出的方法需要少量的试验,以实现性能,因为参数更新的优先级上的重要边缘的路径规划,从而满足快速实施的鲁棒规划的自动化交付服务的要求。

英文摘要:

This study explores the problem of Multi-Agent Path Finding with continuous and stochastic travel times whose probability distribution is unknown. Our purpose is to manage a group of automated robots that provide package delivery services in a building where pedestrians and a wide variety of robots coexist, such as delivery services in office buildings, hospitals, and apartments. It is often the case with these real-world applications that the time required for the robots to traverse a corridor takes a continuous value and is randomly distributed, and the prior knowledge of the probability distribution of the travel time is limited. Multi-Agent Path Finding has been widely studied and applied to robot management systems; however, automating the robot operation in such environments remains difficult. We propose 1) online re-planning to update the action plan of robots while it is executed, and 2) parameter update to estimate the probability distribution of travel time using Bayesian inference as the delay is observed. We use a greedy heuristic to obtain solutions in a limited computation time. Through simulations, we empirically compare the performance of our method to those of existing methods in terms of the conflict probability and the actual travel time of robots. The simulation results indicate that the proposed method can find travel paths with at least 50% fewer conflicts and a shorter actual total travel time than existing methods. The proposed method requires a small number of trials to achieve the performance because the parameter update is prioritized on the important edges for path planning, thereby satisfying the requirements of quick implementation of robust planning of automated delivery services.

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

↑