基于时间的多Agent搜索与行动决策
Multi-agent Time-based Decision-making for the Search and Action Problem
摘要:
许多机器人应用,如搜索和救援,需要多个代理搜索和执行目标上的行动。然而,这样的任务提出了一些挑战,包括合作探索,任务选择和分配,时间限制,和计算复杂性。为了解决这个问题,我们提出了一个分散的多智能体决策框架的搜索和行动问题的时间约束。其主要思想是将时间视为一个分配的预算,每个代理人的行动都会产生时间成本并产生一定的奖励。我们的方法利用概率推理来做出接近最优的决策,从而获得最大化的回报。我们评估我们的方法在穆罕默德·本·扎耶德国际机器人挑战赛(MBZIRC)的搜索,挑选和放置场景,通过使用概率密度图和奖励预测函数来评估行动。广泛的模拟表明,我们的算法优于基准策略,我们展示了系统集成在一个基于Gazebo的环境中,验证框架的准备现场应用。
英文摘要:
Many robotic applications, such as search-and-rescue, require multiple agents to search for and perform actions on targets. However, such missions present several challenges, including cooperative exploration, task selection and allocation, time limitations, and computational complexity. To address this, we propose a decentralized multi-agent decision-making framework for the search and action problem with time constraints. The main idea is to treat time as an allocated budget in a setting where each agent action incurs a time cost and yields a certain reward. Our approach leverages probabilistic reasoning to make near-optimal decisions leading to maximized reward. We evaluate our method in the search, pick, and place scenario of the Mohamed Bin Zayed International Robotics Challenge (MBZIRC), by using a probability density map and reward prediction function to assess actions. Extensive simulations show that our algorithm outperforms benchmark strategies, and we demonstrate system integration in a Gazebo-based environment, validating the framework's readiness for field application.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。