Skip to content
Preprint

MPPI Planning with Gaussian-Based Human Cost Function for Social Navigation

Aug 2026 · 0 citations · 20 references
Computer Science Engineering

TL;DR

Predictive Gaussian Interaction Fields (PGIF), a spatiotemporal cost formulation that propagates pedestrian predictions forward over the full planning horizon and encodes them as anisotropic Gaussian repulsive fields aligned with each pedestrian's direction of motion, is proposed.

Abstract

Safe robot navigation in crowded spaces requires planning that accounts for where people will be, not only where they are now. Model Predictive Path Integral (MPPI) control is an effective sampling-based planner, but many implementations encode humans as static point obstacles at their current positions, underestimating risk in dynamic scenes. We propose Predictive Gaussian Interaction Fields (PGIF), a spatiotemporal cost formulation that propagates pedestrian predictions forward over the full planning horizon and encodes them as anisotropic Gaussian repulsive fields aligned with each pedestrian's direction of motion. The forward spread of each field grows with the pedestrian's speed, creating a motion cone danger zone that penalises robot trajectories entering the pedestrian's path of travel more strongly than those approaching from behind. The formulation is closed-form and fully parallelisable across rollouts, adding no measurable computational overhead. Evaluated over 300 randomised crowd scenarios at three density levels, PGIF-MPPI achieves a 0% collision rate at every density level, compared with up to 82% for vanilla MPPI, while maintaining real-time planning performance.

View source

Similar papers

Preprint Open access Sep 2026

Path Planning with Motion Primitives in Dynamic Environments: SIPP on Lattices

Autonomous navigation in dynamic environments is a critical challenge, particularly when spaces are shared with other mobile agents whose future trajectories are known. While traditional grid-based planners efficiently find collision-free paths, their reliance on stop-and-turn mechanics over $2^k$-connected grids produ...

Marat Agranovskiy · 1 citation
Oct 2026

Safe Navigation With Occluded Pedestrians: An Analytical Active Inference Approach

Autonomous vehicles in urban environments must account for pedestrians potentially hidden behind static obstacles, where existence, position, and behavioral intent are all uncertain. We propose a fully analytical Active Inference framework that replaces particle-filter-based inference with a parametric Bernoulli-Gaussi...

Kai Chen, Yu-Yao Huang, Alois C. Knoll et al. · 0 citations
Preprint Oct 2026

Controllable Crowd Generation through World-Model Planning

Crowd simulation plays a central role in robot navigation, autonomous driving, and urban planning. For these applications, realistic simulation requires crowds to adapt their behavior to environmental changes and user objectives. However, existing methods that rely on predefined control settings have limited flexibilit...

Jungyu Lee, Ji Shin, Seunghyun Shin et al. · 0 citations
#machine learning Preprint Oct 2026

Training-Free Diffusion Planning with Analytical Local Scores

Path finding and multi-robot motion planning require trajectories that are smooth, goal-directed, and collision-free in environments with complex geometric constraints. Recent diffusion-based planners have shown that trajectory generation can be cast as iterative denoising which has opened the doors to learning-based a...

Michael Y. Fatemi, Jin-Hao Liang, Ferdinando Fioretto · 0 citations
Open access 2026

Learning Convex Probabilistic Obstacle Spaces for Efficient Uncertainty-Aware Path Planning

Identifying the obstacle space is crucial for path planning. However, generating an accurate obstacle space remains a significant challenge due to various sources of uncertainty, including motion, behavior, and perception limitations. Even though an autonomous system can operate with an inaccurate obstacle space by bei...

Jun Xiang, Jun Chen · 0 citations
Preprint Aug 2026

Diffusion Policies for Short-Horizon Planning in Robot Crowd Navigation

Planning Diffusion Policy Optimization is proposed, an offline-to-online reinforcement-learning framework that uses a diffusion policy to generate short-horizon action chunks for crowd navigation and obtains an improved success rate over strong baselines and ablations demonstrate that action chunks are especially impor...

Wen-Dong Li, J. Garcke · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.