Skip to content

Commit

Permalink
update the abstract
Browse files Browse the repository at this point in the history
  • Loading branch information
Murtaza Dalal authored and Murtaza Dalal committed Sep 10, 2024
1 parent b5b1971 commit 31c92e8
Showing 1 changed file with 7 additions and 6 deletions.
13 changes: 7 additions & 6 deletions index.html
Original file line number Diff line number Diff line change
Expand Up @@ -173,7 +173,7 @@ <h1 class="title is-1 publication-title">Neural MP: A Generalist Neural Motion P
<div class="container">
<div class="columns is-vcentered is-centered">
<div class="item item-steve"></div>
<iframe width="1920" height="740" src="https://www.youtube.com/embed/0SHJbNTg3yU?autoplay=1&mute=1&loop controls=1&vq=hd1080" frameborder="0" allowfullscreen="allowfullscreen"></iframe>
<iframe width="1920" height="740" src="https://www.youtube.com/embed/RayiF1EtbhQ?autoplay=1&mute=1&loop controls=1&vq=hd1080" frameborder="0" allowfullscreen="allowfullscreen"></iframe>
</div>
</br>
</div>
Expand Down Expand Up @@ -257,11 +257,12 @@ <h2 class="subtitle has-text-centered">
<h2 class="title is-3">Abstract</h2>
<div class="content has-text-justified">
<p>
The current paradigm for motion planning generates solutions from scratch for every new problem, which consumes significant amounts of time and computational resources.
Inspired by the ability of humans to leverage their prior experience to quickly solve new tasks, we seek to apply large-scale data-driven learning to the problem of motion planning.
The current paradigm for motion planning generates solutions from scratch for every new problem, which consumes significant amounts of time and computational resources.
For complex, cluttered scenes, motion planning approaches can often take minutes to produce a solution, while humans are able to accurately and safely reach any goal in seconds by leveraging their prior experience.
We seek to do the same by applying data-driven learning at scale to the problem of motion planning.
Our approach builds a large number of complex scenes in simulation, collects expert data from a motion planner, then <i>distills</i> it into a reactive generalist policy.
We then combine this with simple forward samplers and lightweight optimization to obtain a safe path for real world deployment.
We perform a thorough evaluation of our method on <b>64</b> motion planning tasks across four diverse environments with randomized poses, scenes and obstacles, in the real world, demonstrating an improvement of <b>23%</b>, <b>17%</b> and <b>79%</b> motion planning success rate over state of the art sampling, optimization and learning based planning methods.
We then combine this with lightweight optimization to obtain a safe path for real world deployment.
We perform a thorough evaluation of our method on <b>64</b> real-world motion planning tasks across four diverse environments with randomized poses, scenes and obstacles, in the real world, demonstrating an improvement of <b>23</b>, <b>17</b> and <b>79</b> motion planning success rate over state of the art sampling, optimization and learning based planning methods.
</p>
</div>
</div>
Expand Down Expand Up @@ -719,7 +720,7 @@ <h2 class="title">BibTeX</h2>
<pre><code>@article{dalal2024neuralmp,
title={Neural MP: A Generalist Neural Motion Planner},
author={Murtaza Dalal and Jiahui Yang and Russell Mendonca and Youssef Khaky and Ruslan Salakhutdinov and Deepak Pathak},
journal = {},
journal = {arXiv preprint arXiv:2409.05864},
year={2024},
} </code></pre>
</div>
Expand Down

0 comments on commit 31c92e8

Please sign in to comment.