AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Reducing Collision Checking for Sampling-Based Motion Planning Using Graph Neural Networks

Chenning Yu, Sicun Gao

NeurIPS 2021 · Graph learning › Graph algorithms and clustering · approach: Neural combinatorial optimization on graphs · 22 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use GNN edge prioritization over standard heuristic searchSampling-based motion planning · High-dimensional environmentscollision checks: BIT* needs 112%, 175%, 164%, 101%, 557%, 226%, 263% times as many collision checks as our method requiresImproved
Use GNN path exploration and smoothing instead of NEXTSampling-based motion planning · 14D dual KUKA armscollision checks: 17.4%Improved
Add the GNN path smoother and obstacle encodingGNN planner · UR5 to 14D environmentspath costImproved
Increase the number of probing samples (ablation)GNN planner · 2D to 14D problemssuccess rateImproved
Increase the number of probing samples (ablation)GNN planner · 2D to 14D problemspath costNo clear effect
Increase the number of probing samples (ablation)GNN planner · 2D to 14D problemscollision checksHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy