面向独立机器人智能体的时间有序即时资源共享
Time-Ordered Ad-hoc Resource Sharing for Independent Robotic Agents
AI总结:
针对多机器人系统资源共享问题,提出基于布尔可满足性的方法,含转化算法、定理及CNF时间约束编码,经仿真与真实机器人测试验证有效,且开源基于Open-RMF构建。
摘要:
资源共享是多机器人系统的核心组成部分。我们提出了一种基于布尔可满足性的资源共享方法。核心贡献包括一种将任意约束分配问题转化为基于加权SAT的优化问题的算法,以及一个可通过重复调用SAT求解器求解最优资源分配问题的定理。此外,我们提出了一种使用合取范式(CNF)编码连续时间排序约束的方法。我们对新算法进行了基准测试,证明其可应用于即时场景。我们在模拟和真实机器人车队上测试了算法,结果表明算法能够应对真实场景。我们的算法和测试工具均为开源,基于Open-RMF车队管理系统构建。
英文摘要:
Resource sharing is a crucial part of a multi-robot system. We propose a Boolean satisfiability based approach to resource sharing. Our key contributions are an algorithm for converting any constrained assignment to a weighted-SAT based optimization. We propose a theorem that allows optimal resource assignment problems to be solved via repeated application of a SAT solver. Additionally we show a way to encode continuous time ordering constraints using Conjunctive Normal Form (CNF). We benchmark our new algorithms and show that they can be used in an ad-hoc setting. We test our algorithms on a fleet of simulated and real world robots and show that the algorithms are able to handle real world situations. Our algorithms and test harnesses are opensource and build on Open-RMFs fleet management system.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。