BiC-MPPI: Goal-Pursuing, Sampling-Based Bidirectional Rollout Clustering Path Integral for Trajectory Optimization
<|reference_start|>BiC-MPPI: Goal-Pursuing, Sampling-Based Bidirectional Rollout Clustering Path Integral for Trajectory Optimization: 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<|reference_end|>
@article{jung2024bic-mppi:,
    title={BiC-MPPI: Goal-Pursuing, Sampling-Based Bidirectional Rollout Clustering
  Path Integral for Trajectory Optimization},
    author={Minchan Jung and Kwangki Kim},
    journal={arXiv preprint arXiv:2410.06493},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.06493},
    primaryClass={cs.RO cs.AI cs.SY eess.SY math.OC}
}