arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2011.12480cs.ROcs.CCcs.MA
收藏

多机器人非对抗搜索的混合线性规划模型

Mixed-Integer Linear Programming Models for Multi-Robot Non-Adversarial Search

Cornell University(康奈尔大学)

Beatriz A. Asfora, Jacopo Banfi, Mark Campbell

摘要:

在这封信中,我们认为多机器人有效的搜索路径规划(MESPP)问题,其中一组机器人部署在一个图形表示的环境中捕捉移动目标在给定的期限内。我们证明了这个问题是NP难的,并提出了第一套混合线性规划(MILP)模型来解决MESPP问题。我们的模型是第一个同时包含多个搜索者,任意捕获范围和假阴性的模型。虽然最先进的MESPP算法是基于简单的路径枚举,采用MILP作为规划范例允许利用现代求解器的强大技术,产生更好的计算性能,因此,更长的规划视野。这些模型是为离线计算最优解而设计的,但可以很容易地适应分布式在线方法。我们的模拟表明,它是可能的,以实现98%的计算时间减少相对于以前的国家的最先进的。我们还表明,分布式的方法执行几乎以及集中式,在6%的设置研究在这封信中,与需要显着更少的时间的优势-一个重要的考虑因素,在实际的搜索任务。

英文摘要:

In this letter, we consider the Multi-Robot Efficient Search Path Planning (MESPP) problem, where a team of robots is deployed in a graph-represented environment to capture a moving target within a given deadline. We prove this problem to be NP-hard, and present the first set of Mixed-Integer Linear Programming (MILP) models to tackle the MESPP problem. Our models are the first to encompass multiple searchers, arbitrary capture ranges, and false negatives simultaneously. While state-of-the-art algorithms for MESPP are based on simple path enumeration, the adoption of MILP as a planning paradigm allows to leverage the powerful techniques of modern solvers, yielding better computational performance and, as a consequence, longer planning horizons. The models are designed for computing optimal solutions offline, but can be easily adapted for a distributed online approach. Our simulations show that it is possible to achieve 98% decrease in computational time relative to the previous state-of-the-art. We also show that the distributed approach performs nearly as well as the centralized, within 6% in the settings studied in this letter, with the advantage of requiring significant less time - an important consideration in practical search missions.

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

↑