独立ロボット群のための時間順序付きアドホック資源共有
Time-Ordered Ad-hoc Resource Sharing for Independent Robotic Agents
複数ロボットの資源共有を重み付きSAT最適化として定式化し、SATソルバの反復適用で最適割当を解く手法を提案。連続時間の順序制約をCNFで符号化し、実機・シミュレーションで検証した。
著者: Arjo Chakravarty, Michael X. Grey, M. A. Viraj J. Muthugala, Mohan Rajesh Elara
分類: cs.RO, cs.MA
原文アブストラクト
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.
