Hierarchical Learning-Enhanced MPC for Safe Crowd Navigation with Heterogeneous Constraints

In this paper, we propose a novel hierarchical framework for robot navigation in dynamic environments with heterogeneous constraints. Our approach leverages a graph neural network trained via reinforcement learning (RL) to efficiently estimate the robot's cost-to-go, formulated as local goal recommendations. A spatio-temporal path-searching module, which accounts for kinematic constraints, is then employed to generate a reference trajectory to facilitate solving the non-convex optimization problem used for explicit constraint enforcement. More importantly, we introduce an incremental action-masking mechanism and a privileged learning strategy, enabling end-to-end training of the proposed planner. Both simulation and real-world experiments demonstrate that the proposed method effectively addresses local planning in complex dynamic environments, achieving state-of-the-art (SOTA) performance. Compared with existing learning-optimization hybrid methods, our approach eliminates the dependency on high-fidelity simulation environments, offering significant advantages in computational efficiency and training scalability. The code will be released as open-source upon acceptance of the paper.

@article{liu2025_2506.09859,
  title={ Hierarchical Learning-Enhanced MPC for Safe Crowd Navigation with Heterogeneous Constraints },
  author={ Huajian Liu and Yixuan Feng and Wei Dong and Kunpeng Fan and Chao Wang and Yongzhuo Gao },
  journal={arXiv preprint arXiv:2506.09859},
  year={ 2025 }
}