Multimodal Fused Learning for Solving the Generalized Traveling Salesman Problem in Robotic Task Planning
Not on the map. Why?
Abstract (arXiv)
Effective and efficient task planning is essential for mobile robots, especially in applications like warehouse retrieval and environmental monitoring. These tasks often involve selecting one location from each of several target clusters, forming a Generalized Traveling Salesman Problem (GTSP) that remains challenging to solve both accurately and efficiently. To address this, we propose a Multimodal Fused Learning (MMFL) framework that leverages both graph and image-based representations to capture complementary aspects of the problem, and learns a policy capable of generating high-quality task planning schemes in real time. Specifically, we first introduce a coordinate-based image builder that transforms GTSP instances into spatially informative representations. We then design an adaptive resolution scaling strategy to enhance adaptability across different problem scales, and develop a multimodal fusion module with dedicated bottlenecks that enables effective integration of geometric and spatial features. Extensive experiments show that our MMFL approach significantly outperforms state-of-the-art methods across various GTSP instances while maintaining the computational efficiency required for real-time robotic applications. Physical robot tests further validate its practical effectiveness in real-world scenarios.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 9 of its 34 references that are in the map. First posted on arXiv 20 Jun 2025.
Builds on
9 of 34 references.
References · 9
- 2018Attention, Learn to Solve Routing Problems!cited by 656
- 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 348
- 2019An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problemcited by 269
- 2020Solving Mixed Integer Programs Using Neural Networkscited by 182
- 2019Learning Improvement Heuristics for Solving Routing Problemscited by 164
- 2021Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformercited by 108
- 2020Sample Efficient Reinforcement Learning with REINFORCEcited by 86
- 2023DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimizationcited by 78
- 2025Learning and planning for optimal synergistic human-robot coordination in manufacturing contextscited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Learning to Solve Compositional Geometry Routing Problems18 May 2026