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

凸集图的增强与旅行商问题

Pruning the Augmented Graphs of Convex Sets for Scalable Joint Task and Motion Planning

University of Texas at Dallas(德克萨斯大学达拉斯分校)

Gael Luna, Tyler Summers

AI总结:

本文提出一种基于凸集图的轨迹优化算法,用于求解旅行商问题。通过增强凸集图编码TSP规范,将其转化为最短路径问题,并结合分支限界法获得最优或近似最优解。

摘要:

我们提出了一种用于图中凸集(GCS)的旅行商问题(TSP)的轨迹优化算法。我们的框架使用增强的凸集图来编码TSP规范,并将其精确地作为GCS中的最短路径问题求解。我们建立了地标贝尔曼-海利-卡普算法与带有TSP规范的增强凸集图之间的精确关系。此外,我们提出了一种分支限界启发式方法,利用最小1-树来获得可证明最优或近似最优的解,并能扩展到远大于精确框架能处理的问题规模。为了评估和验证性能,我们探索了多种替代的下界。

英文摘要:

We present top-down and bottom-up approaches for solving large-scale instances of joint task and motion planning problems in Graphs of Convex Sets (GCS). Planning what tasks to perform and how to move between them can be encoded exactly as a Shortest Path Problem (SPP) using an Augmented GCS (AGCS), but this graph grows exponentially with the number of tasks, limiting prior work to only 11 tasks. Both of our approaches significantly improve scalability by carefully pruning the AGCS before it is constructed. The top-down approach replaces the complete graph with a sparse Delaunay graph that maintains a natural nearest-neighbor connectivity, reducing the number of vertices, edges, and subgraphs relative to the full AGCS. The bottom-up approach uses classical Traveling Salesman Problem (TSP) heuristics to create an initial ordering, then expands it within a fixed search window, pruning the AGCS to a bounded maximum width independent of the problem size. Both approaches can obtain optimal or near-optimal solutions in a fraction of the time required by the original AGCS. The bottom-up approach can solve instances with 1000 tasks in about two minutes. We additionally discuss lower bounds based on minimum 1-trees to quantify suboptimality of the proposed approaches.

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

↑