](https://deep-paper.org/en/paper/2509.00499/images/cover.png)
Solving the Tunneling Problem: How NeuralSVCD Makes Robot Motion Planning Safer and Faster
Introduction Imagine a robotic arm moving rapidly in a crowded factory floor. It needs to pick up a part from a bin and place it on a conveyor belt without hitting the bin walls, the conveyor, or itself. To plan this motion, the robot relies on a collision checker. Traditionally, motion planners work by sampling the robot’s trajectory at discrete points in time—like a flipbook. They check: “Is the robot hitting anything at time \(t=0\)? How about \(t=1\)?” If both are clear, the planner assumes the path is safe. But what happens at \(t=0.5\)? ...
](https://deep-paper.org/en/paper/2509.00215/images/cover.png)
](https://deep-paper.org/en/paper/2508.21007/images/cover.png)
](https://deep-paper.org/en/paper/2505.04317/images/cover.png)
](https://deep-paper.org/en/paper/2504.17838/images/cover.png)
](https://deep-paper.org/en/paper/2505.03725/images/cover.png)
](https://deep-paper.org/en/paper/2402.11871/images/cover.png)
](https://deep-paper.org/en/paper/2506.12678/images/cover.png)
](https://deep-paper.org/en/paper/2506.15666/images/cover.png)
](https://deep-paper.org/en/paper/2410.12124/images/cover.png)
](https://deep-paper.org/en/paper/2509.12741/images/cover.png)
](https://deep-paper.org/en/paper/2508.19391/images/cover.png)
](https://deep-paper.org/en/paper/203_fomo_3d_using_vision_found-2445/images/cover.png)
](https://deep-paper.org/en/paper/2509.01297/images/cover.png)
](https://deep-paper.org/en/paper/2509.01746/images/cover.png)
](https://deep-paper.org/en/paper/2510.09817/images/cover.png)
](https://deep-paper.org/en/paper/2509.01657/images/cover.png)
](https://deep-paper.org/en/paper/439_pi_0_5_a_vision_language_a-2440/images/cover.png)
](https://deep-paper.org/en/paper/2509.12379/images/cover.png)
](https://deep-paper.org/en/paper/2508.12166/images/cover.png)