Deep-Steiner:学习解决Euclidean Steiner树问题
Deep-Steiner: Learning to Solve the Euclidean Steiner Tree Problem
摘要:
欧几里德斯坦纳树问题寻求最小成本网络连接的目标位置的集合,它是许多无线网络应用的基础。在本文中,我们提出了一个研究解决欧几里德斯坦纳树问题,使用强化学习增强图表示学习。不同于通常研究的连通性问题,如旅行商问题或车辆路径问题,其中搜索空间是有限的,欧几里德Steiner树问题需要在整个欧几里德空间上搜索,从而使现有的方法不适用。在本文中,我们设计的离散化方法,利用Steiner树的独特特性,并提出了新的训练方案,用于处理动态Steiner点出现在增量建设。我们的设计是通过一个健全的检查,使用一组数据集上的实验进行检查,与令人鼓舞的结果表明,我们的方法作为一种替代经典的组合方法的实用性。
英文摘要:
The Euclidean Steiner tree problem seeks the min-cost network to connect a collection of target locations, and it underlies many applications of wireless networks. In this paper, we present a study on solving the Euclidean Steiner tree problem using reinforcement learning enhanced by graph representation learning. Different from the commonly studied connectivity problems like travelling salesman problem or vehicle routing problem where the search space is finite, the Euclidean Steiner tree problem requires to search over the entire Euclidean space, thereby making the existing methods not applicable. In this paper, we design discretization methods by leveraging the unique characteristics of the Steiner tree, and propose new training schemes for handling the dynamic Steiner points emerging during the incremental construction. Our design is examined through a sanity check using experiments on a collection of datasets, with encouraging results demonstrating the utility of our method as an alternative to classic combinatorial methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。