{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:43:43Z","timestamp":1787017423785,"version":"build-2736575974"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"10","license":[{"start":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T00:00:00Z","timestamp":1569283200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation IIS","award":["1409003"],"award-info":[{"award-number":["1409003"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2019,9,24]]},"abstract":"<jats:p>To address the computational challenges that arise when planning for robotic systems, traditional CS algorithms, tools, and paradigms must be revisited.<\/jats:p>","DOI":"10.1145\/3318164","type":"journal-article","created":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T08:58:26Z","timestamp":1569315506000},"page":"54-63","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Sampling-based robot motion planning"],"prefix":"10.1145","volume":"62","author":[{"given":"Oren","family":"Salzman","sequence":"first","affiliation":[{"name":"Technion-Israel Institute of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,9,24]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2470096"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44503-X_27"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v37i2.2651"},{"key":"e_1_2_1_4_1","first-page":"2428","article-title":"Use of relaxation methods in sampling-based algorithms for optimal motion planning","volume":"2421","author":"Arslan O.","year":"2013","journal-title":"ICRA"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2261250.2261313"},{"key":"e_1_2_1_6_1","first-page":"2452","article-title":"Enhancing sampling-based kinodynamic motion planning for quadrotors","volume":"2447","author":"Boeuf A.","year":"2015","journal-title":"IROS"},{"key":"e_1_2_1_7_1","first-page":"4897","article-title":"Bayesian active edge evaluation on expensive graphs","volume":"4890","author":"Choudhury S.","year":"2018","journal-title":"IJCAI"},{"key":"e_1_2_1_8_1","first-page":"308","article-title":"Legibility and predictability of robot motion","volume":"301","author":"Dragan A.D.","year":"2013","journal-title":"HRI"},{"key":"e_1_2_1_9_1","first-page":"1256","article-title":"Adaptive neighbor connection for PRMs: A natural fit for heterogeneous environments and parallelism","volume":"1249","author":"Ekenna C.","year":"2013","journal-title":"IROS"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2830331"},{"key":"e_1_2_1_11_1","first-page":"3074","article-title":"Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs","volume":"3067","author":"Gammell J.D.","year":"2015","journal-title":"ICRA"},{"key":"e_1_2_1_12_1","first-page":"113","article-title":"The provable virtue of laziness in motion planning","volume":"106","author":"Haghtalab N.","year":"2018","journal-title":"ICAPS"},{"key":"e_1_2_1_13_1","volume-title":"Algorithmic motion planning. Handbook of Discrete and Computational Geometry","author":"Halperin D.","year":"2017","edition":"3"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2899668"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1177\/0278364906067174"},{"key":"e_1_2_1_16_1","first-page":"214","article-title":"Fast nearest neighbor search in SE(3) for sampling-based motion planning","volume":"197","author":"Ichnowski J.","year":"2014","journal-title":"WAFR"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2014.2331091"},{"key":"e_1_2_1_18_1","first-page":"7094","article-title":"Learning sampling distributions for robot motion planning","volume":"7087","author":"Ichter B.","year":"2018","journal-title":"ICRA"},{"key":"e_1_2_1_19_1","first-page":"1","article-title":"Deterministic sampling-based motion planning: Optimality, complexity, and performance","volume":"37","author":"Janson L.","year":"2018","journal-title":"I. J. Robotics Res."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915577958"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2014.2376492"},{"key":"e_1_2_1_23_1","volume-title":"WAFR","author":"Kleinbort M.","year":"2016"},{"key":"e_1_2_1_24_1","first-page":"96","article-title":"Hierarchical rejection sampling for informed kinodynamic planning in high-dimensional spaces","volume":"89","author":"Kunz T.","year":"2016","journal-title":"ICRA"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1213331"},{"key":"e_1_2_1_26_1","first-page":"1","article-title":"The essentials","volume":"18","author":"LaValle S.M.","year":"2011","journal-title":"IEEE Robotics & Automation Mag."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1177\/0278364904045481"},{"key":"e_1_2_1_28_1","first-page":"5","article-title":"Asymptotically optimal sampling-based kinodynamic planning","volume":"35","author":"Li Y.","year":"2016","journal-title":"I. J. Robotics Res."},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","DOI":"10.1017\/9781316661239","volume-title":"Modern Robotics: Mechanics, Planning, and Control","author":"Lynch K.M.","year":"2017"},{"key":"e_1_2_1_30_1","first-page":"484","article-title":"Lazy receding horizon A* for efficient path planning in graphs with expensive-to-evaluate edges","volume":"476","author":"Mandalika A.","year":"2018","journal-title":"ICAPS"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2016.XII.004"},{"key":"e_1_2_1_32_1","first-page":"18","article-title":"Quantitative analysis of nearest-neighbors search in high-dimensional sampling-based motion planning","volume":"3","author":"Plaku E.","year":"2006","journal-title":"WAFR"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2014.2331983"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201385"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2018.XIV.017"},{"key":"e_1_2_1_36_1","first-page":"10","article-title":"New perspective on sampling-based motion planning via random geometric graphs","volume":"37","author":"Solovey K.","year":"2018","journal-title":"I. J. Robotics Res."},{"key":"e_1_2_1_37_1","first-page":"6","article-title":"The complexity of the free space for a robot moving amidst fat obstacles","volume":"3","author":"Stappen A.","year":"1993","journal-title":"Computational Geometry"},{"key":"e_1_2_1_38_1","first-page":"14","article-title":"Learning and exploiting low-dimensional structure for efficient holonomic motion planning in high-dimensional spaces","volume":"31","author":"Vernaza P.","year":"2012","journal-title":"I. J. Robotics Res."},{"key":"e_1_2_1_39_1","first-page":"4194","article-title":"Toward asymptotically optimal motion planning for kinodynamic systems using a two-point boundary value problem solver","volume":"4187","author":"Xie C.","year":"2015","journal-title":"ICRA"},{"key":"e_1_2_1_40_1","first-page":"1","article-title":"Soft subdivision motion planning for complex planar robots","volume":"73","author":"Zhou B.","year":"2018","journal-title":"ESA"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318164","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:49:34Z","timestamp":1750254574000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,24]]},"references-count":40,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,9,24]]}},"alternative-id":["10.1145\/3318164"],"URL":"https:\/\/doi.org\/10.1145\/3318164","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,24]]},"assertion":[{"value":"2019-09-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}