Motion and path planning are fundamental to intelligent robotic systems, enabling navigation. The objective is to generate collision-free trajectories in obstacle-rich configuration spaces (C-spaces) while meeting performance constraints. In environments with narrow passages planning becomes especially difficult, as feasible regions have low measure and are rarely reached by random sampling. Classical sampling-based planners are probabilistically complete but inefficient in such regions. Learning-based planners like MPNet offer fast inference but often produce infeasible paths in cluttered areas, requiring expensive postprocessing. To address this trade-off, we propose a hybrid framework that combines improved sampling, structural abstraction, and neural prediction. A modified bridge-test sampler applies directional perturbations and corridor checks to generate reliable narrow passage samples. These are clustered into a sparse set of representative bridge points, which serve as nodes in a global graph. At query time, a greedy heuristic search explores this graph, using a neural local segment generator to connect nodes. We validate the approach on 2D maze maps, 3D voxel environments, and a 12-DOF manipulator performing a plugging task inside a simulated nuclear steam generator. Across all tasks, our method significantly outperforms classical and learning-based baselines in terms of success rate and planning time in narrow-passage-dominated scenarios. The inclusion of the repair module, under relaxed assumptions, also allows the framework to retain a generalized form of probabilistic completeness.
DIAN et al. (Tue,) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: