大規模近傍探索を用いた重み付き最大化による効率的な多目的計画
Efficient Multi-Objective Planning with Weighted Maximization Using Large Neighbourhood Search
多目的ナビゲーション計画において、重み付き和では見つけられない非凸領域のパレート最適解を発見できる重み付き最大化問題を、大規模近傍探索に基づく新アルゴリズムで高速に解き、既存手法と同等の解品質を1〜2桁高速に達成した。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Krishna Kalavadia, Shamak Dutta, Yash Vardhan Pant, Stephen L. Smith
分類: cs.RO
原文アブストラクト
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.
