BiC-MPPI: 双方向ロールアウトクラスタリングによるサンプリングベース経路積分を用いた目標追従型軌道最適化
BiC-MPPI: Goal-Pursuing, Sampling-Based Bidirectional Rollout Clustering Path Integral for Trajectory Optimization
MPPIフレームワークに双方向のダイナミクス近似とガイドコストを導入し、目標到達性能を高める軌道最適化手法を提案。2D/3D環境の900シミュレーションで既存手法より高い成功率を示した。
著者: Minchan Jung, Kwangki Kim
分類: cs.RO, cs.AI, cs.SY, eess.SY, math.OC
原文アブストラクト
This paper introduces the Bidirectional Clustered MPPI (BiC-MPPI) algorithm, a novel trajectory optimization method aimed at enhancing goal-directed guidance within the Model Predictive Path Integral (MPPI) framework. BiC-MPPI incorporates bidirectional dynamics approximations and a new guide cost mechanism, improving both trajectory planning and goal-reaching performance. By leveraging forward and backward rollouts, the bidirectional approach ensures effective trajectory connections between initial and terminal states, while the guide cost helps discover dynamically feasible paths. Experimental results demonstrate that BiC-MPPI outperforms existing MPPI variants in both 2D and 3D environments, achieving higher success rates and competitive computation times across 900 simulations on a modified BARN dataset for autonomous navigation. GitHub: https://github.com/i-ASL/BiC-MPPI
