{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/motion-planning-networks","title":"Motion Planning Networks","arxiv_id":"1806.05767","date":"2018-06-14","proceeding":null,"authors":["Ahmed H. Qureshi","Anthony Simeonov","Mayur J. Bency","Michael C. Yip"],"abstract":"Fast and efficient motion planning algorithms are crucial for many\nstate-of-the-art robotics applications such as self-driving cars. Existing\nmotion planning methods become ineffective as their computational complexity\nincreases exponentially with the dimensionality of the motion planning problem.\nTo address this issue, we present Motion Planning Networks (MPNet), a neural\nnetwork-based novel planning algorithm. The proposed method encodes the given\nworkspaces directly from a point cloud measurement and generates the end-to-end\ncollision-free paths for the given start and goal configurations. We evaluate\nMPNet on various 2D and 3D environments including the planning of a 7 DOF\nBaxter robot manipulator. The results show that MPNet is not only consistently\ncomputationally efficient in all environments but also generalizes to\ncompletely unseen environments. The results also show that the computation time\nof MPNet consistently remains less than 1 second in all presented experiments,\nwhich is significantly lower than existing state-of-the-art motion planning\nalgorithms.","url_abs":"http://arxiv.org/abs/1806.05767v2","url_pdf":"http://arxiv.org/pdf/1806.05767v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"motion-planning-networks","repo_url":"https://github.com/ahq1993/MPNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"motion-planning","task_name":"Motion Planning"},{"task_slug":"self-driving-cars","task_name":"Self-Driving Cars"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1806.05767","atlas_url":"https://app.syntology.ai/?focus=1806.05767","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1806.05767"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1806.05767\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1806.05767"},"call":"get_concepts_for_paper(arxiv_id=\"1806.05767\")"}],"by_repo":[{"repo":"ahq1993/MPNet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1907.06013"],"harvested_for_calls":[{"arxiv_id":"1907.06013","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1907.06013"},"call":"get_harvested_code_for_paper(arxiv_id=\"1907.06013\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"c60d92dd3c5de2c74bd276d1453c92dfcf5c8c7439863782d3785430b8933df5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}