基于搜索的令牌交换最优解及其约简为SAT
Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT
摘要:
在这篇简短的论文中,我们研究了解决令牌交换(TSWAP)问题的实用方法。在TSWAP中,我们给出了一个具有着色顶点的无向图。在每个顶点中放置一个彩色标记。一对标记可以在相邻顶点之间交换。我们的目标是执行一系列交换,以便令牌和顶点颜色在整个图中保持一致。在问题的优化变体中需要最小数量的交换。我们观察到TSWAP问题和多智能体路径查找(MAPF)之间的相似性,而不是令牌,我们有多个代理,需要从当前顶点移动到给定的唯一目标顶点。这两个问题之间的区别在于状态转换(交换/移动)必须满足的局部条件。通过对MAPF-CBS和MDD-SAT两种不同的方法进行改进,我们提出了两种求解TSWAP最优解的算法.这是首次尝试设计TSWAP的最优求解算法。对各种类型图的实验评价表明,在最优TSWAP求解中,SAT尺度的约简优于CBS。
英文摘要:
We study practical approaches to solving the token swapping (TSWAP) problem optimally in this short paper. In TSWAP, we are given an undirected graph with colored vertices. A colored token is placed in each vertex. A pair of tokens can be swapped between adjacent vertices. The goal is to perform a sequence of swaps so that token and vertex colors agree across the graph. The minimum number of swaps is required in the optimization variant of the problem. We observed similarities between the TSWAP problem and multi-agent path finding (MAPF) where instead of tokens we have multiple agents that need to be moved from their current vertices to given unique target vertices. The difference between both problems consists in local conditions that state transitions (swaps/moves) must satisfy. We developed two algorithms for solving TSWAP optimally by adapting two different approaches to MAPF - CBS and MDD- SAT. This constitutes the first attempt to design optimal solving algorithms for TSWAP. Experimental evaluation on various types of graphs shows that the reduction to SAT scales better than CBS in optimal TSWAP solving.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。