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

基于加权最大化的多目标机器人规划问题标量化方法

Scalarizing Multi-Objective Robot Planning Problems using Weighted Maximization

Delft University of Technology(代尔夫特理工大学);University of Waterloo(滑铁卢大学)

Nils Wilde, Stephen L. Smith, Javier Alonso-Mora

AI总结:

针对多目标机器人规划中加权求和法难以找到全部权衡方案的问题,提出基于加权最大值的标量化方法及对应路径规划算法,可找到更广泛的帕累托最优解。

摘要:

在为自主机器人设计运动规划器时,通常需要考虑多个目标。然而,要得到能在各目标间实现理想权衡的代价函数并非易事。许多应用中的常用方法是对相关目标函数进行加权求和,再仔细调整权重。但即便在简单的规划问题中,该方法也可能无法找到所有相关的权衡方案。为此,我们研究了一种基于目标加权最大值的替代方法。这类代价函数比加权求和更具表达力,我们展示了其在连续空间和离散空间运动规划问题中的应用方式。我们针对该代价函数提出了一种新的路径规划算法,证明了其正确性,并提出了可实现实用运行时间的启发式改进方案。在大量仿真实验中,我们证明所提出的代价函数和算法能够在各类规划问题中找到更广泛的目标间权衡方案(即帕累托最优解),彰显了其实际应用优势。

英文摘要:

When designing a motion planner for autonomous robots there are usually multiple objectives to be considered. However, a cost function that yields the desired trade-off between objectives is not easily obtainable. A common technique across many applications is to use a weighted sum of relevant objective functions and then carefully adapt the weights. However, this approach may not find all relevant trade-offs even in simple planning problems. Thus, we study an alternative method based on a weighted maximum of objectives. Such a cost function is more expressive than the weighted sum, and we show how it can be deployed in both continuous- and discrete-space motion planning problems. We propose a novel path planning algorithm for the proposed cost function and establish its correctness, and present heuristic adaptations that yield a practical runtime. In extensive simulation experiments, we demonstrate that the proposed cost function and algorithm are able to find a wider range of trade-offs between objectives (i.e., Pareto-optimal solutions) for various planning problems, showcasing its advantages in practice.

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

↑