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

多机器人对静止目标的搜索

On multi-robot search for a stationary object

Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague(捷克布拉格理工大学捷克信息学、机器人学与控制论研究所);Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires(布宜诺斯艾利斯大学精确科学与自然科学学院计算机系)

Miroslav Kulich, Libor Přeučil, Juan José Miranda Bront

摘要:

本文研究了两种不同的多机器人在图表示的先验已知环境中搜索静止目标的问题。第一个是旅行送货员问题的推广,其中允许在一个解决方案中使用多个送货员。类似地,第二个变体是图搜索问题的推广。提出了一种适用于这两个问题的新算法,并进一步将其集成到一个簇优先路由第二的方法。对TSPLIB库中的基准实例进行了一系列计算实验。所获得的结果表明,即使是一个独立的算法,在结果质量和计算时间上也明显优于基于k-均值聚类的标准解。集成的方法进一步提高了解决方案,由一个独立的并行计算高达15%的代价较高的计算复杂性。

英文摘要:

Two variants of multi-robot search for a stationary object in a priori known environment represented by a graph are studied in the paper. The first one is a generalization of the Traveling Deliveryman Problem where more than one deliveryman is allowed to be used in a solution. Similarly, the second variant is a generalization of the Graph Search Problem. A novel heuristics suitable for both problems is proposed which is furthermore integrated into a cluster-first route second approach. A set of computational experiments was conducted over the benchmark instances derived from the TSPLIB library. The results obtained show that even a standalone heuristics significantly outperforms the standard solution based on k- means clustering in quality of results as well as computational time. The integrated approach furthermore improves solutions found by a standalone heuristics by up to 15% at the expense of higher computational complexity.

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

↑