DAN:基于分散注意力的神经网络求解MinMax多旅行商问题
DAN: Decentralized Attention-based Neural Network for the MinMax Multiple Traveling Salesman Problem
摘要:
多旅行商问题(mTSP)是一个著名的NP-难问题,有许多现实世界的应用。特别是,这项工作解决最小最大mTSP,其目标是最大限度地减少所有代理之间的最大游览长度。许多机器人部署需要频繁重新计算潜在的大型mTSP实例,这使得计算时间和解决方案质量之间的自然权衡变得非常重要。然而,精确算法和启发式算法由于其计算复杂性而随着城市数量的增加而变得低效。受深度强化学习(dRL)最新发展的鼓舞,这项工作将mTSP作为一项合作任务,并引入了DAN,这是一种基于分散注意力的神经方法,旨在解决这一关键权衡。在DAN中,智能体通过预测彼此未来的决策,学习完全分散的策略来协作构建一个旅游。我们的模型依赖于Transformer架构,并使用具有参数共享的多代理RL进行训练,为代理和城市的数量提供自然的可扩展性。我们的小到大规模的mTSP实例($50$到$1000$城市和$5$到$20$代理)的实验结果表明,DAN能够匹配或优于最先进的求解器,同时保持规划时间低。特别是,在相同的计算时间预算下,DAN在大规模实例(超过100个城市,超过5个代理)上的性能优于所有传统和基于dRL的基线,并表现出增强的代理协作。\url{https://youtu.be/xi3cLsDsLvs}上有一段解释我们方法和展示我们结果的视频。
英文摘要:
The multiple traveling salesman problem (mTSP) is a well-known NP-hard problem with numerous real-world applications. In particular, this work addresses MinMax mTSP, where the objective is to minimize the max tour length among all agents. Many robotic deployments require recomputing potentially large mTSP instances frequently, making the natural trade-off between computing time and solution quality of great importance. However, exact and heuristic algorithms become inefficient as the number of cities increases, due to their computational complexity. Encouraged by the recent developments in deep reinforcement learning (dRL), this work approaches the mTSP as a cooperative task and introduces DAN, a decentralized attention-based neural method that aims at tackling this key trade-off. In DAN, agents learn fully decentralized policies to collaboratively construct a tour, by predicting each other's future decisions. Our model relies on the Transformer architecture and is trained using multi-agent RL with parameter sharing, providing natural scalability to the numbers of agents and cities. Our experimental results on small- to large-scale mTSP instances ($50$ to $1000$ cities and $5$ to $20$ agents) show that DAN is able to match or outperform state-of-the-art solvers while keeping planning times low. In particular, given the same computation time budget, DAN outperforms all conventional and dRL-based baselines on larger-scale instances (more than 100 cities, more than 5 agents), and exhibits enhanced agent collaboration. A video explaining our approach and presenting our results is available at \url{https://youtu.be/xi3cLsDsLvs}.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。