{"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/deeply-informed-neural-sampling-for-robot","title":"Deeply Informed Neural Sampling for Robot Motion Planning","arxiv_id":"1809.10252","date":"2018-09-26","proceeding":null,"authors":["Ahmed H. Qureshi","Michael C. Yip"],"abstract":"Sampling-based Motion Planners (SMPs) have become increasingly popular as\nthey provide collision-free path solutions regardless of obstacle geometry in a\ngiven environment. However, their computational complexity increases\nsignificantly with the dimensionality of the motion planning problem. Adaptive\nsampling is one of the ways to speed up SMPs by sampling a particular region of\na configuration space that is more likely to contain an optimal path solution.\nAlthough there are a wide variety of algorithms for adaptive sampling, they\nrely on hand-crafted heuristics; furthermore, their performance decreases\nsignificantly in high-dimensional spaces. In this paper, we present a neural\nnetwork-based adaptive sampler for motion planning called Deep Sampling-based\nMotion Planner (DeepSMP). DeepSMP generates samples for SMPs and enhances their\noverall speed significantly while exhibiting efficient scalability to\nhigher-dimensional problems. DeepSMP's neural architecture comprises of a\nContractive AutoEncoder which encodes given workspaces directly from a raw\npoint cloud data, and a Dropout-based stochastic deep feedforward neural\nnetwork which takes the workspace encoding, start and goal configuration, and\niteratively generates feasible samples for SMPs to compute end-to-end\ncollision-free optimal paths. DeepSMP is not only consistently computationally\nefficient in all tested environments but has also shown remarkable\ngeneralization to completely unseen environments. We evaluate DeepSMP on\nmultiple planning problems including planning of a point-mass robot,\nrigid-body, 6-link robotic manipulator in various 2D and 3D environments. The\nresults show that on average our method is at least 7 times faster in\npoint-mass and rigid-body case and about 28 times faster in 6-link robot case\nthan the existing state-of-the-art.","url_abs":"http://arxiv.org/abs/1809.10252v1","url_pdf":"http://arxiv.org/pdf/1809.10252v1.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":"deeply-informed-neural-sampling-for-robot","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"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.10252","atlas_url":"https://app.syntology.ai/?focus=1809.10252","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":"1809.10252"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.10252\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.10252"},"call":"get_concepts_for_paper(arxiv_id=\"1809.10252\")"}],"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":"de06725f3e56c1da44729bcf271f517235096a43d0129acc0ec6382cda28d642","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}