Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

Motion Planning Networks

About

Fast and efficient motion planning algorithms are crucial for many state-of-the-art robotics applications such as self-driving cars. Existing motion planning methods become ineffective as their computational complexity increases exponentially with the dimensionality of the motion planning problem. To address this issue, we present Motion Planning Networks (MPNet), a neural network-based novel planning algorithm. The proposed method encodes the given workspaces directly from a point cloud measurement and generates the end-to-end collision-free paths for the given start and goal configurations. We evaluate MPNet on various 2D and 3D environments including the planning of a 7 DOF Baxter robot manipulator. The results show that MPNet is not only consistently computationally efficient in all environments but also generalizes to completely unseen environments. The results also show that the computation time of MPNet consistently remains less than 1 second in all presented experiments, which is significantly lower than existing state-of-the-art motion planning algorithms.

Ahmed H. Qureshi, Anthony Simeonov, Mayur J. Bency, Michael C. Yip• 2018

Related benchmarks

TaskDatasetResultRank
Robotic Motion PlanningBox (held-out)
Success Rate67.3
12
Robotic Motion PlanningShelf Task III (held-out)
Success Rate (%)32
12
Robotic Motion PlanningTableTop (held-out)
Success Rate (%)49
12
Robotic Motion PlanningBins (held-out)
Success Rate (%)84.2
12
Robotic Motion PlanningShelf Task I (held-out)
Success Rate (%)40
12
Robotic Motion PlanningShelf Task II (held-out)
Success Rate34
12
Motion PlanningMπnets (Global)
Success Rate65.28
9
Motion PlanningMπnets (Hybrid)
Success Rate41.33
9
Motion PlanningMπnets (Both)
Success Rate67.67
8
Path planningRandom Forest binary map dataset (test)
Success Rate92.35
6
Showing 10 of 18 rows

Other info

Follow for update