BaB-ND: Long-Horizon Motion Planning with Branch-and-Bound and Neural Dynamics
Keyi Shen, Jiangwei Yu, Jose Barreiros, Huan Zhang, Yunzhu Li

TL;DR
This paper introduces BaB-ND, a GPU-accelerated branch-and-bound framework for long-horizon motion planning using neural dynamics models, effectively handling complex contact-rich manipulation tasks.
Contribution
It presents a novel branch-and-bound approach with specialized heuristics and bound propagation for neural dynamics, improving planning efficiency and quality in manipulation tasks.
Findings
Outperforms existing methods in contact-rich manipulation tasks
Generates high-quality trajectories in simulated and real-world settings
Supports various neural network architectures and scales efficiently
Abstract
Neural-network-based dynamics models learned from observational data have shown strong predictive capabilities for scene dynamics in robotic manipulation tasks. However, their inherent non-linearity presents significant challenges for effective planning. Current planning methods, often dependent on extensive sampling or local gradient descent, struggle with long-horizon motion planning tasks involving complex contact events. In this paper, we present a GPU-accelerated branch-and-bound (BaB) framework for motion planning in manipulation tasks that require trajectory optimization over neural dynamics models. Our approach employs a specialized branching heuristics to divide the search space into subdomains, and applies a modified bound propagation method, inspired by the state-of-the-art neural network verifier alpha-beta-CROWN, to efficiently estimate objective bounds within these…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsReservoir Engineering and Simulation Methods · Reinforcement Learning in Robotics · Robotic Path Planning Algorithms
