漸近パレート最適性を備えた多目的キノダイナミック動作計画
Multi-Objective Kinodynamic Motion Planning with Asymptotic Pareto Optimality
キノダイナミック制約下の多目的動作計画問題に対し、SSTアルゴリズムを拡張し、局所パレート最適ノードの代表集合を保持する統一フレームワークを提案。辞書式最適化、制約付き最適化、パレートフロント近似の3つのアルゴリズムを提供し、完全性と最適性を理論保証する。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Yusif Razzaq, Anne Theurkauf, Nisar Ahmed, Morteza Lahijanian
分類: cs.RO
原文アブストラクト
In this paper, we address the challenge of multi-objective motion planning for systems under kinodynamic constraints. We consider three problem classes: (i) lexicographic optimization, in which objectives are minimized according to a strict priority ordering, (ii) constrained optimization, in which a primary objective is minimized subject to bounds on the remaining costs, and (iii) Pareto front optimization, in which the goal is to approximate the full set of optimal trade-offs among competing objectives. We first show that established cost scalarization methods for multi-objective problems cannot be extended to continuous-domain systems with correctness guarantees. Then, we propose a unified algorithmic framework built upon the Stable Sparse-RRT (SST) algorithm, in which the single representative maintained at each witness neighborhood is replaced by a representative set of locally Pareto-optimal nodes. This structure gives rise to three distinct algorithms: lexSST for lexicographic minimization, coSST for constrained optimization, and poSST for Pareto-front approximation. We provide theoretical guarantees for the completeness and optimality of our algorithms and demonstrate their effectiveness through extensive empirical evaluations.
