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

基于大邻域搜索的加权最大化多目标规划高效方法

Efficient Multi-Objective Planning with Weighted Maximization Using Large Neighbourhood Search

University of Waterloo(滑铁卢大学)

Krishna Kalavadia, Shamak Dutta, Yash Vardhan Pant, Stephen L. Smith

AI总结:

本文提出基于大邻域搜索的新型算法,高效解决加权最大化规划问题,在保持解质量的同时将运行时间提升1-2个数量级,适用于自主导航中的多目标优化。

摘要:

自主导航往往需要同时优化多个目标。最常用的方法是将这些目标标量化为单一成本函数,通过加权和,但此方法无法找到所有可能的权衡方案,因此可能遗漏关键解。另一种方法,即目标的加权最大值,可以找到所有帕累托最优解,包括加权和方法无法找到的非凸区域中的解。然而,在离散域中寻找加权最大值解的计算复杂性增加,限制了其实际应用。为了解决这一挑战,我们提出了一种基于大邻域搜索框架的新搜索算法,高效解决加权最大规划问题。通过广泛模拟,我们证明我们的算法在解质量上与现有加权最大规划器相当,运行时间提升1-2个数量级,使其成为自主导航中的可行选项。

英文摘要:

Autonomous navigation often requires the simultaneous optimization of multiple objectives. The most common approach scalarizes these into a single cost function using a weighted sum, but this method is unable to find all possible trade-offs and can therefore miss critical solutions. An alternative, the weighted maximum of objectives, can find all Pareto-optimal solutions, including those in non-convex regions of the trade-off space that weighted sum methods cannot find. However, the increased computational complexity of finding weighted maximum solutions in the discrete domain has limited its practical use. To address this challenge, we propose a novel search algorithm based on the Large Neighbourhood Search framework that efficiently solves the weighted maximum planning problem. Through extensive simulations, we demonstrate that our algorithm achieves comparable solution quality to existing weighted maximum planners with a runtime improvement of 1-2 orders of magnitude, making it a viable option for autonomous navigation.

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

↑